./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label21_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label21_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/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 9204823cbe2b352839849e2ea06b227f99a40c67 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 08:28:01,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:28:01,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:28:01,034 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:28:01,034 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:28:01,035 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:28:01,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:28:01,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:28:01,039 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:28:01,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:28:01,041 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:28:01,042 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:28:01,042 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:28:01,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:28:01,044 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:28:01,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:28:01,046 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:28:01,048 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:28:01,050 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:28:01,051 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:28:01,052 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:28:01,053 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:28:01,056 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:28:01,056 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:28:01,057 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:28:01,057 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:28:01,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:28:01,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:28:01,060 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:28:01,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:28:01,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:28:01,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:28:01,062 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:28:01,062 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:28:01,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:28:01,063 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:28:01,064 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 08:28:01,076 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:28:01,076 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:28:01,077 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 08:28:01,077 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 08:28:01,077 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 08:28:01,077 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 08:28:01,078 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 08:28:01,078 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 08:28:01,078 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 08:28:01,078 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 08:28:01,078 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 08:28:01,079 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:28:01,079 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:28:01,080 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:28:01,080 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:28:01,080 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:28:01,080 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 08:28:01,080 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 08:28:01,080 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 08:28:01,081 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:28:01,081 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:28:01,081 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 08:28:01,081 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:28:01,081 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:28:01,082 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 08:28:01,082 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 08:28:01,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 08:28:01,082 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:28:01,082 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 08:28:01,082 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 08:28:01,083 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 08:28:01,085 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 08:28:01,086 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 08:28:01,086 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 08:28:01,086 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_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/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 -> 9204823cbe2b352839849e2ea06b227f99a40c67 [2018-11-10 08:28:01,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:28:01,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:28:01,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:28:01,128 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:28:01,128 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:28:01,129 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem14_label21_true-unreach-call_false-termination.c [2018-11-10 08:28:01,178 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/bin-2019/utaipan/data/06d798982/08ae9854b3a74dd8b904498588bf0099/FLAGb13aa14c2 [2018-11-10 08:28:01,620 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:28:01,621 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/sv-benchmarks/c/eca-rers2012/Problem14_label21_true-unreach-call_false-termination.c [2018-11-10 08:28:01,634 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/bin-2019/utaipan/data/06d798982/08ae9854b3a74dd8b904498588bf0099/FLAGb13aa14c2 [2018-11-10 08:28:01,648 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/bin-2019/utaipan/data/06d798982/08ae9854b3a74dd8b904498588bf0099 [2018-11-10 08:28:01,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:28:01,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:28:01,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:28:01,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:28:01,656 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:28:01,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:28:01" (1/1) ... [2018-11-10 08:28:01,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cef0fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:01, skipping insertion in model container [2018-11-10 08:28:01,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:28:01" (1/1) ... [2018-11-10 08:28:01,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:28:01,713 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:28:02,030 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:28:02,035 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:28:02,146 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:28:02,162 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:28:02,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:02 WrapperNode [2018-11-10 08:28:02,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:28:02,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:28:02,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:28:02,164 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:28:02,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:02" (1/1) ... [2018-11-10 08:28:02,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:02" (1/1) ... [2018-11-10 08:28:02,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:28:02,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:28:02,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:28:02,330 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:28:02,338 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:02" (1/1) ... [2018-11-10 08:28:02,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:02" (1/1) ... [2018-11-10 08:28:02,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:02" (1/1) ... [2018-11-10 08:28:02,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:02" (1/1) ... [2018-11-10 08:28:02,367 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:02" (1/1) ... [2018-11-10 08:28:02,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:02" (1/1) ... [2018-11-10 08:28:02,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:02" (1/1) ... [2018-11-10 08:28:02,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:28:02,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:28:02,396 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:28:02,396 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:28:02,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/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-10 08:28:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 08:28:02,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 08:28:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 08:28:02,449 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 08:28:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:28:02,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:28:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 08:28:02,450 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 08:28:03,639 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:28:03,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:28:03 BoogieIcfgContainer [2018-11-10 08:28:03,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:28:03,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 08:28:03,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 08:28:03,644 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 08:28:03,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:28:01" (1/3) ... [2018-11-10 08:28:03,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdd066f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:28:03, skipping insertion in model container [2018-11-10 08:28:03,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:28:02" (2/3) ... [2018-11-10 08:28:03,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdd066f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:28:03, skipping insertion in model container [2018-11-10 08:28:03,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:28:03" (3/3) ... [2018-11-10 08:28:03,647 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label21_true-unreach-call_false-termination.c [2018-11-10 08:28:03,655 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 08:28:03,662 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 08:28:03,674 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 08:28:03,705 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 08:28:03,705 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 08:28:03,705 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 08:28:03,705 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:28:03,705 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:28:03,706 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 08:28:03,706 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:28:03,706 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 08:28:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2018-11-10 08:28:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-10 08:28:03,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:28:03,736 INFO L375 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] [2018-11-10 08:28:03,738 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:28:03,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:28:03,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1101027815, now seen corresponding path program 1 times [2018-11-10 08:28:03,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:28:03,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:28:03,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:28:03,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:28:03,785 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:28:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:28:03,996 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-10 08:28:03,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:28:03,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:28:03,999 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:28:04,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:28:04,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:28:04,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:28:04,016 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 3 states. [2018-11-10 08:28:04,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:28:04,970 INFO L93 Difference]: Finished difference Result 691 states and 1226 transitions. [2018-11-10 08:28:04,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:28:04,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-11-10 08:28:04,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:28:04,984 INFO L225 Difference]: With dead ends: 691 [2018-11-10 08:28:04,985 INFO L226 Difference]: Without dead ends: 434 [2018-11-10 08:28:04,990 INFO L605 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-10 08:28:05,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-11-10 08:28:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-11-10 08:28:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-11-10 08:28:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 767 transitions. [2018-11-10 08:28:05,055 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 767 transitions. Word has length 41 [2018-11-10 08:28:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:28:05,055 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 767 transitions. [2018-11-10 08:28:05,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:28:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 767 transitions. [2018-11-10 08:28:05,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 08:28:05,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:28:05,061 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:28:05,061 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:28:05,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:28:05,061 INFO L82 PathProgramCache]: Analyzing trace with hash 212852571, now seen corresponding path program 1 times [2018-11-10 08:28:05,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:28:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:28:05,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:28:05,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:28:05,064 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:28:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:28:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:28:05,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:28:05,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:28:05,250 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:28:05,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 08:28:05,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:28:05,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:28:05,253 INFO L87 Difference]: Start difference. First operand 434 states and 767 transitions. Second operand 5 states. [2018-11-10 08:28:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:28:08,126 INFO L93 Difference]: Finished difference Result 1416 states and 2580 transitions. [2018-11-10 08:28:08,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:28:08,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-11-10 08:28:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:28:08,138 INFO L225 Difference]: With dead ends: 1416 [2018-11-10 08:28:08,139 INFO L226 Difference]: Without dead ends: 988 [2018-11-10 08:28:08,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:28:08,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2018-11-10 08:28:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 973. [2018-11-10 08:28:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2018-11-10 08:28:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1540 transitions. [2018-11-10 08:28:08,187 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1540 transitions. Word has length 118 [2018-11-10 08:28:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:28:08,188 INFO L481 AbstractCegarLoop]: Abstraction has 973 states and 1540 transitions. [2018-11-10 08:28:08,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 08:28:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1540 transitions. [2018-11-10 08:28:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 08:28:08,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:28:08,193 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:28:08,193 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:28:08,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:28:08,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2137480229, now seen corresponding path program 1 times [2018-11-10 08:28:08,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:28:08,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:28:08,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:28:08,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:28:08,195 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:28:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:28:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:28:08,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:28:08,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:28:08,392 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:28:08,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 08:28:08,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:28:08,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:28:08,394 INFO L87 Difference]: Start difference. First operand 973 states and 1540 transitions. Second operand 6 states. [2018-11-10 08:28:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:28:09,561 INFO L93 Difference]: Finished difference Result 2353 states and 3939 transitions. [2018-11-10 08:28:09,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:28:09,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2018-11-10 08:28:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:28:09,569 INFO L225 Difference]: With dead ends: 2353 [2018-11-10 08:28:09,569 INFO L226 Difference]: Without dead ends: 1386 [2018-11-10 08:28:09,571 INFO L605 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-10 08:28:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-11-10 08:28:09,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1352. [2018-11-10 08:28:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-11-10 08:28:09,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2126 transitions. [2018-11-10 08:28:09,613 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2126 transitions. Word has length 182 [2018-11-10 08:28:09,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:28:09,613 INFO L481 AbstractCegarLoop]: Abstraction has 1352 states and 2126 transitions. [2018-11-10 08:28:09,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 08:28:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2126 transitions. [2018-11-10 08:28:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 08:28:09,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:28:09,617 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:28:09,617 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:28:09,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:28:09,617 INFO L82 PathProgramCache]: Analyzing trace with hash -779677212, now seen corresponding path program 1 times [2018-11-10 08:28:09,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:28:09,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:28:09,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:28:09,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:28:09,619 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:28:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:28:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 143 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:28:09,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:28:09,758 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:28:09,758 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 203 with the following transitions: [2018-11-10 08:28:09,760 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-10 08:28:09,812 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:28:09,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:28:11,027 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:28:11,028 INFO L272 AbstractInterpreter]: Visited 89 different actions 89 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-10 08:28:11,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:28:11,039 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:28:12,327 INFO L227 lantSequenceWeakener]: Weakened 194 states. On average, predicates are now at 77.91% of their original sizes. [2018-11-10 08:28:12,328 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:28:12,425 INFO L415 sIntCurrentIteration]: We unified 201 AI predicates to 201 [2018-11-10 08:28:12,426 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:28:12,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:28:12,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2018-11-10 08:28:12,427 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:28:12,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 08:28:12,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:28:12,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:28:12,428 INFO L87 Difference]: Start difference. First operand 1352 states and 2126 transitions. Second operand 7 states. [2018-11-10 08:28:13,071 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:28:19,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:28:19,674 INFO L93 Difference]: Finished difference Result 2883 states and 4473 transitions. [2018-11-10 08:28:19,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:28:19,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2018-11-10 08:28:19,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:28:19,681 INFO L225 Difference]: With dead ends: 2883 [2018-11-10 08:28:19,681 INFO L226 Difference]: Without dead ends: 1537 [2018-11-10 08:28:19,686 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 202 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:28:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-11-10 08:28:19,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1535. [2018-11-10 08:28:19,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-10 08:28:19,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2316 transitions. [2018-11-10 08:28:19,729 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2316 transitions. Word has length 202 [2018-11-10 08:28:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:28:19,730 INFO L481 AbstractCegarLoop]: Abstraction has 1535 states and 2316 transitions. [2018-11-10 08:28:19,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 08:28:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2316 transitions. [2018-11-10 08:28:19,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-11-10 08:28:19,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:28:19,736 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:28:19,736 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:28:19,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:28:19,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1751229010, now seen corresponding path program 1 times [2018-11-10 08:28:19,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:28:19,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:28:19,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:28:19,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:28:19,738 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:28:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:28:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 189 proven. 146 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 08:28:20,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:28:20,263 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:28:20,263 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 288 with the following transitions: [2018-11-10 08:28:20,263 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-10 08:28:20,267 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:28:20,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:28:22,501 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:28:22,501 INFO L272 AbstractInterpreter]: Visited 94 different actions 181 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 08:28:22,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:28:22,507 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:28:25,187 INFO L227 lantSequenceWeakener]: Weakened 107 states. On average, predicates are now at 78.71% of their original sizes. [2018-11-10 08:28:25,187 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:28:45,613 INFO L415 sIntCurrentIteration]: We unified 286 AI predicates to 286 [2018-11-10 08:28:45,614 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:28:45,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:28:45,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [12] total 31 [2018-11-10 08:28:45,614 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:28:45,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 08:28:45,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 08:28:45,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-11-10 08:28:45,615 INFO L87 Difference]: Start difference. First operand 1535 states and 2316 transitions. Second operand 21 states. [2018-11-10 08:29:43,596 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:31:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:31:12,499 INFO L93 Difference]: Finished difference Result 4074 states and 5896 transitions. [2018-11-10 08:31:12,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 08:31:12,499 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 287 [2018-11-10 08:31:12,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:31:12,507 INFO L225 Difference]: With dead ends: 4074 [2018-11-10 08:31:12,507 INFO L226 Difference]: Without dead ends: 2728 [2018-11-10 08:31:12,511 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 293 GetRequests, 247 SyntacticMatches, 20 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-11-10 08:31:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2018-11-10 08:31:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2479. [2018-11-10 08:31:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2018-11-10 08:31:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3321 transitions. [2018-11-10 08:31:12,650 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3321 transitions. Word has length 287 [2018-11-10 08:31:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:31:12,650 INFO L481 AbstractCegarLoop]: Abstraction has 2479 states and 3321 transitions. [2018-11-10 08:31:12,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 08:31:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3321 transitions. [2018-11-10 08:31:12,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-11-10 08:31:12,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:31:12,659 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 08:31:12,659 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:31:12,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:31:12,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1629439746, now seen corresponding path program 1 times [2018-11-10 08:31:12,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:31:12,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:31:12,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:31:12,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:31:12,661 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:31:12,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:31:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 161 proven. 125 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-10 08:31:12,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:31:12,954 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:31:12,954 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 314 with the following transitions: [2018-11-10 08:31:12,954 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-10 08:31:12,958 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:31:12,959 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:31:16,768 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:31:16,769 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 5 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 08:31:16,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:31:16,771 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:31:19,661 INFO L227 lantSequenceWeakener]: Weakened 181 states. On average, predicates are now at 78.11% of their original sizes. [2018-11-10 08:31:19,661 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:31:25,063 INFO L415 sIntCurrentIteration]: We unified 312 AI predicates to 312 [2018-11-10 08:31:25,064 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:31:25,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:31:25,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [8] total 22 [2018-11-10 08:31:25,064 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:31:25,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 08:31:25,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 08:31:25,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-11-10 08:31:25,065 INFO L87 Difference]: Start difference. First operand 2479 states and 3321 transitions. Second operand 16 states. [2018-11-10 08:32:19,908 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:33:08,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:33:08,788 INFO L93 Difference]: Finished difference Result 4199 states and 5901 transitions. [2018-11-10 08:33:08,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 08:33:08,788 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 313 [2018-11-10 08:33:08,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:33:08,794 INFO L225 Difference]: With dead ends: 4199 [2018-11-10 08:33:08,794 INFO L226 Difference]: Without dead ends: 2853 [2018-11-10 08:33:08,797 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 320 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-11-10 08:33:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2018-11-10 08:33:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2847. [2018-11-10 08:33:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2847 states. [2018-11-10 08:33:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2847 states to 2847 states and 3717 transitions. [2018-11-10 08:33:08,969 INFO L78 Accepts]: Start accepts. Automaton has 2847 states and 3717 transitions. Word has length 313 [2018-11-10 08:33:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:33:08,970 INFO L481 AbstractCegarLoop]: Abstraction has 2847 states and 3717 transitions. [2018-11-10 08:33:08,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 08:33:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2847 states and 3717 transitions. [2018-11-10 08:33:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-11-10 08:33:08,976 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:33:08,976 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:33:08,976 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:33:08,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:33:08,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1902382058, now seen corresponding path program 1 times [2018-11-10 08:33:08,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:33:08,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:33:08,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:33:08,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:33:08,978 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:33:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:33:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 257 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 08:33:09,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:33:09,134 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:33:09,134 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 340 with the following transitions: [2018-11-10 08:33:09,134 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-10 08:33:09,137 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:33:09,138 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:33:12,565 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:33:29,247 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 08:33:29,247 INFO L272 AbstractInterpreter]: Visited 120 different actions 469 times. Merged at 7 different actions 22 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-10 08:33:29,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:33:29,249 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 08:33:30,854 INFO L227 lantSequenceWeakener]: Weakened 226 states. On average, predicates are now at 78.1% of their original sizes. [2018-11-10 08:33:30,854 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 08:34:08,371 INFO L415 sIntCurrentIteration]: We unified 338 AI predicates to 338 [2018-11-10 08:34:08,372 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 08:34:08,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:34:08,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [7] total 22 [2018-11-10 08:34:08,372 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:34:08,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 08:34:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 08:34:08,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-10 08:34:08,373 INFO L87 Difference]: Start difference. First operand 2847 states and 3717 transitions. Second operand 17 states. [2018-11-10 08:35:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:35:20,535 INFO L93 Difference]: Finished difference Result 4390 states and 6165 transitions. [2018-11-10 08:35:20,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 08:35:20,536 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 339 [2018-11-10 08:35:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:35:20,541 INFO L225 Difference]: With dead ends: 4390 [2018-11-10 08:35:20,541 INFO L226 Difference]: Without dead ends: 3044 [2018-11-10 08:35:20,543 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 351 GetRequests, 152 SyntacticMatches, 171 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2018-11-10 08:35:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2018-11-10 08:35:20,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3034. [2018-11-10 08:35:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3034 states. [2018-11-10 08:35:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 3942 transitions. [2018-11-10 08:35:20,698 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 3942 transitions. Word has length 339 [2018-11-10 08:35:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:35:20,699 INFO L481 AbstractCegarLoop]: Abstraction has 3034 states and 3942 transitions. [2018-11-10 08:35:20,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 08:35:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 3942 transitions. [2018-11-10 08:35:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-11-10 08:35:20,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:35:20,705 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:35:20,705 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:35:20,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash -779213104, now seen corresponding path program 1 times [2018-11-10 08:35:20,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:35:20,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:20,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:20,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:20,706 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:35:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:20,873 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 229 proven. 157 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-10 08:35:20,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:35:20,874 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:35:20,874 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 399 with the following transitions: [2018-11-10 08:35:20,874 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-10 08:35:20,876 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:35:20,876 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:35:25,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:35:25,964 INFO L272 AbstractInterpreter]: Visited 122 different actions 359 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-10 08:35:25,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:25,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:35:25,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:35:25,966 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/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-10 08:35:25,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:25,972 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:35:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:26,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:35:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 471 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-10 08:35:26,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:35:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 229 proven. 157 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-11-10 08:35:26,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:35:26,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-11-10 08:35:26,344 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:35:26,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:35:26,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:35:26,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:35:26,345 INFO L87 Difference]: Start difference. First operand 3034 states and 3942 transitions. Second operand 9 states. [2018-11-10 08:35:29,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:35:29,567 INFO L93 Difference]: Finished difference Result 8072 states and 11490 transitions. [2018-11-10 08:35:29,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 08:35:29,567 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 398 [2018-11-10 08:35:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:35:29,580 INFO L225 Difference]: With dead ends: 8072 [2018-11-10 08:35:29,580 INFO L226 Difference]: Without dead ends: 4669 [2018-11-10 08:35:29,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 813 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2018-11-10 08:35:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2018-11-10 08:35:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4409. [2018-11-10 08:35:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2018-11-10 08:35:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5598 transitions. [2018-11-10 08:35:29,816 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 5598 transitions. Word has length 398 [2018-11-10 08:35:29,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:35:29,816 INFO L481 AbstractCegarLoop]: Abstraction has 4409 states and 5598 transitions. [2018-11-10 08:35:29,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:35:29,816 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 5598 transitions. [2018-11-10 08:35:29,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-11-10 08:35:29,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:35:29,829 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 08:35:29,829 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:35:29,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:29,829 INFO L82 PathProgramCache]: Analyzing trace with hash 185450881, now seen corresponding path program 1 times [2018-11-10 08:35:29,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:35:29,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:29,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:29,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:29,830 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:35:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 229 proven. 166 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-11-10 08:35:30,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:35:30,054 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:35:30,054 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 446 with the following transitions: [2018-11-10 08:35:30,054 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-10 08:35:30,056 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:35:30,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:35:31,669 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:35:39,571 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:35:39,571 INFO L272 AbstractInterpreter]: Visited 124 different actions 365 times. Merged at 7 different actions 17 times. Never widened. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-10 08:35:39,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:39,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:35:39,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:35:39,579 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/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-10 08:35:39,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:39,584 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:35:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:39,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:35:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 525 proven. 2 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-11-10 08:35:39,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:35:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 692 backedges. 229 proven. 166 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2018-11-10 08:35:39,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 08:35:39,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2018-11-10 08:35:39,984 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 08:35:39,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 08:35:39,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:35:39,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-10 08:35:39,985 INFO L87 Difference]: Start difference. First operand 4409 states and 5598 transitions. Second operand 9 states. [2018-11-10 08:35:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:35:41,721 INFO L93 Difference]: Finished difference Result 11458 states and 15147 transitions. [2018-11-10 08:35:41,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 08:35:41,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 445 [2018-11-10 08:35:41,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:35:41,737 INFO L225 Difference]: With dead ends: 11458 [2018-11-10 08:35:41,737 INFO L226 Difference]: Without dead ends: 6738 [2018-11-10 08:35:41,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 918 GetRequests, 896 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2018-11-10 08:35:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2018-11-10 08:35:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 6149. [2018-11-10 08:35:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6149 states. [2018-11-10 08:35:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 7503 transitions. [2018-11-10 08:35:41,954 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 7503 transitions. Word has length 445 [2018-11-10 08:35:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:35:41,954 INFO L481 AbstractCegarLoop]: Abstraction has 6149 states and 7503 transitions. [2018-11-10 08:35:41,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 08:35:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 7503 transitions. [2018-11-10 08:35:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-11-10 08:35:41,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:35:41,962 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 08:35:41,962 INFO L424 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:35:41,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:41,962 INFO L82 PathProgramCache]: Analyzing trace with hash 916834010, now seen corresponding path program 1 times [2018-11-10 08:35:41,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:35:41,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:41,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:41,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:41,963 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:35:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:42,426 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 247 proven. 449 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 08:35:42,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:35:42,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:35:42,426 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 449 with the following transitions: [2018-11-10 08:35:42,426 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [594], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-10 08:35:42,428 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:35:42,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:35:43,500 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:35:52,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:35:52,393 INFO L272 AbstractInterpreter]: Visited 124 different actions 365 times. Merged at 7 different actions 17 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-10 08:35:52,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:52,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:35:52,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:35:52,395 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/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-10 08:35:52,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:52,400 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:35:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:52,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:35:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2018-11-10 08:35:52,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:35:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2018-11-10 08:35:52,638 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:35:52,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [15] total 17 [2018-11-10 08:35:52,638 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:35:52,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:35:52,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:35:52,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-10 08:35:52,639 INFO L87 Difference]: Start difference. First operand 6149 states and 7503 transitions. Second operand 3 states. [2018-11-10 08:35:53,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:35:53,160 INFO L93 Difference]: Finished difference Result 13643 states and 17169 transitions. [2018-11-10 08:35:53,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:35:53,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 448 [2018-11-10 08:35:53,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:35:53,180 INFO L225 Difference]: With dead ends: 13643 [2018-11-10 08:35:53,180 INFO L226 Difference]: Without dead ends: 7870 [2018-11-10 08:35:53,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 895 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2018-11-10 08:35:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7870 states. [2018-11-10 08:35:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7870 to 7870. [2018-11-10 08:35:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7870 states. [2018-11-10 08:35:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7870 states to 7870 states and 9585 transitions. [2018-11-10 08:35:53,352 INFO L78 Accepts]: Start accepts. Automaton has 7870 states and 9585 transitions. Word has length 448 [2018-11-10 08:35:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:35:53,352 INFO L481 AbstractCegarLoop]: Abstraction has 7870 states and 9585 transitions. [2018-11-10 08:35:53,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:35:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 7870 states and 9585 transitions. [2018-11-10 08:35:53,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-11-10 08:35:53,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 08:35:53,358 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:35:53,359 INFO L424 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 08:35:53,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:35:53,359 INFO L82 PathProgramCache]: Analyzing trace with hash 649949729, now seen corresponding path program 1 times [2018-11-10 08:35:53,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 08:35:53,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:53,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:35:53,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:35:53,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 08:35:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:35:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 247 proven. 471 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 08:35:53,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:35:53,799 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 08:35:53,800 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 460 with the following transitions: [2018-11-10 08:35:53,800 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [229], [231], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [566], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [638], [639], [643], [647], [651], [655], [658], [659], [663], [666], [948], [952], [956], [962], [966], [968], [973], [974], [975], [977], [978] [2018-11-10 08:35:53,802 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 08:35:53,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 08:35:54,854 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 08:36:03,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 08:36:03,801 INFO L272 AbstractInterpreter]: Visited 124 different actions 364 times. Merged at 7 different actions 16 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-10 08:36:03,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:36:03,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 08:36:03,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:36:03,803 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/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-10 08:36:03,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:36:03,808 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 08:36:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:36:03,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:36:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-11-10 08:36:03,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 08:36:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-11-10 08:36:04,037 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:36:04,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [15] total 16 [2018-11-10 08:36:04,037 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 08:36:04,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 08:36:04,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:36:04,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-11-10 08:36:04,038 INFO L87 Difference]: Start difference. First operand 7870 states and 9585 transitions. Second operand 3 states. [2018-11-10 08:36:04,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:36:04,830 INFO L93 Difference]: Finished difference Result 18085 states and 22572 transitions. [2018-11-10 08:36:04,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:36:04,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 459 [2018-11-10 08:36:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 08:36:04,836 INFO L225 Difference]: With dead ends: 18085 [2018-11-10 08:36:04,836 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 08:36:04,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 933 GetRequests, 917 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-11-10 08:36:04,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 08:36:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 08:36:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 08:36:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 08:36:04,874 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 459 [2018-11-10 08:36:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 08:36:04,874 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:36:04,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 08:36:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 08:36:04,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 08:36:04,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 08:36:05,021 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 362 [2018-11-10 08:36:06,352 WARN L179 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 1186 [2018-11-10 08:36:08,506 WARN L179 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 1477 DAG size of output: 1477 [2018-11-10 08:36:10,028 WARN L179 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 1447 DAG size of output: 1352 [2018-11-10 08:36:15,921 WARN L179 SmtUtils]: Spent 5.87 s on a formula simplification. DAG size of input: 1943 DAG size of output: 1943 [2018-11-10 08:36:25,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:25,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:25,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:25,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:25,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:25,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:25,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:25,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:35,081 WARN L179 SmtUtils]: Spent 19.13 s on a formula simplification. DAG size of input: 2294 DAG size of output: 2252 [2018-11-10 08:36:39,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:41,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:41,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:41,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:41,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:44,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:44,828 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:44,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:45,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 08:36:45,467 WARN L179 SmtUtils]: Spent 10.38 s on a formula simplification. DAG size of input: 2302 DAG size of output: 2100 [2018-11-10 08:36:46,044 WARN L179 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 362 DAG size of output: 45 [2018-11-10 08:36:57,039 WARN L179 SmtUtils]: Spent 10.99 s on a formula simplification. DAG size of input: 998 DAG size of output: 77 [2018-11-10 08:37:11,603 WARN L179 SmtUtils]: Spent 14.52 s on a formula simplification. DAG size of input: 1926 DAG size of output: 103 [2018-11-10 08:38:09,231 WARN L179 SmtUtils]: Spent 57.59 s on a formula simplification. DAG size of input: 1858 DAG size of output: 102 [2018-11-10 08:38:30,126 WARN L179 SmtUtils]: Spent 20.88 s on a formula simplification. DAG size of input: 1736 DAG size of output: 97 [2018-11-10 08:38:30,128 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 08:38:30,128 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a12~0 |old(~a12~0)|) (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)) [2018-11-10 08:38:30,128 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 08:38:30,128 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-11-10 08:38:30,128 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-11-10 08:38:30,128 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,128 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,129 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-10 08:38:30,130 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-11-10 08:38:30,131 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 106) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,132 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-10 08:38:30,133 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-10 08:38:30,134 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-10 08:38:30,134 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-11-10 08:38:30,134 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 872) the Hoare annotation is: (let ((.cse7 (= ~a12~0 |old(~a12~0)|)) (.cse5 (* 2 |old(~a15~0)|))) (let ((.cse2 (= 8 |old(~a15~0)|)) (.cse3 (not (= 1 |old(~a24~0)|))) (.cse1 (= 8 |old(~a21~0)|)) (.cse4 (< 16 .cse5)) (.cse6 (= 7 |old(~a21~0)|)) (.cse0 (and .cse7 (= ~a21~0 |old(~a21~0)|) (= |old(~a15~0)| ~a15~0)))) (and (or .cse0 (or .cse1 .cse2 (= 9 |old(~a15~0)|))) (or .cse0 (<= |old(~a12~0)| 11) .cse2) (or (= ~a24~0 1) .cse2 (< 6 |old(~a21~0)|) (< |old(~a15~0)| (+ |old(~a24~0)| 4)) (< (+ |old(~a21~0)| |old(~a24~0)|) 7) .cse3 (not (= 0 (+ |old(~a12~0)| 49))) .cse4) (or (and (or (< .cse5 16) (< (+ |old(~a21~0)| |old(~a12~0)| 39) 0)) (or (not .cse6) (< 0 (+ (* 2 |old(~a12~0)|) 98)))) (and .cse7 (<= ~a21~0 |old(~a21~0)|) (<= 2 (* 2 ~a24~0)) (= ~a15~0 |old(~a15~0)|) (<= 14 (* 2 ~a21~0)) (<= (+ ~a24~0 7) ~a15~0)) (< 10 (+ |old(~a21~0)| |old(~a12~0)|)) (< |old(~a15~0)| (+ |calculate_output_#in~input| 2)) (< 20 (* 2 |old(~a21~0)|)) (< (+ |old(~a12~0)| |old(~a24~0)| 48) 0) (< (+ |old(~a15~0)| |old(~a21~0)|) 15) (< (+ |calculate_output_#in~input| 7) |old(~a15~0)|) .cse3 .cse1 .cse4) (or .cse6 (< |old(~a15~0)| 7) .cse0)))) [2018-11-10 08:38:30,134 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-11-10 08:38:30,134 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-11-10 08:38:30,134 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,134 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,134 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,134 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-10 08:38:30,134 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-10 08:38:30,134 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-11-10 08:38:30,135 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,136 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-11-10 08:38:30,137 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,138 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-10 08:38:30,139 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-11-10 08:38:30,140 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,141 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-10 08:38:30,142 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-11-10 08:38:30,143 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 08:38:30,144 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 (+ ~a12~0 ~inputF~0 43)) (<= 10 (* 2 ~inputE~0)) (<= 5 (+ ~inputB~0 ~inputC~0)) (<= (+ ~a15~0 ~inputF~0) 14) (<= 12 (+ ~inputE~0 ~a21~0)) (<= (+ ~a24~0 ~inputD~0) 5) (<= (+ ~inputB~0 2) ~inputD~0) (<= 16 (* 2 ~a15~0)) (<= ~inputF~0 (+ ~a24~0 5)) (<= (+ ~a21~0 ~inputC~0) 10) (<= ~inputE~0 (+ ~inputA~0 4)) (<= (+ ~inputA~0 ~a12~0 48) 0)) [2018-11-10 08:38:30,144 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 08:38:30,144 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 08:38:30,144 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 874 890) the Hoare annotation is: (let ((.cse0 (+ |old(~a12~0)| 54)) (.cse1 (+ |old(~a12~0)| 50))) (or (and (<= 0 (+ ~a12~0 ~inputD~0 45)) (<= 6 (+ ~a24~0 ~inputE~0)) (<= ~a15~0 (+ ~a21~0 1)) (<= ~a21~0 (+ ~inputB~0 5)) (= ~a15~0 |old(~a15~0)|) (<= (+ ~a12~0 ~inputC~0 46) 0) (<= (+ ~a24~0 ~inputB~0) 3)) (< .cse0 ~inputE~0) (< 12 (+ |old(~a15~0)| ~inputD~0)) (< ~inputD~0 (+ |old(~a24~0)| 3)) (< .cse1 ~inputA~0) (< |old(~a15~0)| (+ |old(~a21~0)| 1)) (< ~inputE~0 .cse0) (< (+ |old(~a21~0)| ~inputF~0) 13) (< |old(~a24~0)| .cse1) (< (+ ~inputC~0 |old(~a12~0)| 46) 0) (< 5 (+ ~inputB~0 ~inputC~0)) (< 12 (* 2 ~inputF~0)) (< (+ ~inputB~0 |old(~a24~0)|) 3) (< ~inputA~0 .cse1))) [2018-11-10 08:38:30,144 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 874 890) no Hoare annotation was computed. [2018-11-10 08:38:30,144 INFO L421 ceAbstractionStarter]: At program point L888(line 888) the Hoare annotation is: (let ((.cse0 (not (= ~a15~0 8))) (.cse2 (+ |old(~a12~0)| 54)) (.cse3 (+ |old(~a12~0)| 50))) (or (and (not (= ~a15~0 9)) (not (= ~a21~0 8)) .cse0) (and (<= 7 ~a15~0) (not (= ~a21~0 7))) (and (< 11 ~a12~0) .cse0) (and (let ((.cse1 (<= (+ ~a24~0 7) ~a15~0))) (or (and (= (+ ~a12~0 49) 0) .cse1) (and (<= 0 (+ ~a12~0 ~a21~0 39)) (<= (+ ~a12~0 ~a21~0) 10) .cse1))) (<= 9 (+ ~a15~0 ~a24~0)) (<= 8 (+ main_~input~0 ~a21~0)) (<= ~a15~0 (+ ~a21~0 1)) (<= (+ main_~input~0 1) ~a21~0)) (< .cse2 ~inputE~0) (< 12 (+ |old(~a15~0)| ~inputD~0)) (< ~inputD~0 (+ |old(~a24~0)| 3)) (< .cse3 ~inputA~0) (< |old(~a15~0)| (+ |old(~a21~0)| 1)) (< ~inputE~0 .cse2) (< (+ |old(~a21~0)| ~inputF~0) 13) (< |old(~a24~0)| .cse3) (< (+ ~inputC~0 |old(~a12~0)| 46) 0) (< 5 (+ ~inputB~0 ~inputC~0)) (< 12 (* 2 ~inputF~0)) (< (+ ~inputB~0 |old(~a24~0)|) 3) (< ~inputA~0 .cse3))) [2018-11-10 08:38:30,144 INFO L425 ceAbstractionStarter]: For program point L888-1(line 888) no Hoare annotation was computed. [2018-11-10 08:38:30,144 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-11-10 08:38:30,144 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-11-10 08:38:30,145 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse0 (not (= ~a15~0 8))) (.cse2 (+ |old(~a12~0)| 54)) (.cse3 (+ |old(~a12~0)| 50))) (or (and (not (= ~a15~0 9)) (not (= ~a21~0 8)) .cse0) (and (<= 7 ~a15~0) (not (= ~a21~0 7))) (and (< 11 ~a12~0) .cse0) (and (let ((.cse1 (= ~a24~0 1))) (or (and (<= 0 (+ ~a12~0 ~a21~0 39)) .cse1 (<= (+ ~a12~0 ~a24~0) 4)) (and .cse1 (<= (+ (* 2 ~a12~0) 98) 0) (<= 0 (+ ~a15~0 ~a12~0 41))))) (= ~a15~0 |old(~a15~0)|)) (< .cse2 ~inputE~0) (< 12 (+ |old(~a15~0)| ~inputD~0)) (< ~inputD~0 (+ |old(~a24~0)| 3)) (< .cse3 ~inputA~0) (< |old(~a15~0)| (+ |old(~a21~0)| 1)) (< ~inputE~0 .cse2) (< (+ |old(~a21~0)| ~inputF~0) 13) (< |old(~a24~0)| .cse3) (< (+ ~inputC~0 |old(~a12~0)| 46) 0) (< 5 (+ ~inputB~0 ~inputC~0)) (< 12 (* 2 ~inputF~0)) (< (+ ~inputB~0 |old(~a24~0)|) 3) (< ~inputA~0 .cse3))) [2018-11-10 08:38:30,145 INFO L425 ceAbstractionStarter]: For program point L880-4(lines 874 890) no Hoare annotation was computed. [2018-11-10 08:38:30,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:38:30 BoogieIcfgContainer [2018-11-10 08:38:30,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 08:38:30,155 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:38:30,155 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:38:30,155 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:38:30,156 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:28:03" (3/4) ... [2018-11-10 08:38:30,159 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 08:38:30,164 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 08:38:30,164 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-10 08:38:30,164 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 08:38:30,176 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 08:38:30,177 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 08:38:30,202 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(a15 == 9) && !(a21 == 8)) && !(a15 == 8)) || (7 <= a15 && !(a21 == 7))) || (11 < a12 && !(a15 == 8))) || ((((0 <= a12 + a21 + 39 && a24 == 1) && a12 + a24 <= 4) || ((a24 == 1 && 2 * a12 + 98 <= 0) && 0 <= a15 + a12 + 41)) && a15 == \old(a15))) || \old(a12) + 54 < inputE) || 12 < \old(a15) + inputD) || inputD < \old(a24) + 3) || \old(a12) + 50 < inputA) || \old(a15) < \old(a21) + 1) || inputE < \old(a12) + 54) || \old(a21) + inputF < 13) || \old(a24) < \old(a12) + 50) || inputC + \old(a12) + 46 < 0) || 5 < inputB + inputC) || 12 < 2 * inputF) || inputB + \old(a24) < 3) || inputA < \old(a12) + 50 [2018-11-10 08:38:30,280 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9085e7b8-5f2c-4ffa-bb6b-31f7ad3fe1fb/bin-2019/utaipan/witness.graphml [2018-11-10 08:38:30,280 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:38:30,281 INFO L168 Benchmark]: Toolchain (without parser) took 628629.41 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.1 GB). Free memory was 951.1 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-11-10 08:38:30,281 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:38:30,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.50 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 913.5 MB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-11-10 08:38:30,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 166.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 913.5 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-10 08:38:30,282 INFO L168 Benchmark]: Boogie Preprocessor took 65.58 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-11-10 08:38:30,282 INFO L168 Benchmark]: RCFGBuilder took 1243.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 978.0 MB in the end (delta: 122.7 MB). Peak memory consumption was 122.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:38:30,282 INFO L168 Benchmark]: TraceAbstraction took 626514.47 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 978.0 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2018-11-10 08:38:30,283 INFO L168 Benchmark]: Witness Printer took 125.31 ms. Allocated memory is still 5.1 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 4.2 kB). Peak memory consumption was 4.2 kB. Max. memory is 11.5 GB. [2018-11-10 08:38:30,284 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 510.50 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 913.5 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 166.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 913.5 MB in the beginning and 1.1 GB in the end (delta: -194.5 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.58 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1243.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 978.0 MB in the end (delta: 122.7 MB). Peak memory consumption was 122.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 626514.47 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 978.0 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. * Witness Printer took 125.31 ms. Allocated memory is still 5.1 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 4.2 kB). Peak memory consumption was 4.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 106]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: (((((((((((((((((!(a15 == 9) && !(a21 == 8)) && !(a15 == 8)) || (7 <= a15 && !(a21 == 7))) || (11 < a12 && !(a15 == 8))) || ((((0 <= a12 + a21 + 39 && a24 == 1) && a12 + a24 <= 4) || ((a24 == 1 && 2 * a12 + 98 <= 0) && 0 <= a15 + a12 + 41)) && a15 == \old(a15))) || \old(a12) + 54 < inputE) || 12 < \old(a15) + inputD) || inputD < \old(a24) + 3) || \old(a12) + 50 < inputA) || \old(a15) < \old(a21) + 1) || inputE < \old(a12) + 54) || \old(a21) + inputF < 13) || \old(a24) < \old(a12) + 50) || inputC + \old(a12) + 46 < 0) || 5 < inputB + inputC) || 12 < 2 * inputF) || inputB + \old(a24) < 3) || inputA < \old(a12) + 50 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 255 locations, 1 error locations. SAFE Result, 626.4s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 341.5s AutomataDifference, 0.0s DeadEndRemovalTime, 145.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 12308 SDslu, 2023 SDs, 0 SdLazy, 22318 SolverSat, 3356 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 141.4s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 4798 GetRequests, 4421 SyntacticMatches, 202 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 69.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7870occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 62.0s AbstIntTime, 8 AbstIntIterations, 4 AbstIntStrong, 0.9953268198794178 AbsIntWeakeningRatio, 0.10729991204925242 AbsIntAvgWeakeningVarsNumRemoved, 498.3966578715919 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1165 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 137 PreInvPairs, 221 NumberOfFragments, 696 HoareAnnotationTreeSize, 137 FomulaSimplifications, 162626 FormulaSimplificationTreeSizeReduction, 40.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 170806 FormulaSimplificationTreeSizeReductionInter, 104.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 4982 NumberOfCodeBlocks, 4982 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 6713 ConstructedInterpolants, 0 QuantifiedInterpolants, 9086733 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2779 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 7622/9467 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...