./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e09138f51265758a55ca4b42a17e715ba685a263 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:12:30,321 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:12:30,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:12:30,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:12:30,330 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:12:30,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:12:30,331 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:12:30,332 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:12:30,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:12:30,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:12:30,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:12:30,335 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:12:30,335 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:12:30,336 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:12:30,337 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:12:30,338 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:12:30,338 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:12:30,339 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:12:30,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:12:30,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:12:30,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:12:30,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:12:30,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:12:30,345 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:12:30,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:12:30,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:12:30,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:12:30,347 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:12:30,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:12:30,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:12:30,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:12:30,349 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:12:30,349 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:12:30,349 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:12:30,350 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:12:30,350 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:12:30,350 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 15:12:30,360 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:12:30,360 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:12:30,361 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:12:30,361 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:12:30,361 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:12:30,361 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:12:30,361 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:12:30,361 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 15:12:30,362 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:12:30,362 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:12:30,362 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 15:12:30,362 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 15:12:30,362 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:12:30,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:12:30,363 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:12:30,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:12:30,363 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:12:30,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:12:30,363 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:12:30,364 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:12:30,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:12:30,364 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:12:30,364 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:12:30,364 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:12:30,364 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:12:30,365 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:12:30,365 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:12:30,365 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:12:30,365 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:12:30,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:12:30,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:12:30,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:12:30,365 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:12:30,366 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 15:12:30,366 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:12:30,366 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:12:30,366 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 15:12:30,366 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_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e09138f51265758a55ca4b42a17e715ba685a263 [2018-11-23 15:12:30,389 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:12:30,398 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:12:30,401 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:12:30,402 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:12:30,402 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:12:30,403 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-11-23 15:12:30,440 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/data/7c3da2047/5e86590f2e714acfa1aa1630004b66be/FLAG9751b8429 [2018-11-23 15:12:30,906 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:12:30,906 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/sv-benchmarks/c/eca-rers2012/Problem01_label11_true-unreach-call_false-termination.c [2018-11-23 15:12:30,915 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/data/7c3da2047/5e86590f2e714acfa1aa1630004b66be/FLAG9751b8429 [2018-11-23 15:12:31,426 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/data/7c3da2047/5e86590f2e714acfa1aa1630004b66be [2018-11-23 15:12:31,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:12:31,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:12:31,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:12:31,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:12:31,434 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:12:31,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:12:31" (1/1) ... [2018-11-23 15:12:31,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c8d80d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31, skipping insertion in model container [2018-11-23 15:12:31,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:12:31" (1/1) ... [2018-11-23 15:12:31,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:12:31,482 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:12:31,714 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:12:31,717 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:12:31,784 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:12:31,797 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:12:31,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31 WrapperNode [2018-11-23 15:12:31,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:12:31,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:12:31,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:12:31,799 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:12:31,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31" (1/1) ... [2018-11-23 15:12:31,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31" (1/1) ... [2018-11-23 15:12:31,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:12:31,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:12:31,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:12:31,876 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:12:31,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31" (1/1) ... [2018-11-23 15:12:31,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31" (1/1) ... [2018-11-23 15:12:31,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31" (1/1) ... [2018-11-23 15:12:31,888 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31" (1/1) ... [2018-11-23 15:12:31,912 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31" (1/1) ... [2018-11-23 15:12:31,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31" (1/1) ... [2018-11-23 15:12:31,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31" (1/1) ... [2018-11-23 15:12:31,930 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:12:31,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:12:31,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:12:31,931 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:12:31,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:12:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 15:12:31,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:12:31,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:12:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-23 15:12:31,985 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-23 15:12:31,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:12:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:12:31,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:12:31,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:12:32,927 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:12:32,928 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 15:12:32,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:12:32 BoogieIcfgContainer [2018-11-23 15:12:32,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:12:32,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:12:32,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:12:32,931 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:12:32,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:12:31" (1/3) ... [2018-11-23 15:12:32,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6957169f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:12:32, skipping insertion in model container [2018-11-23 15:12:32,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:12:31" (2/3) ... [2018-11-23 15:12:32,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6957169f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:12:32, skipping insertion in model container [2018-11-23 15:12:32,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:12:32" (3/3) ... [2018-11-23 15:12:32,934 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label11_true-unreach-call_false-termination.c [2018-11-23 15:12:32,942 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:12:32,949 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:12:32,962 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:12:32,988 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:12:32,988 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:12:32,988 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:12:32,988 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:12:32,989 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:12:32,989 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:12:32,989 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:12:32,989 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:12:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states. [2018-11-23 15:12:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-23 15:12:33,015 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:33,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:33,018 INFO L423 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:33,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:33,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1377016033, now seen corresponding path program 1 times [2018-11-23 15:12:33,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:33,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:33,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:33,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:33,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:12:33,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:12:33,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:12:33,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:12:33,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:12:33,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:12:33,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:12:33,365 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 3 states. [2018-11-23 15:12:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:33,990 INFO L93 Difference]: Finished difference Result 547 states and 938 transitions. [2018-11-23 15:12:33,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:12:33,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-11-23 15:12:33,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:34,005 INFO L225 Difference]: With dead ends: 547 [2018-11-23 15:12:34,005 INFO L226 Difference]: Without dead ends: 338 [2018-11-23 15:12:34,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:12:34,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-23 15:12:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-11-23 15:12:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-23 15:12:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 560 transitions. [2018-11-23 15:12:34,061 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 560 transitions. Word has length 115 [2018-11-23 15:12:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:34,061 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 560 transitions. [2018-11-23 15:12:34,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:12:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 560 transitions. [2018-11-23 15:12:34,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-23 15:12:34,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:34,065 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:34,065 INFO L423 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:34,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:34,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1300380632, now seen corresponding path program 1 times [2018-11-23 15:12:34,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:34,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:34,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:34,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:34,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:12:34,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:12:34,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:12:34,173 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:12:34,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:12:34,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:12:34,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:12:34,175 INFO L87 Difference]: Start difference. First operand 338 states and 560 transitions. Second operand 6 states. [2018-11-23 15:12:34,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:34,799 INFO L93 Difference]: Finished difference Result 881 states and 1484 transitions. [2018-11-23 15:12:34,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:12:34,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-11-23 15:12:34,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:34,802 INFO L225 Difference]: With dead ends: 881 [2018-11-23 15:12:34,802 INFO L226 Difference]: Without dead ends: 549 [2018-11-23 15:12:34,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:12:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-11-23 15:12:34,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 536. [2018-11-23 15:12:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536 states. [2018-11-23 15:12:34,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 824 transitions. [2018-11-23 15:12:34,830 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 824 transitions. Word has length 125 [2018-11-23 15:12:34,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:34,830 INFO L480 AbstractCegarLoop]: Abstraction has 536 states and 824 transitions. [2018-11-23 15:12:34,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:12:34,831 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 824 transitions. [2018-11-23 15:12:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 15:12:34,834 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:34,834 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:34,834 INFO L423 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:34,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:34,835 INFO L82 PathProgramCache]: Analyzing trace with hash 860697510, now seen corresponding path program 1 times [2018-11-23 15:12:34,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:34,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:34,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:34,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:34,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:12:35,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:12:35,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:12:35,024 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:12:35,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:12:35,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:12:35,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:12:35,025 INFO L87 Difference]: Start difference. First operand 536 states and 824 transitions. Second operand 5 states. [2018-11-23 15:12:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:35,463 INFO L93 Difference]: Finished difference Result 1203 states and 1889 transitions. [2018-11-23 15:12:35,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:12:35,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 126 [2018-11-23 15:12:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:35,468 INFO L225 Difference]: With dead ends: 1203 [2018-11-23 15:12:35,468 INFO L226 Difference]: Without dead ends: 533 [2018-11-23 15:12:35,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:12:35,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-11-23 15:12:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2018-11-23 15:12:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-11-23 15:12:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 784 transitions. [2018-11-23 15:12:35,489 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 784 transitions. Word has length 126 [2018-11-23 15:12:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:35,489 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 784 transitions. [2018-11-23 15:12:35,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:12:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 784 transitions. [2018-11-23 15:12:35,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 15:12:35,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:35,492 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:35,492 INFO L423 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:35,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:35,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1706034196, now seen corresponding path program 1 times [2018-11-23 15:12:35,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:35,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:35,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:35,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:35,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:12:35,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:12:35,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 15:12:35,728 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:12:35,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 15:12:35,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:12:35,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:12:35,729 INFO L87 Difference]: Start difference. First operand 533 states and 784 transitions. Second operand 5 states. [2018-11-23 15:12:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:36,243 INFO L93 Difference]: Finished difference Result 1197 states and 1792 transitions. [2018-11-23 15:12:36,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:12:36,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-11-23 15:12:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:36,246 INFO L225 Difference]: With dead ends: 1197 [2018-11-23 15:12:36,247 INFO L226 Difference]: Without dead ends: 532 [2018-11-23 15:12:36,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:12:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2018-11-23 15:12:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2018-11-23 15:12:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-11-23 15:12:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 779 transitions. [2018-11-23 15:12:36,265 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 779 transitions. Word has length 127 [2018-11-23 15:12:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:36,265 INFO L480 AbstractCegarLoop]: Abstraction has 532 states and 779 transitions. [2018-11-23 15:12:36,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 15:12:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 779 transitions. [2018-11-23 15:12:36,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 15:12:36,268 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:36,268 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:36,268 INFO L423 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:36,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:36,268 INFO L82 PathProgramCache]: Analyzing trace with hash 508544498, now seen corresponding path program 1 times [2018-11-23 15:12:36,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:36,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:36,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:36,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:12:36,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:12:36,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:12:36,357 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:12:36,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:12:36,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:12:36,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:12:36,358 INFO L87 Difference]: Start difference. First operand 532 states and 779 transitions. Second operand 3 states. [2018-11-23 15:12:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:36,787 INFO L93 Difference]: Finished difference Result 1512 states and 2291 transitions. [2018-11-23 15:12:36,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:12:36,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-11-23 15:12:36,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:36,792 INFO L225 Difference]: With dead ends: 1512 [2018-11-23 15:12:36,792 INFO L226 Difference]: Without dead ends: 986 [2018-11-23 15:12:36,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:12:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-11-23 15:12:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2018-11-23 15:12:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-11-23 15:12:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1405 transitions. [2018-11-23 15:12:36,819 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1405 transitions. Word has length 132 [2018-11-23 15:12:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:36,820 INFO L480 AbstractCegarLoop]: Abstraction has 986 states and 1405 transitions. [2018-11-23 15:12:36,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:12:36,820 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1405 transitions. [2018-11-23 15:12:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-23 15:12:36,823 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:36,823 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:36,825 INFO L423 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:36,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:36,825 INFO L82 PathProgramCache]: Analyzing trace with hash -486972616, now seen corresponding path program 1 times [2018-11-23 15:12:36,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:36,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:36,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:36,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:36,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:12:36,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:12:36,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:12:36,915 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:12:36,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:12:36,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:12:36,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:12:36,916 INFO L87 Difference]: Start difference. First operand 986 states and 1405 transitions. Second operand 6 states. [2018-11-23 15:12:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:37,588 INFO L93 Difference]: Finished difference Result 2924 states and 4351 transitions. [2018-11-23 15:12:37,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:12:37,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-11-23 15:12:37,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:37,600 INFO L225 Difference]: With dead ends: 2924 [2018-11-23 15:12:37,601 INFO L226 Difference]: Without dead ends: 1944 [2018-11-23 15:12:37,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:12:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2018-11-23 15:12:37,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1917. [2018-11-23 15:12:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1917 states. [2018-11-23 15:12:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2543 transitions. [2018-11-23 15:12:37,653 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2543 transitions. Word has length 133 [2018-11-23 15:12:37,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:37,653 INFO L480 AbstractCegarLoop]: Abstraction has 1917 states and 2543 transitions. [2018-11-23 15:12:37,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:12:37,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2543 transitions. [2018-11-23 15:12:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-23 15:12:37,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:37,658 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:37,659 INFO L423 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:37,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:37,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1684411513, now seen corresponding path program 1 times [2018-11-23 15:12:37,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:37,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:37,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:37,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:37,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:12:37,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:12:37,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:12:37,737 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 149 with the following transitions: [2018-11-23 15:12:37,739 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 15:12:37,773 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:12:37,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:12:38,112 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 15:12:38,113 INFO L272 AbstractInterpreter]: Visited 116 different actions 116 times. Never merged. Never widened. Performed 1543 root evaluator evaluations with a maximum evaluation depth of 3. Performed 1543 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 42 variables. [2018-11-23 15:12:38,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:38,132 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 15:12:38,354 INFO L227 lantSequenceWeakener]: Weakened 139 states. On average, predicates are now at 80.41% of their original sizes. [2018-11-23 15:12:38,354 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 15:12:38,391 INFO L415 sIntCurrentIteration]: We unified 147 AI predicates to 147 [2018-11-23 15:12:38,391 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 15:12:38,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:12:38,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-23 15:12:38,392 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:12:38,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:12:38,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:12:38,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:12:38,393 INFO L87 Difference]: Start difference. First operand 1917 states and 2543 transitions. Second operand 6 states. [2018-11-23 15:12:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:40,894 INFO L93 Difference]: Finished difference Result 3964 states and 5256 transitions. [2018-11-23 15:12:40,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:12:40,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2018-11-23 15:12:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:40,902 INFO L225 Difference]: With dead ends: 3964 [2018-11-23 15:12:40,902 INFO L226 Difference]: Without dead ends: 2053 [2018-11-23 15:12:40,907 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:12:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2018-11-23 15:12:40,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 2052. [2018-11-23 15:12:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2018-11-23 15:12:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2684 transitions. [2018-11-23 15:12:40,952 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2684 transitions. Word has length 148 [2018-11-23 15:12:40,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:40,953 INFO L480 AbstractCegarLoop]: Abstraction has 2052 states and 2684 transitions. [2018-11-23 15:12:40,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:12:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2684 transitions. [2018-11-23 15:12:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-23 15:12:40,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:40,958 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:40,958 INFO L423 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:40,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:40,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1310973214, now seen corresponding path program 1 times [2018-11-23 15:12:40,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:40,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:40,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:40,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:40,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 15:12:41,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:12:41,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:12:41,049 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2018-11-23 15:12:41,049 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 15:12:41,053 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:12:41,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:12:41,410 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 15:12:41,410 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 4 different actions 4 times. Never widened. Performed 3083 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3083 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-23 15:12:41,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:41,424 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 15:12:41,648 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 81.82% of their original sizes. [2018-11-23 15:12:41,648 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 15:12:41,747 INFO L415 sIntCurrentIteration]: We unified 155 AI predicates to 155 [2018-11-23 15:12:41,747 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 15:12:41,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:12:41,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-23 15:12:41,747 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:12:41,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 15:12:41,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 15:12:41,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:12:41,748 INFO L87 Difference]: Start difference. First operand 2052 states and 2684 transitions. Second operand 10 states. [2018-11-23 15:12:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:45,408 INFO L93 Difference]: Finished difference Result 4102 states and 5400 transitions. [2018-11-23 15:12:45,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 15:12:45,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2018-11-23 15:12:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:45,417 INFO L225 Difference]: With dead ends: 4102 [2018-11-23 15:12:45,417 INFO L226 Difference]: Without dead ends: 2191 [2018-11-23 15:12:45,421 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 163 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-23 15:12:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2018-11-23 15:12:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2189. [2018-11-23 15:12:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2189 states. [2018-11-23 15:12:45,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2189 states to 2189 states and 2831 transitions. [2018-11-23 15:12:45,475 INFO L78 Accepts]: Start accepts. Automaton has 2189 states and 2831 transitions. Word has length 156 [2018-11-23 15:12:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:45,475 INFO L480 AbstractCegarLoop]: Abstraction has 2189 states and 2831 transitions. [2018-11-23 15:12:45,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 15:12:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2189 states and 2831 transitions. [2018-11-23 15:12:45,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-23 15:12:45,483 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:45,483 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:45,483 INFO L423 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:45,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:45,484 INFO L82 PathProgramCache]: Analyzing trace with hash -421933084, now seen corresponding path program 1 times [2018-11-23 15:12:45,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:45,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:45,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:45,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:45,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 82 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 15:12:45,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:12:45,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:12:45,625 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 190 with the following transitions: [2018-11-23 15:12:45,625 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 15:12:45,628 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:12:45,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:12:45,841 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 15:12:45,841 INFO L272 AbstractInterpreter]: Visited 120 different actions 234 times. Merged at 4 different actions 4 times. Never widened. Performed 3143 root evaluator evaluations with a maximum evaluation depth of 3. Performed 3143 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2018-11-23 15:12:45,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:45,843 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 15:12:46,053 INFO L227 lantSequenceWeakener]: Weakened 186 states. On average, predicates are now at 81.78% of their original sizes. [2018-11-23 15:12:46,054 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 15:12:46,133 INFO L415 sIntCurrentIteration]: We unified 188 AI predicates to 188 [2018-11-23 15:12:46,134 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 15:12:46,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:12:46,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-23 15:12:46,134 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:12:46,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 15:12:46,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 15:12:46,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:12:46,135 INFO L87 Difference]: Start difference. First operand 2189 states and 2831 transitions. Second operand 10 states. [2018-11-23 15:12:48,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:48,522 INFO L93 Difference]: Finished difference Result 4513 states and 5881 transitions. [2018-11-23 15:12:48,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 15:12:48,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2018-11-23 15:12:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:48,531 INFO L225 Difference]: With dead ends: 4513 [2018-11-23 15:12:48,531 INFO L226 Difference]: Without dead ends: 2602 [2018-11-23 15:12:48,536 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 197 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-11-23 15:12:48,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2018-11-23 15:12:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2600. [2018-11-23 15:12:48,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2600 states. [2018-11-23 15:12:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 3264 transitions. [2018-11-23 15:12:48,573 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 3264 transitions. Word has length 189 [2018-11-23 15:12:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:48,573 INFO L480 AbstractCegarLoop]: Abstraction has 2600 states and 3264 transitions. [2018-11-23 15:12:48,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 15:12:48,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 3264 transitions. [2018-11-23 15:12:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-23 15:12:48,578 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:48,578 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:48,578 INFO L423 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:48,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:48,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1573168407, now seen corresponding path program 1 times [2018-11-23 15:12:48,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:48,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:48,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:48,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:48,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:48,670 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 79 proven. 38 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 15:12:48,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:12:48,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:12:48,670 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 198 with the following transitions: [2018-11-23 15:12:48,671 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 15:12:48,673 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:12:48,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:12:48,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 15:12:48,928 INFO L272 AbstractInterpreter]: Visited 122 different actions 483 times. Merged at 8 different actions 28 times. Never widened. Performed 6832 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6832 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-23 15:12:48,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:48,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 15:12:48,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:12:48,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:12:48,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:48,945 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:12:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:49,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:12:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-23 15:12:49,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:12:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 84 proven. 31 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 15:12:49,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:12:49,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2018-11-23 15:12:49,382 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:12:49,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 15:12:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 15:12:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:12:49,383 INFO L87 Difference]: Start difference. First operand 2600 states and 3264 transitions. Second operand 11 states. [2018-11-23 15:12:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:50,715 INFO L93 Difference]: Finished difference Result 8890 states and 12070 transitions. [2018-11-23 15:12:50,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 15:12:50,715 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 197 [2018-11-23 15:12:50,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:50,736 INFO L225 Difference]: With dead ends: 8890 [2018-11-23 15:12:50,736 INFO L226 Difference]: Without dead ends: 6842 [2018-11-23 15:12:50,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 397 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2018-11-23 15:12:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6842 states. [2018-11-23 15:12:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6842 to 6769. [2018-11-23 15:12:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6769 states. [2018-11-23 15:12:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6769 states to 6769 states and 8545 transitions. [2018-11-23 15:12:50,891 INFO L78 Accepts]: Start accepts. Automaton has 6769 states and 8545 transitions. Word has length 197 [2018-11-23 15:12:50,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:50,891 INFO L480 AbstractCegarLoop]: Abstraction has 6769 states and 8545 transitions. [2018-11-23 15:12:50,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 15:12:50,891 INFO L276 IsEmpty]: Start isEmpty. Operand 6769 states and 8545 transitions. [2018-11-23 15:12:50,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-23 15:12:50,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:50,903 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:50,903 INFO L423 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:50,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash 924757225, now seen corresponding path program 1 times [2018-11-23 15:12:50,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:50,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:50,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:50,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:50,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 124 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 15:12:51,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:12:51,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:12:51,049 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2018-11-23 15:12:51,049 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 15:12:51,052 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:12:51,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:12:51,291 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 15:12:51,291 INFO L272 AbstractInterpreter]: Visited 121 different actions 355 times. Merged at 6 different actions 12 times. Never widened. Performed 4710 root evaluator evaluations with a maximum evaluation depth of 3. Performed 4710 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-23 15:12:51,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:51,296 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 15:12:51,455 INFO L227 lantSequenceWeakener]: Weakened 203 states. On average, predicates are now at 83.4% of their original sizes. [2018-11-23 15:12:51,455 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 15:12:51,490 INFO L415 sIntCurrentIteration]: We unified 205 AI predicates to 205 [2018-11-23 15:12:51,490 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 15:12:51,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:12:51,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2018-11-23 15:12:51,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:12:51,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 15:12:51,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 15:12:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:12:51,491 INFO L87 Difference]: Start difference. First operand 6769 states and 8545 transitions. Second operand 10 states. [2018-11-23 15:12:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:53,469 INFO L93 Difference]: Finished difference Result 13536 states and 17208 transitions. [2018-11-23 15:12:53,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 15:12:53,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 206 [2018-11-23 15:12:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:53,485 INFO L225 Difference]: With dead ends: 13536 [2018-11-23 15:12:53,485 INFO L226 Difference]: Without dead ends: 7456 [2018-11-23 15:12:53,496 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 213 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-11-23 15:12:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2018-11-23 15:12:53,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 7452. [2018-11-23 15:12:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7452 states. [2018-11-23 15:12:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7452 states to 7452 states and 9311 transitions. [2018-11-23 15:12:53,618 INFO L78 Accepts]: Start accepts. Automaton has 7452 states and 9311 transitions. Word has length 206 [2018-11-23 15:12:53,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:53,618 INFO L480 AbstractCegarLoop]: Abstraction has 7452 states and 9311 transitions. [2018-11-23 15:12:53,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 15:12:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7452 states and 9311 transitions. [2018-11-23 15:12:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-11-23 15:12:53,629 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:53,629 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:53,629 INFO L423 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:53,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:53,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1274612791, now seen corresponding path program 1 times [2018-11-23 15:12:53,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:53,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:53,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:53,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:53,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 150 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-23 15:12:53,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:12:53,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:12:53,861 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 223 with the following transitions: [2018-11-23 15:12:53,862 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 15:12:53,864 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:12:53,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:12:54,126 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 15:12:54,126 INFO L272 AbstractInterpreter]: Visited 122 different actions 483 times. Merged at 8 different actions 28 times. Never widened. Performed 6971 root evaluator evaluations with a maximum evaluation depth of 3. Performed 6971 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-23 15:12:54,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:54,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 15:12:54,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:12:54,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:12:54,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:54,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:12:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:54,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:12:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 134 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-23 15:12:54,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:12:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 146 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-23 15:12:54,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:12:54,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-11-23 15:12:54,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:12:54,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:12:54,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:12:54,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:12:54,356 INFO L87 Difference]: Start difference. First operand 7452 states and 9311 transitions. Second operand 8 states. [2018-11-23 15:12:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:55,456 INFO L93 Difference]: Finished difference Result 14606 states and 18823 transitions. [2018-11-23 15:12:55,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 15:12:55,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 222 [2018-11-23 15:12:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:55,476 INFO L225 Difference]: With dead ends: 14606 [2018-11-23 15:12:55,476 INFO L226 Difference]: Without dead ends: 8526 [2018-11-23 15:12:55,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 453 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-23 15:12:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8526 states. [2018-11-23 15:12:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8526 to 7816. [2018-11-23 15:12:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7816 states. [2018-11-23 15:12:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7816 states to 7816 states and 9385 transitions. [2018-11-23 15:12:55,591 INFO L78 Accepts]: Start accepts. Automaton has 7816 states and 9385 transitions. Word has length 222 [2018-11-23 15:12:55,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:55,592 INFO L480 AbstractCegarLoop]: Abstraction has 7816 states and 9385 transitions. [2018-11-23 15:12:55,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:12:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 7816 states and 9385 transitions. [2018-11-23 15:12:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-11-23 15:12:55,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:55,602 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:55,602 INFO L423 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:55,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:55,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1436750508, now seen corresponding path program 1 times [2018-11-23 15:12:55,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:55,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:55,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:55,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:55,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 178 proven. 69 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-23 15:12:55,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:12:55,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:12:55,719 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 243 with the following transitions: [2018-11-23 15:12:55,720 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [10], [14], [18], [22], [26], [30], [33], [34], [38], [42], [45], [46], [50], [53], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [105], [106], [110], [114], [118], [122], [126], [130], [134], [137], [138], [142], [146], [150], [154], [158], [162], [166], [170], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 15:12:55,721 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:12:55,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:12:56,096 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 15:12:56,097 INFO L272 AbstractInterpreter]: Visited 123 different actions 488 times. Merged at 9 different actions 29 times. Widened at 1 different actions 1 times. Performed 7012 root evaluator evaluations with a maximum evaluation depth of 3. Performed 7012 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 3 different actions. Largest state had 42 variables. [2018-11-23 15:12:56,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:56,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 15:12:56,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:12:56,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:12:56,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:56,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:12:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:56,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:12:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 188 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-23 15:12:56,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:12:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 188 proven. 2 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-23 15:12:56,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:12:56,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 15 [2018-11-23 15:12:56,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:12:56,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 15:12:56,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 15:12:56,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-23 15:12:56,374 INFO L87 Difference]: Start difference. First operand 7816 states and 9385 transitions. Second operand 12 states. [2018-11-23 15:12:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:12:58,717 INFO L93 Difference]: Finished difference Result 18451 states and 24409 transitions. [2018-11-23 15:12:58,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 15:12:58,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 242 [2018-11-23 15:12:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:12:58,749 INFO L225 Difference]: With dead ends: 18451 [2018-11-23 15:12:58,749 INFO L226 Difference]: Without dead ends: 11459 [2018-11-23 15:12:58,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 509 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=552, Invalid=2528, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 15:12:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11459 states. [2018-11-23 15:12:58,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11459 to 10309. [2018-11-23 15:12:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10309 states. [2018-11-23 15:12:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10309 states to 10309 states and 12030 transitions. [2018-11-23 15:12:58,991 INFO L78 Accepts]: Start accepts. Automaton has 10309 states and 12030 transitions. Word has length 242 [2018-11-23 15:12:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:12:58,992 INFO L480 AbstractCegarLoop]: Abstraction has 10309 states and 12030 transitions. [2018-11-23 15:12:58,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 15:12:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 10309 states and 12030 transitions. [2018-11-23 15:12:59,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-11-23 15:12:59,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:12:59,007 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:12:59,007 INFO L423 AbstractCegarLoop]: === Iteration 14 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:12:59,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:59,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2001996586, now seen corresponding path program 1 times [2018-11-23 15:12:59,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:12:59,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:59,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:59,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:12:59,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:12:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:12:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 148 proven. 103 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 15:12:59,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:12:59,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 15:12:59,486 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2018-11-23 15:12:59,486 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [5], [6], [10], [14], [18], [22], [26], [30], [34], [38], [42], [45], [46], [49], [50], [54], [58], [62], [66], [70], [74], [78], [82], [86], [90], [94], [98], [102], [106], [109], [110], [114], [118], [122], [126], [130], [134], [138], [142], [146], [150], [154], [158], [162], [166], [170], [173], [174], [178], [182], [186], [190], [194], [198], [202], [206], [210], [214], [218], [222], [226], [230], [234], [238], [242], [246], [250], [254], [258], [262], [266], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [385], [393], [401], [409], [417], [425], [433], [441], [449], [457], [465], [473], [481], [489], [497], [505], [513], [521], [529], [537], [545], [553], [561], [565], [567], [757], [761], [770], [774], [776], [781], [782], [783], [785], [786] [2018-11-23 15:12:59,488 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 15:12:59,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 15:12:59,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 15:12:59,967 INFO L272 AbstractInterpreter]: Visited 123 different actions 607 times. Merged at 8 different actions 36 times. Never widened. Performed 8468 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8468 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 10 fixpoints after 2 different actions. Largest state had 42 variables. [2018-11-23 15:12:59,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:12:59,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 15:12:59,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:12:59,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:12:59,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:12:59,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 15:13:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:13:00,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:13:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 183 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-23 15:13:00,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:13:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 183 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-11-23 15:13:00,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:13:00,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 5, 5] total 19 [2018-11-23 15:13:00,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 15:13:00,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 15:13:00,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 15:13:00,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-23 15:13:00,184 INFO L87 Difference]: Start difference. First operand 10309 states and 12030 transitions. Second operand 17 states. [2018-11-23 15:13:03,421 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-11-23 15:13:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:13:04,500 INFO L93 Difference]: Finished difference Result 17689 states and 20613 transitions. [2018-11-23 15:13:04,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-11-23 15:13:04,501 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 244 [2018-11-23 15:13:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:13:04,501 INFO L225 Difference]: With dead ends: 17689 [2018-11-23 15:13:04,501 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 15:13:04,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 527 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2036 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1183, Invalid=5137, Unknown=0, NotChecked=0, Total=6320 [2018-11-23 15:13:04,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 15:13:04,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 15:13:04,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 15:13:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 15:13:04,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 244 [2018-11-23 15:13:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:13:04,518 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:13:04,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 15:13:04,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:13:04,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 15:13:04,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 15:13:04,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:04,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,172 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,288 WARN L180 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 411 DAG size of output: 303 [2018-11-23 15:13:05,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,344 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,372 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:13:05,763 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 423 DAG size of output: 312 [2018-11-23 15:13:06,910 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 258 DAG size of output: 85 [2018-11-23 15:13:07,573 WARN L180 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 289 DAG size of output: 69 [2018-11-23 15:13:08,252 WARN L180 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 69 [2018-11-23 15:13:08,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (= ~a8~0 |old(~a8~0)|) (= |old(~a16~0)| ~a16~0) (= ~a20~0 |old(~a20~0)|) (= ~a21~0 |old(~a21~0)|)) [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-11-23 15:13:08,254 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-11-23 15:13:08,255 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 503) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,256 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-11-23 15:13:08,257 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-11-23 15:13:08,258 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-11-23 15:13:08,258 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-11-23 15:13:08,258 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-11-23 15:13:08,258 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-11-23 15:13:08,258 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-11-23 15:13:08,258 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-11-23 15:13:08,258 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-11-23 15:13:08,258 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-11-23 15:13:08,258 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-11-23 15:13:08,258 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-11-23 15:13:08,258 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-11-23 15:13:08,258 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-11-23 15:13:08,259 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-11-23 15:13:08,260 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-11-23 15:13:08,261 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-11-23 15:13:08,262 INFO L444 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 30 575) the Hoare annotation is: (let ((.cse5 (= 1 |old(~a17~0)|)) (.cse2 (= 4 |old(~a16~0)|)) (.cse21 (= 1 |old(~a20~0)|)) (.cse10 (= ~a17~0 |old(~a17~0)|)) (.cse11 (= |old(~a7~0)| ~a7~0)) (.cse12 (= ~a16~0 |old(~a16~0)|)) (.cse23 (= ~a8~0 |old(~a8~0)|)) (.cse16 (= 1 ~a21~0)) (.cse13 (= ~a20~0 |old(~a20~0)|))) (let ((.cse3 (< |old(~a8~0)| 14)) (.cse19 (not (= 15 |old(~a8~0)|))) (.cse20 (and .cse10 .cse11 .cse12 .cse23 .cse16 .cse13)) (.cse0 (= 6 |old(~a16~0)|)) (.cse18 (< 0 |old(~a20~0)|)) (.cse14 (not (= 1 |old(~a21~0)|))) (.cse8 (not .cse21)) (.cse7 (not .cse2)) (.cse15 (= 13 ~a8~0)) (.cse6 (= 1 |old(~a7~0)|)) (.cse17 (not (= 13 |old(~a8~0)|))) (.cse22 (not .cse5)) (.cse1 (and (= ~a21~0 |old(~a21~0)|) .cse10 .cse11 .cse12 .cse23 .cse13)) (.cse4 (not (= 8 ~a12~0))) (.cse9 (< 0 |old(~a21~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse1 .cse7 .cse4 .cse5) (or (or .cse0 .cse8 .cse9) .cse1 .cse4) (or .cse6 .cse8 .cse7 .cse4 (and .cse10 (<= ~a21~0 |old(~a21~0)|) .cse11 .cse12 (<= |old(~a8~0)| ~a8~0) .cse13)) (or .cse14 .cse6 .cse8 .cse7 .cse4 (and .cse15 .cse16) .cse17) (or .cse0 .cse3 .cse1 .cse4 .cse5 .cse18) (or .cse14 .cse6 .cse19 .cse7 .cse4 .cse20 .cse21) (or .cse0 .cse14 .cse6 .cse2 .cse19 .cse4 .cse20) (or .cse14 .cse19 .cse20 (or .cse6 .cse4 .cse18)) (or .cse6 .cse2 .cse8 .cse1 .cse4 .cse22) (or (not .cse0) .cse14 .cse6 .cse19 .cse20 (not (= |old(~a20~0)| 1)) .cse4) (or .cse0 .cse1 .cse4 .cse9 .cse18) (or .cse14 .cse8 .cse7 (and (= 1 ~a7~0) (= 1 ~a20~0) .cse15 (= |old(~a16~0)| ~a16~0) .cse16 (= 1 ~a17~0)) .cse4 (not .cse6) .cse17 .cse22) (or .cse2 .cse1 .cse4 (< |old(~a20~0)| 1) .cse5 .cse9)))) [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-11-23 15:13:08,263 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-11-23 15:13:08,264 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-11-23 15:13:08,265 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-11-23 15:13:08,266 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-11-23 15:13:08,266 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-11-23 15:13:08,266 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 15:13:08,266 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~a7~0 0) (= 1 ~a21~0) (= ~a12~0 8) (= ~a20~0 1) (= 15 ~a8~0) (= 1 ~a17~0) (= ~a16~0 5)) [2018-11-23 15:13:08,266 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 15:13:08,266 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 15:13:08,266 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 577 594) the Hoare annotation is: (or (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a21~0)|)) (not (= 8 ~a12~0)) (not (= 1 |old(~a17~0)|)) (and (= 1 ~a21~0) (= ~a17~0 |old(~a17~0)|) (= |old(~a7~0)| ~a7~0) (= ~a8~0 |old(~a8~0)|) (= ~a20~0 1) (= ~a16~0 5)) (not (= 1 |old(~a20~0)|)) (not (= 15 |old(~a8~0)|)) (not (= 5 |old(~a16~0)|))) [2018-11-23 15:13:08,266 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 577 594) no Hoare annotation was computed. [2018-11-23 15:13:08,266 INFO L444 ceAbstractionStarter]: At program point L591(line 591) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse3 (<= 14 ~a8~0)) (.cse4 (not (= ~a16~0 6))) (.cse8 (= 1 ~a20~0)) (.cse11 (= 1 ~a17~0)) (.cse5 (<= ~a20~0 0)) (.cse7 (<= ~a21~0 0)) (.cse2 (not (= ~a17~0 1))) (.cse6 (not .cse1)) (.cse0 (not (= ~a7~0 1))) (.cse12 (= |old(~a20~0)| ~a20~0)) (.cse9 (= 1 ~a21~0)) (.cse10 (= 15 ~a8~0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1 .cse2) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and .cse3 .cse4 .cse2 .cse5) (and (and .cse4 .cse2 .cse6) .cse3) (and .cse7 .cse4 .cse5) (and .cse7 .cse8 .cse4) (and .cse0 .cse4 .cse9 .cse10) (and .cse8 (= 13 ~a8~0) (= 4 ~a16~0) .cse9 .cse11) (and .cse0 .cse12 .cse11) (and .cse9 (and .cse0 .cse5) .cse10) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse7 .cse2 .cse6 (<= 1 ~a20~0)) (and .cse0 .cse12 .cse9 .cse10)))) [2018-11-23 15:13:08,266 INFO L448 ceAbstractionStarter]: For program point L591-1(line 591) no Hoare annotation was computed. [2018-11-23 15:13:08,266 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-11-23 15:13:08,266 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a16~0 4))) (let ((.cse3 (<= 14 ~a8~0)) (.cse4 (not (= ~a16~0 6))) (.cse8 (= 1 ~a20~0)) (.cse11 (= 1 ~a17~0)) (.cse5 (<= ~a20~0 0)) (.cse7 (<= ~a21~0 0)) (.cse2 (not (= ~a17~0 1))) (.cse6 (not .cse1)) (.cse0 (not (= ~a7~0 1))) (.cse12 (= |old(~a20~0)| ~a20~0)) (.cse9 (= 1 ~a21~0)) (.cse10 (= 15 ~a8~0))) (or (not (= 1 |old(~a21~0)|)) (and .cse0 .cse1 .cse2) (not (= 8 ~a12~0)) (not (= 1 |old(~a20~0)|)) (not (= 5 |old(~a16~0)|)) (and .cse3 .cse4 .cse2 .cse5) (and (and .cse4 .cse2 .cse6) .cse3) (and .cse7 .cse4 .cse5) (and .cse7 .cse8 .cse4) (and .cse0 .cse4 .cse9 .cse10) (and .cse8 (= 13 ~a8~0) (= 4 ~a16~0) .cse9 .cse11) (and .cse0 .cse12 .cse11) (and .cse9 (and .cse0 .cse5) .cse10) (not (= 0 |old(~a7~0)|)) (not (= 1 |old(~a17~0)|)) (not (= 15 |old(~a8~0)|)) (and .cse7 .cse2 .cse6 (<= 1 ~a20~0)) (and .cse0 .cse12 .cse9 .cse10)))) [2018-11-23 15:13:08,267 INFO L448 ceAbstractionStarter]: For program point L583-3(lines 577 594) no Hoare annotation was computed. [2018-11-23 15:13:08,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:13:08 BoogieIcfgContainer [2018-11-23 15:13:08,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:13:08,277 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:13:08,277 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:13:08,277 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:13:08,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:12:32" (3/4) ... [2018-11-23 15:13:08,280 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 15:13:08,285 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 15:13:08,285 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-23 15:13:08,285 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 15:13:08,293 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 15:13:08,294 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 15:13:08,314 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(1 == \old(a21)) || ((!(a7 == 1) && a16 == 4) && !(a17 == 1))) || !(8 == a12)) || !(1 == \old(a20))) || !(5 == \old(a16))) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || (((!(a16 == 6) && !(a17 == 1)) && !(a16 == 4)) && 14 <= a8)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || ((a21 <= 0 && 1 == a20) && !(a16 == 6))) || (((!(a7 == 1) && !(a16 == 6)) && 1 == a21) && 15 == a8)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((!(a7 == 1) && \old(a20) == a20) && 1 == a17)) || ((1 == a21 && !(a7 == 1) && a20 <= 0) && 15 == a8)) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || (((a21 <= 0 && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20)) || (((!(a7 == 1) && \old(a20) == a20) && 1 == a21) && 15 == a8) [2018-11-23 15:13:08,382 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_60bd3f99-958a-4a8a-8379-cc0b8a2cbedd/bin-2019/utaipan/witness.graphml [2018-11-23 15:13:08,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:13:08,382 INFO L168 Benchmark]: Toolchain (without parser) took 36952.34 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.8 GB). Free memory was 951.1 MB in the beginning and 888.9 MB in the end (delta: 62.2 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-11-23 15:13:08,383 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:13:08,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.80 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-23 15:13:08,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 913.5 MB in the beginning and 1.1 GB in the end (delta: -202.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:13:08,384 INFO L168 Benchmark]: Boogie Preprocessor took 53.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:13:08,384 INFO L168 Benchmark]: RCFGBuilder took 997.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.4 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:13:08,384 INFO L168 Benchmark]: TraceAbstraction took 35347.40 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 927.5 MB in the end (delta: 82.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2018-11-23 15:13:08,385 INFO L168 Benchmark]: Witness Printer took 105.36 ms. Allocated memory is still 2.9 GB. Free memory was 927.5 MB in the beginning and 888.9 MB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:13:08,387 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 366.80 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 77.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 913.5 MB in the beginning and 1.1 GB in the end (delta: -202.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 997.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 102.4 MB). Peak memory consumption was 102.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35347.40 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.0 GB in the beginning and 927.5 MB in the end (delta: 82.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 105.36 ms. Allocated memory is still 2.9 GB. Free memory was 927.5 MB in the beginning and 888.9 MB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 503]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((!(1 == \old(a21)) || ((!(a7 == 1) && a16 == 4) && !(a17 == 1))) || !(8 == a12)) || !(1 == \old(a20))) || !(5 == \old(a16))) || (((14 <= a8 && !(a16 == 6)) && !(a17 == 1)) && a20 <= 0)) || (((!(a16 == 6) && !(a17 == 1)) && !(a16 == 4)) && 14 <= a8)) || ((a21 <= 0 && !(a16 == 6)) && a20 <= 0)) || ((a21 <= 0 && 1 == a20) && !(a16 == 6))) || (((!(a7 == 1) && !(a16 == 6)) && 1 == a21) && 15 == a8)) || ((((1 == a20 && 13 == a8) && 4 == a16) && 1 == a21) && 1 == a17)) || ((!(a7 == 1) && \old(a20) == a20) && 1 == a17)) || ((1 == a21 && !(a7 == 1) && a20 <= 0) && 15 == a8)) || !(0 == \old(a7))) || !(1 == \old(a17))) || !(15 == \old(a8))) || (((a21 <= 0 && !(a17 == 1)) && !(a16 == 4)) && 1 <= a20)) || (((!(a7 == 1) && \old(a20) == a20) && 1 == a21) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 207 locations, 1 error locations. SAFE Result, 35.2s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 23.1s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1787 SDtfs, 16026 SDslu, 2654 SDs, 0 SdLazy, 18760 SolverSat, 3171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 2830 GetRequests, 2566 SyntacticMatches, 17 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3161 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10309occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.6s AbstIntTime, 8 AbstIntIterations, 4 AbstIntStrong, 0.9968725649768959 AbsIntWeakeningRatio, 0.23597122302158274 AbsIntAvgWeakeningVarsNumRemoved, 28.54820143884892 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 1982 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 310 PreInvPairs, 448 NumberOfFragments, 989 HoareAnnotationTreeSize, 310 FomulaSimplifications, 33733 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 38956 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 3267 NumberOfCodeBlocks, 3267 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 4150 ConstructedInterpolants, 0 QuantifiedInterpolants, 2740419 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2554 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 2885/3188 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...