./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f6e8c8b965f85c3429105401e9fda59f9f060cb ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 14:47:22,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:47:22,451 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:47:22,457 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:47:22,457 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:47:22,458 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:47:22,459 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:47:22,459 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:47:22,460 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:47:22,461 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:47:22,461 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:47:22,461 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:47:22,462 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:47:22,462 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:47:22,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:47:22,463 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:47:22,464 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:47:22,464 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:47:22,465 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:47:22,466 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:47:22,467 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:47:22,467 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:47:22,469 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:47:22,469 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:47:22,469 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:47:22,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:47:22,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:47:22,470 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:47:22,471 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:47:22,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:47:22,471 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:47:22,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:47:22,472 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:47:22,472 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:47:22,472 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:47:22,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:47:22,473 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 14:47:22,480 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:47:22,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:47:22,481 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:47:22,481 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:47:22,481 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:47:22,481 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:47:22,481 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:47:22,481 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:47:22,481 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:47:22,481 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:47:22,481 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:47:22,481 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:47:22,482 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:47:22,482 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:47:22,482 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:47:22,482 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:47:22,482 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:47:22,482 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 14:47:22,482 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:47:22,482 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:47:22,482 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:47:22,483 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 14:47:22,483 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 14:47:22,483 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 14:47:22,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:47:22,483 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:47:22,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:47:22,483 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:47:22,483 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:47:22,483 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:47:22,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:47:22,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:47:22,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:47:22,484 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:47:22,484 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:47:22,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:47:22,484 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_fc52bb83-1197-497f-a551-09043af9d766/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 1f6e8c8b965f85c3429105401e9fda59f9f060cb [2018-12-02 14:47:22,501 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:47:22,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:47:22,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:47:22,510 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:47:22,510 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:47:22,511 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-02 14:47:22,547 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/data/fabb04498/8dd99676fa1c4c4b905d8554d27c7141/FLAGbd1886b73 [2018-12-02 14:47:22,997 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:47:22,998 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/sv-benchmarks/c/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-02 14:47:23,003 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/data/fabb04498/8dd99676fa1c4c4b905d8554d27c7141/FLAGbd1886b73 [2018-12-02 14:47:23,011 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/data/fabb04498/8dd99676fa1c4c4b905d8554d27c7141 [2018-12-02 14:47:23,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:47:23,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:47:23,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:47:23,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:47:23,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:47:23,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:47:23" (1/1) ... [2018-12-02 14:47:23,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630eb73f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23, skipping insertion in model container [2018-12-02 14:47:23,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:47:23" (1/1) ... [2018-12-02 14:47:23,023 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:47:23,044 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:47:23,187 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:47:23,193 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:47:23,248 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:47:23,268 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:47:23,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23 WrapperNode [2018-12-02 14:47:23,268 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:47:23,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:47:23,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:47:23,269 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:47:23,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23" (1/1) ... [2018-12-02 14:47:23,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23" (1/1) ... [2018-12-02 14:47:23,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:47:23,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:47:23,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:47:23,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:47:23,292 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23" (1/1) ... [2018-12-02 14:47:23,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23" (1/1) ... [2018-12-02 14:47:23,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23" (1/1) ... [2018-12-02 14:47:23,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23" (1/1) ... [2018-12-02 14:47:23,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23" (1/1) ... [2018-12-02 14:47:23,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23" (1/1) ... [2018-12-02 14:47:23,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23" (1/1) ... [2018-12-02 14:47:23,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:47:23,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:47:23,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:47:23,305 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:47:23,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:47:23,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 14:47:23,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 14:47:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 14:47:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:47:23,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:47:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:47:23,336 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:47:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 14:47:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure cstrspn [2018-12-02 14:47:23,336 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrspn [2018-12-02 14:47:23,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:47:23,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:47:23,527 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:47:23,528 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 14:47:23,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:47:23 BoogieIcfgContainer [2018-12-02 14:47:23,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:47:23,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:47:23,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:47:23,530 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:47:23,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:47:23" (1/3) ... [2018-12-02 14:47:23,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1066f9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:47:23, skipping insertion in model container [2018-12-02 14:47:23,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:47:23" (2/3) ... [2018-12-02 14:47:23,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1066f9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:47:23, skipping insertion in model container [2018-12-02 14:47:23,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:47:23" (3/3) ... [2018-12-02 14:47:23,533 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-12-02 14:47:23,539 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:47:23,544 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-02 14:47:23,553 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-02 14:47:23,568 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:47:23,568 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 14:47:23,568 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:47:23,568 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:47:23,569 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:47:23,569 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:47:23,569 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:47:23,569 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:47:23,578 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-02 14:47:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 14:47:23,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:23,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:47:23,586 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:23,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:23,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1933593497, now seen corresponding path program 1 times [2018-12-02 14:47:23,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:23,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:23,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:23,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:23,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:23,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:47:23,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:47:23,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:47:23,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:47:23,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:47:23,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:47:23,702 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states. [2018-12-02 14:47:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:23,744 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-12-02 14:47:23,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:47:23,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 14:47:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:23,750 INFO L225 Difference]: With dead ends: 48 [2018-12-02 14:47:23,750 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 14:47:23,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:47:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 14:47:23,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-02 14:47:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 14:47:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-02 14:47:23,772 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-12-02 14:47:23,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:23,772 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-02 14:47:23,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:47:23,773 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-02 14:47:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 14:47:23,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:23,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:47:23,773 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:23,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:23,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1933593498, now seen corresponding path program 1 times [2018-12-02 14:47:23,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:23,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:23,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:23,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:23,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:23,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:23,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:47:23,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:47:23,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:47:23,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:47:23,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:47:23,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:47:23,814 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 4 states. [2018-12-02 14:47:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:23,830 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-02 14:47:23,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:47:23,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 14:47:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:23,831 INFO L225 Difference]: With dead ends: 44 [2018-12-02 14:47:23,831 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 14:47:23,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:47:23,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 14:47:23,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 14:47:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 14:47:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-02 14:47:23,834 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 10 [2018-12-02 14:47:23,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:23,835 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-02 14:47:23,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:47:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-02 14:47:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 14:47:23,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:23,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:47:23,835 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:23,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash -188143745, now seen corresponding path program 1 times [2018-12-02 14:47:23,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:23,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:23,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:23,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:23,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:23,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:23,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:47:23,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:47:23,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:47:23,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:47:23,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:47:23,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:47:23,855 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 3 states. [2018-12-02 14:47:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:23,873 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-02 14:47:23,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:47:23,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 14:47:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:23,874 INFO L225 Difference]: With dead ends: 43 [2018-12-02 14:47:23,874 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 14:47:23,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:47:23,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 14:47:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 14:47:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 14:47:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-02 14:47:23,877 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-12-02 14:47:23,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:23,878 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-02 14:47:23,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:47:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-02 14:47:23,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 14:47:23,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:23,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:47:23,878 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:23,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:23,879 INFO L82 PathProgramCache]: Analyzing trace with hash -188143744, now seen corresponding path program 1 times [2018-12-02 14:47:23,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:23,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:23,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:23,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:23,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:23,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:23,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:47:23,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:47:23,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:47:23,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:47:23,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:47:23,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:47:23,908 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-02 14:47:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:23,919 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-12-02 14:47:23,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:47:23,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 14:47:23,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:23,920 INFO L225 Difference]: With dead ends: 42 [2018-12-02 14:47:23,920 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 14:47:23,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:47:23,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 14:47:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-02 14:47:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 14:47:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-02 14:47:23,923 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 11 [2018-12-02 14:47:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:23,924 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-02 14:47:23,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:47:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-02 14:47:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 14:47:23,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:23,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:47:23,924 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:23,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash -57929344, now seen corresponding path program 1 times [2018-12-02 14:47:23,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:23,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:23,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:23,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:23,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:23,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:47:23,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:47:23,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:47:23,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:47:23,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:47:23,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:47:23,957 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 5 states. [2018-12-02 14:47:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:23,999 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-02 14:47:23,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:47:24,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-02 14:47:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:24,000 INFO L225 Difference]: With dead ends: 40 [2018-12-02 14:47:24,000 INFO L226 Difference]: Without dead ends: 40 [2018-12-02 14:47:24,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:47:24,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-02 14:47:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-02 14:47:24,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 14:47:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-12-02 14:47:24,004 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 14 [2018-12-02 14:47:24,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:24,004 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-12-02 14:47:24,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:47:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-12-02 14:47:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 14:47:24,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:24,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:47:24,005 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:24,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:24,005 INFO L82 PathProgramCache]: Analyzing trace with hash -57929343, now seen corresponding path program 1 times [2018-12-02 14:47:24,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:24,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:24,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:24,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:24,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:24,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:47:24,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:47:24,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:47:24,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:47:24,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:47:24,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:47:24,068 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 7 states. [2018-12-02 14:47:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:24,139 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2018-12-02 14:47:24,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:47:24,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-12-02 14:47:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:24,141 INFO L225 Difference]: With dead ends: 62 [2018-12-02 14:47:24,141 INFO L226 Difference]: Without dead ends: 62 [2018-12-02 14:47:24,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:47:24,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-02 14:47:24,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-12-02 14:47:24,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 14:47:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-02 14:47:24,145 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 14 [2018-12-02 14:47:24,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:24,145 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-02 14:47:24,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:47:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-02 14:47:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 14:47:24,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:24,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:47:24,146 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:24,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:24,146 INFO L82 PathProgramCache]: Analyzing trace with hash -852752314, now seen corresponding path program 1 times [2018-12-02 14:47:24,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:24,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:24,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:24,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:24,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:24,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:47:24,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:47:24,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:47:24,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:47:24,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:47:24,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:47:24,173 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 6 states. [2018-12-02 14:47:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:24,216 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-02 14:47:24,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:47:24,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-02 14:47:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:24,217 INFO L225 Difference]: With dead ends: 43 [2018-12-02 14:47:24,217 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 14:47:24,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:47:24,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 14:47:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-02 14:47:24,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 14:47:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-12-02 14:47:24,219 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 18 [2018-12-02 14:47:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:24,219 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-12-02 14:47:24,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:47:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-12-02 14:47:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 14:47:24,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:24,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:47:24,220 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:24,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:24,220 INFO L82 PathProgramCache]: Analyzing trace with hash -852752313, now seen corresponding path program 1 times [2018-12-02 14:47:24,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:24,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:24,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:24,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:24,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:24,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:47:24,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:47:24,267 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:47:24,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 14:47:24,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:47:24,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:47:24,267 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2018-12-02 14:47:24,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:24,331 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2018-12-02 14:47:24,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:47:24,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-02 14:47:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:24,332 INFO L225 Difference]: With dead ends: 55 [2018-12-02 14:47:24,332 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 14:47:24,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:47:24,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 14:47:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-12-02 14:47:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 14:47:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-12-02 14:47:24,335 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 18 [2018-12-02 14:47:24,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:24,335 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-12-02 14:47:24,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 14:47:24,335 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-12-02 14:47:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 14:47:24,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:24,336 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] [2018-12-02 14:47:24,336 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:24,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash 826540276, now seen corresponding path program 1 times [2018-12-02 14:47:24,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:24,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:24,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:24,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:24,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:24,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:47:24,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:47:24,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:47:24,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:47:24,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:47:24,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:47:24,373 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2018-12-02 14:47:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:24,407 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-12-02 14:47:24,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:47:24,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-12-02 14:47:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:24,408 INFO L225 Difference]: With dead ends: 46 [2018-12-02 14:47:24,408 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 14:47:24,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:47:24,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 14:47:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-02 14:47:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 14:47:24,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-02 14:47:24,410 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 20 [2018-12-02 14:47:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:24,410 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-02 14:47:24,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:47:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-02 14:47:24,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 14:47:24,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:24,411 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] [2018-12-02 14:47:24,411 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:24,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:24,411 INFO L82 PathProgramCache]: Analyzing trace with hash -875762082, now seen corresponding path program 1 times [2018-12-02 14:47:24,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:24,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:24,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:24,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:24,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:24,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:47:24,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:47:24,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:47:24,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:47:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:47:24,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:47:24,430 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-12-02 14:47:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:24,435 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-12-02 14:47:24,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:47:24,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 14:47:24,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:24,436 INFO L225 Difference]: With dead ends: 43 [2018-12-02 14:47:24,436 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 14:47:24,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:47:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 14:47:24,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 14:47:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 14:47:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-12-02 14:47:24,440 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 22 [2018-12-02 14:47:24,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:24,440 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-12-02 14:47:24,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:47:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-12-02 14:47:24,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 14:47:24,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:24,441 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] [2018-12-02 14:47:24,441 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:24,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:24,441 INFO L82 PathProgramCache]: Analyzing trace with hash 200370203, now seen corresponding path program 1 times [2018-12-02 14:47:24,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:24,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:24,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:24,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:24,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:24,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:47:24,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:47:24,613 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-02 14:47:24,614 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [22], [29], [33], [40], [41], [44], [49], [51], [52], [55], [56], [59], [67], [85], [86], [87], [89] [2018-12-02 14:47:24,634 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:47:24,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:47:24,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:47:24,778 INFO L272 AbstractInterpreter]: Visited 24 different actions 38 times. Merged at 7 different actions 14 times. Never widened. Performed 330 root evaluator evaluations with a maximum evaluation depth of 6. Performed 330 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-02 14:47:24,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:24,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:47:24,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:47:24,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:47:24,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:24,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:47:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:24,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:47:24,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 14:47:24,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:24,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:24,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-02 14:47:24,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 14:47:24,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-02 14:47:24,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:24,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:24,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:24,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-02 14:47:24,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-12-02 14:47:24,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 14:47:24,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:24,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:24,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 14:47:24,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:22 [2018-12-02 14:47:24,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-12-02 14:47:25,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-12-02 14:47:25,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:25,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 14:47:25,008 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:25,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:25,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:25,012 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:29, output treesize:3 [2018-12-02 14:47:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:47:25,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:47:25,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-02 14:47:25,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 14:47:25,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:25,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:25,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:25,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-12-02 14:47:25,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:47:25,127 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:47:25,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [11] total 22 [2018-12-02 14:47:25,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:47:25,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:47:25,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:47:25,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-12-02 14:47:25,128 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 9 states. [2018-12-02 14:47:27,626 WARN L180 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 14:47:30,572 WARN L180 SmtUtils]: Spent 2.93 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 14:47:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:30,591 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-12-02 14:47:30,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:47:30,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-12-02 14:47:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:30,591 INFO L225 Difference]: With dead ends: 51 [2018-12-02 14:47:30,592 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 14:47:30,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-12-02 14:47:30,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 14:47:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 14:47:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 14:47:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-02 14:47:30,594 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-12-02 14:47:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:30,594 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-02 14:47:30,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:47:30,594 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-02 14:47:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 14:47:30,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:30,594 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] [2018-12-02 14:47:30,595 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:30,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:30,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1793774503, now seen corresponding path program 1 times [2018-12-02 14:47:30,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:30,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:30,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:30,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:30,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:30,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:47:30,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:47:30,756 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-02 14:47:30,756 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [29], [33], [40], [41], [44], [49], [51], [52], [55], [56], [59], [67], [85], [86], [87], [89] [2018-12-02 14:47:30,757 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:47:30,757 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:47:30,822 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:47:30,822 INFO L272 AbstractInterpreter]: Visited 24 different actions 45 times. Merged at 7 different actions 21 times. Widened at 1 different actions 1 times. Performed 408 root evaluator evaluations with a maximum evaluation depth of 6. Performed 408 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 30 variables. [2018-12-02 14:47:30,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:30,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:47:30,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:47:30,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:47:30,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:30,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:47:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:30,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:47:30,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 14:47:30,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 14:47:30,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:30,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:30,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 14:47:30,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 14:47:30,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-02 14:47:30,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 14:47:30,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:47:30,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:47:30,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:47:30,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-12-02 14:47:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:31,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:47:31,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-02 14:47:31,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:31,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-02 14:47:31,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 14:47:31,241 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:31,242 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:31,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:31,247 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-12-02 14:47:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:31,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:47:31,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2018-12-02 14:47:31,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:47:31,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 14:47:31,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 14:47:31,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-12-02 14:47:31,267 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 19 states. [2018-12-02 14:47:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:32,642 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-12-02 14:47:32,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 14:47:32,643 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2018-12-02 14:47:32,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:32,643 INFO L225 Difference]: With dead ends: 67 [2018-12-02 14:47:32,643 INFO L226 Difference]: Without dead ends: 67 [2018-12-02 14:47:32,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2018-12-02 14:47:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-02 14:47:32,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2018-12-02 14:47:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 14:47:32,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-12-02 14:47:32,646 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 24 [2018-12-02 14:47:32,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:32,646 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-12-02 14:47:32,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 14:47:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-12-02 14:47:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 14:47:32,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:32,647 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] [2018-12-02 14:47:32,647 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:32,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 408019855, now seen corresponding path program 1 times [2018-12-02 14:47:32,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:32,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:32,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:32,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:32,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:32,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:47:32,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 14:47:32,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:47:32,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:47:32,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:47:32,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:47:32,707 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 10 states. [2018-12-02 14:47:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:32,805 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-12-02 14:47:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:47:32,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-02 14:47:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:32,805 INFO L225 Difference]: With dead ends: 54 [2018-12-02 14:47:32,805 INFO L226 Difference]: Without dead ends: 51 [2018-12-02 14:47:32,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2018-12-02 14:47:32,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-02 14:47:32,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-12-02 14:47:32,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-02 14:47:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-12-02 14:47:32,808 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2018-12-02 14:47:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:32,808 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-12-02 14:47:32,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:47:32,809 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-12-02 14:47:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 14:47:32,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:32,809 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] [2018-12-02 14:47:32,809 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:32,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:32,810 INFO L82 PathProgramCache]: Analyzing trace with hash -354296782, now seen corresponding path program 1 times [2018-12-02 14:47:32,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:32,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:32,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:32,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:32,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:32,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:47:32,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:47:32,990 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-02 14:47:32,990 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [29], [33], [35], [40], [41], [44], [49], [52], [55], [56], [59], [65], [71], [77], [79], [85], [86], [87], [89] [2018-12-02 14:47:32,991 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:47:32,991 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:47:33,071 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:47:33,071 INFO L272 AbstractInterpreter]: Visited 27 different actions 69 times. Merged at 14 different actions 42 times. Widened at 1 different actions 1 times. Performed 582 root evaluator evaluations with a maximum evaluation depth of 6. Performed 582 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-12-02 14:47:33,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:33,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:47:33,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:47:33,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:47:33,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:33,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:47:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:33,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:47:33,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 14:47:33,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:33,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:33,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-02 14:47:33,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 14:47:33,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 14:47:33,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:33,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:33,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 14:47:33,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-02 14:47:33,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-02 14:47:33,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 14:47:33,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:33,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:33,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 14:47:33,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-02 14:47:33,977 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-02 14:47:34,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2018-12-02 14:47:34,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 43 [2018-12-02 14:47:34,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:47:34,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 49 [2018-12-02 14:47:34,103 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-02 14:47:34,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-02 14:47:34,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:34,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-02 14:47:34,168 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:34,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-02 14:47:34,223 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:34,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2018-12-02 14:47:34,279 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-02 14:47:34,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-12-02 14:47:34,334 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:34,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-02 14:47:34,335 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:34,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2018-12-02 14:47:34,397 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-12-02 14:47:34,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-12-02 14:47:34,462 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:34,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-12-02 14:47:34,464 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:34,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-02 14:47:34,465 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:34,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-02 14:47:34,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:47:34,563 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:63, output treesize:66 [2018-12-02 14:47:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:34,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:47:35,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 14:47:35,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:35,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-02 14:47:35,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-12-02 14:47:35,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:35,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-02 14:47:35,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:35,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:35,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:35,194 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:69, output treesize:7 [2018-12-02 14:47:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:35,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:47:35,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 14] total 39 [2018-12-02 14:47:35,216 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:47:35,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-02 14:47:35,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 14:47:35,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1376, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 14:47:35,217 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 28 states. [2018-12-02 14:47:37,114 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2018-12-02 14:47:39,435 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-12-02 14:47:40,224 WARN L180 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2018-12-02 14:47:43,822 WARN L180 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2018-12-02 14:47:45,851 WARN L180 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-12-02 14:47:46,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:46,051 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-12-02 14:47:46,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 14:47:46,051 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-02 14:47:46,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:46,051 INFO L225 Difference]: With dead ends: 109 [2018-12-02 14:47:46,051 INFO L226 Difference]: Without dead ends: 109 [2018-12-02 14:47:46,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=516, Invalid=2790, Unknown=0, NotChecked=0, Total=3306 [2018-12-02 14:47:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-02 14:47:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2018-12-02 14:47:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 14:47:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2018-12-02 14:47:46,054 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 27 [2018-12-02 14:47:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:46,054 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2018-12-02 14:47:46,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-02 14:47:46,055 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2018-12-02 14:47:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 14:47:46,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:46,055 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] [2018-12-02 14:47:46,055 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:46,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:46,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1717586259, now seen corresponding path program 2 times [2018-12-02 14:47:46,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:46,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:46,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:47:46,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:46,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:46,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:47:46,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:47:46,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:47:46,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:47:46,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:47:46,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:47:46,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:47:46,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:47:46,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 14:47:46,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:47:46,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:47:46,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 14:47:46,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 14:47:46,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:47:46,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:47:46,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:46,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-02 14:47:46,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-02 14:47:46,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 14:47:46,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:46,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:46,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 14:47:46,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-12-02 14:47:46,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-02 14:47:46,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 14 [2018-12-02 14:47:46,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:46,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:46,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:46,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:24 [2018-12-02 14:47:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:47:46,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:47:46,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-02 14:47:46,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-02 14:47:46,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:46,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:46,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:46,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-02 14:47:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:47:46,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:47:46,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2018-12-02 14:47:46,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:47:46,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 14:47:46,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 14:47:46,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2018-12-02 14:47:46,762 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 22 states. [2018-12-02 14:47:48,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:48,086 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2018-12-02 14:47:48,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-02 14:47:48,086 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-12-02 14:47:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:48,087 INFO L225 Difference]: With dead ends: 92 [2018-12-02 14:47:48,087 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 14:47:48,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=543, Invalid=2427, Unknown=0, NotChecked=0, Total=2970 [2018-12-02 14:47:48,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 14:47:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 44. [2018-12-02 14:47:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 14:47:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-12-02 14:47:48,089 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 30 [2018-12-02 14:47:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:48,089 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-12-02 14:47:48,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 14:47:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-12-02 14:47:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 14:47:48,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:48,089 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] [2018-12-02 14:47:48,089 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:48,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:48,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1058353633, now seen corresponding path program 2 times [2018-12-02 14:47:48,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:48,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:47:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:48,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:48,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:47:48,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:47:48,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:47:48,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:47:48,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:47:48,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:47:48,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:47:48,252 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:47:48,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 14:47:48,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:47:48,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:47:48,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 14:47:48,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:48,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:48,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-02 14:47:48,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-02 14:47:48,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 14:47:48,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:48,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:48,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 14:47:48,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-02 14:47:48,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-12-02 14:47:48,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 14:47:48,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:48,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:48,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 14:47:48,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2018-12-02 14:47:49,340 WARN L180 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-02 14:47:49,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-12-02 14:47:49,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-12-02 14:47:49,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:49,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2018-12-02 14:47:49,412 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-12-02 14:47:49,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:47:49,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:47:49,459 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:78, output treesize:81 [2018-12-02 14:47:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:49,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:47:51,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-12-02 14:47:51,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:51,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 42 [2018-12-02 14:47:51,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2018-12-02 14:47:51,833 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:51,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2018-12-02 14:47:51,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:51,855 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:51,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:47:51,864 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:24 [2018-12-02 14:47:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:47:51,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:47:51,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 20] total 48 [2018-12-02 14:47:51,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:47:51,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 14:47:51,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 14:47:51,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2136, Unknown=0, NotChecked=0, Total=2352 [2018-12-02 14:47:51,894 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 31 states. [2018-12-02 14:47:56,445 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2018-12-02 14:47:57,861 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2018-12-02 14:47:59,027 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 89 [2018-12-02 14:47:59,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:47:59,298 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2018-12-02 14:47:59,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 14:47:59,299 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-12-02 14:47:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:47:59,299 INFO L225 Difference]: With dead ends: 98 [2018-12-02 14:47:59,299 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 14:47:59,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=790, Invalid=4759, Unknown=1, NotChecked=0, Total=5550 [2018-12-02 14:47:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 14:47:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 57. [2018-12-02 14:47:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-02 14:47:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-12-02 14:47:59,302 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 40 [2018-12-02 14:47:59,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:47:59,302 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-12-02 14:47:59,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 14:47:59,302 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-12-02 14:47:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 14:47:59,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:47:59,302 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:47:59,303 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, cstrspnErr8REQUIRES_VIOLATION, cstrspnErr3REQUIRES_VIOLATION, cstrspnErr1REQUIRES_VIOLATION, cstrspnErr7REQUIRES_VIOLATION, cstrspnErr2REQUIRES_VIOLATION, cstrspnErr5REQUIRES_VIOLATION, cstrspnErr6REQUIRES_VIOLATION, cstrspnErr9REQUIRES_VIOLATION, cstrspnErr4REQUIRES_VIOLATION, cstrspnErr0REQUIRES_VIOLATION]=== [2018-12-02 14:47:59,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:47:59,303 INFO L82 PathProgramCache]: Analyzing trace with hash -586865326, now seen corresponding path program 3 times [2018-12-02 14:47:59,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:47:59,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:59,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:47:59,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:47:59,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:47:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:47:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:47:59,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:47:59,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:47:59,521 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:47:59,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:47:59,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:47:59,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:47:59,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:47:59,526 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:47:59,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:47:59,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:47:59,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:47:59,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-02 14:47:59,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:59,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-02 14:47:59,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 14:47:59,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:59,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:59,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:59,566 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-02 14:47:59,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 14:47:59,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-12-02 14:47:59,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:59,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:59,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:59,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-02 14:47:59,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-02 14:47:59,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-02 14:47:59,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:47:59,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:47:59,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 14:47:59,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-12-02 14:48:01,839 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 14:48:02,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-12-02 14:48:02,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-02 14:48:02,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:48:02,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-02 14:48:02,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 14:48:02,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:48:02,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:48:02,130 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2018-12-02 14:48:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:48:02,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:48:03,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2018-12-02 14:48:03,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-12-02 14:48:03,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:48:03,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:48:03,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:48:03,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:74 [2018-12-02 14:48:03,183 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:48:03,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:48:03,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 56 [2018-12-02 14:48:03,198 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:48:03,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-02 14:48:03,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-02 14:48:03,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2889, Unknown=4, NotChecked=0, Total=3192 [2018-12-02 14:48:03,199 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 39 states. [2018-12-02 14:48:04,889 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-12-02 14:48:05,481 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-12-02 14:48:06,018 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2018-12-02 14:48:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:48:07,775 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-12-02 14:48:07,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-02 14:48:07,775 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 53 [2018-12-02 14:48:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:48:07,775 INFO L225 Difference]: With dead ends: 113 [2018-12-02 14:48:07,775 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 14:48:07,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2418 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=2714, Invalid=9938, Unknown=4, NotChecked=0, Total=12656 [2018-12-02 14:48:07,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 14:48:07,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 14:48:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 14:48:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 14:48:07,777 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2018-12-02 14:48:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:48:07,777 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:48:07,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-02 14:48:07,777 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 14:48:07,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 14:48:07,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:48:07 BoogieIcfgContainer [2018-12-02 14:48:07,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:48:07,781 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:48:07,781 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:48:07,781 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:48:07,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:47:23" (3/4) ... [2018-12-02 14:48:07,783 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 14:48:07,786 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 14:48:07,787 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 14:48:07,787 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrspn [2018-12-02 14:48:07,789 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-02 14:48:07,789 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 14:48:07,789 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 14:48:07,813 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fc52bb83-1197-497f-a551-09043af9d766/bin-2019/utaipan/witness.graphml [2018-12-02 14:48:07,813 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:48:07,814 INFO L168 Benchmark]: Toolchain (without parser) took 44800.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 274.7 MB). Free memory was 948.1 MB in the beginning and 1.2 GB in the end (delta: -206.8 MB). Peak memory consumption was 67.9 MB. Max. memory is 11.5 GB. [2018-12-02 14:48:07,814 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:48:07,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -156.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:48:07,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:48:07,814 INFO L168 Benchmark]: Boogie Preprocessor took 17.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:48:07,815 INFO L168 Benchmark]: RCFGBuilder took 223.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2018-12-02 14:48:07,815 INFO L168 Benchmark]: TraceAbstraction took 44251.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.3 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:48:07,815 INFO L168 Benchmark]: Witness Printer took 32.67 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-12-02 14:48:07,816 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 254.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -156.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 223.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 44251.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 156.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -89.3 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. * Witness Printer took 32.67 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 15 error locations. SAFE Result, 44.2s OverallTime, 17 OverallIterations, 3 TraceHistogramMax, 31.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 517 SDtfs, 1765 SDslu, 2117 SDs, 0 SdLazy, 3470 SolverSat, 370 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 260 SyntacticMatches, 12 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4687 ImplicationChecksByTransitivity, 36.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 171 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 569 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 738 ConstructedInterpolants, 176 QuantifiedInterpolants, 499327 SizeOfPredicates, 130 NumberOfNonLiveVariables, 950 ConjunctsInSsa, 238 ConjunctsInUnsatCore, 29 InterpolantComputations, 13 PerfectInterpolantSequences, 34/206 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...