./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-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_e7bc7df1-a700-4e01-a768-c7dc733fffe4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/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 b2d654b7b73105d319f19561f723c76c3f2a6a70 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:52:45,425 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:52:45,426 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:52:45,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:52:45,433 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:52:45,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:52:45,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:52:45,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:52:45,435 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:52:45,436 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:52:45,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:52:45,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:52:45,437 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:52:45,437 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:52:45,438 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:52:45,438 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:52:45,439 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:52:45,440 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:52:45,441 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:52:45,441 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:52:45,442 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:52:45,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:52:45,444 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:52:45,444 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:52:45,444 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:52:45,444 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:52:45,445 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:52:45,445 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:52:45,446 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:52:45,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:52:45,447 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:52:45,447 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:52:45,447 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:52:45,447 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:52:45,448 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:52:45,448 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:52:45,448 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-02 14:52:45,456 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:52:45,456 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:52:45,456 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:52:45,456 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:52:45,456 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:52:45,457 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:52:45,457 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:52:45,457 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:52:45,457 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:52:45,457 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:52:45,457 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:52:45,457 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:52:45,457 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:52:45,458 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:52:45,458 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:52:45,458 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:52:45,458 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:52:45,458 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 14:52:45,458 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:52:45,458 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:52:45,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:52:45,459 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 14:52:45,459 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 14:52:45,459 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 14:52:45,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:52:45,459 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:52:45,459 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:52:45,459 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:52:45,459 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:52:45,460 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:52:45,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:52:45,460 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:52:45,460 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:52:45,460 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:52:45,460 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:52:45,460 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:52:45,460 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_e7bc7df1-a700-4e01-a768-c7dc733fffe4/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 -> b2d654b7b73105d319f19561f723c76c3f2a6a70 [2018-12-02 14:52:45,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:52:45,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:52:45,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:52:45,491 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:52:45,491 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:52:45,492 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-02 14:52:45,536 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/bin-2019/utaipan/data/b814f21e2/11c375c863e14644820a96522302b766/FLAG75cbf9a9d [2018-12-02 14:52:46,014 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:52:46,014 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-02 14:52:46,023 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/bin-2019/utaipan/data/b814f21e2/11c375c863e14644820a96522302b766/FLAG75cbf9a9d [2018-12-02 14:52:46,033 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/bin-2019/utaipan/data/b814f21e2/11c375c863e14644820a96522302b766 [2018-12-02 14:52:46,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:52:46,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:52:46,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:52:46,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:52:46,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:52:46,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c3ff299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46, skipping insertion in model container [2018-12-02 14:52:46,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:52:46,076 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:52:46,251 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:52:46,257 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:52:46,315 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:52:46,345 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:52:46,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46 WrapperNode [2018-12-02 14:52:46,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:52:46,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:52:46,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:52:46,346 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:52:46,350 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:52:46" (1/1) ... [2018-12-02 14:52:46,358 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:52:46" (1/1) ... [2018-12-02 14:52:46,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:52:46,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:52:46,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:52:46,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:52:46,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... [2018-12-02 14:52:46,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:52:46,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:52:46,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:52:46,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:52:46,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/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:52:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 14:52:46,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 14:52:46,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 14:52:46,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:52:46,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:52:46,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:52:46,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:52:46,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 14:52:46,409 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-12-02 14:52:46,409 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-12-02 14:52:46,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:52:46,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:52:46,569 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:52:46,569 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 14:52:46,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:52:46 BoogieIcfgContainer [2018-12-02 14:52:46,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:52:46,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:52:46,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:52:46,573 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:52:46,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:52:46" (1/3) ... [2018-12-02 14:52:46,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180e8d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:52:46, skipping insertion in model container [2018-12-02 14:52:46,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:52:46" (2/3) ... [2018-12-02 14:52:46,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@180e8d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:52:46, skipping insertion in model container [2018-12-02 14:52:46,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:52:46" (3/3) ... [2018-12-02 14:52:46,575 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-02 14:52:46,582 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:52:46,586 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-02 14:52:46,594 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-02 14:52:46,608 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:52:46,608 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 14:52:46,608 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:52:46,608 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:52:46,608 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:52:46,608 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:52:46,608 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:52:46,608 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:52:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-12-02 14:52:46,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 14:52:46,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:46,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:46,625 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:46,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:46,629 INFO L82 PathProgramCache]: Analyzing trace with hash 471606177, now seen corresponding path program 1 times [2018-12-02 14:52:46,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:46,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:46,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:46,732 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:52:46,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:46,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:52:46,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:46,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:52:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:52:46,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:52:46,746 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-12-02 14:52:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:46,788 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-02 14:52:46,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:52:46,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-02 14:52:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:46,795 INFO L225 Difference]: With dead ends: 49 [2018-12-02 14:52:46,795 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 14:52:46,796 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:52:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 14:52:46,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-02 14:52:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 14:52:46,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-12-02 14:52:46,817 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 10 [2018-12-02 14:52:46,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:46,818 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-12-02 14:52:46,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:52:46,818 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-12-02 14:52:46,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-02 14:52:46,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:46,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:46,818 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:46,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:46,819 INFO L82 PathProgramCache]: Analyzing trace with hash 471606178, now seen corresponding path program 1 times [2018-12-02 14:52:46,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:46,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:46,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:46,851 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:52:46,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:46,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:52:46,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:46,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:52:46,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:52:46,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:52:46,853 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 4 states. [2018-12-02 14:52:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:46,873 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-12-02 14:52:46,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:52:46,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-02 14:52:46,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:46,874 INFO L225 Difference]: With dead ends: 45 [2018-12-02 14:52:46,874 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 14:52:46,875 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:52:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 14:52:46,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-02 14:52:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 14:52:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-02 14:52:46,877 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-12-02 14:52:46,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:46,878 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-02 14:52:46,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:52:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-02 14:52:46,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 14:52:46,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:46,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:46,878 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:46,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:46,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1734889591, now seen corresponding path program 1 times [2018-12-02 14:52:46,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:46,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:46,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:46,896 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:52:46,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:46,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:52:46,897 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:46,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:52:46,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:52:46,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:52:46,897 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 3 states. [2018-12-02 14:52:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:46,915 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-02 14:52:46,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:52:46,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 14:52:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:46,916 INFO L225 Difference]: With dead ends: 44 [2018-12-02 14:52:46,916 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 14:52:46,916 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:52:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 14:52:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 14:52:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 14:52:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-02 14:52:46,918 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 11 [2018-12-02 14:52:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:46,918 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-02 14:52:46,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:52:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-02 14:52:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 14:52:46,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:46,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:46,919 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:46,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:46,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1734889592, now seen corresponding path program 1 times [2018-12-02 14:52:46,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:46,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:46,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:46,943 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:52:46,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:46,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:52:46,943 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:46,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:52:46,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:52:46,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:52:46,943 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2018-12-02 14:52:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:46,953 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-02 14:52:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:52:46,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-02 14:52:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:46,953 INFO L225 Difference]: With dead ends: 43 [2018-12-02 14:52:46,954 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 14:52:46,954 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:52:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 14:52:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-02 14:52:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 14:52:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-02 14:52:46,956 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-12-02 14:52:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:46,956 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-02 14:52:46,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:52:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-02 14:52:46,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 14:52:46,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:46,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:46,957 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:46,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:46,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1210784725, now seen corresponding path program 1 times [2018-12-02 14:52:46,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:46,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:46,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:46,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:46,990 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:52:46,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:46,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:52:46,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:46,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:52:46,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:52:46,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:52:46,991 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 5 states. [2018-12-02 14:52:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:47,031 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-12-02 14:52:47,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:52:47,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-02 14:52:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:47,032 INFO L225 Difference]: With dead ends: 41 [2018-12-02 14:52:47,032 INFO L226 Difference]: Without dead ends: 41 [2018-12-02 14:52:47,032 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:52:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-02 14:52:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-02 14:52:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 14:52:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-02 14:52:47,035 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 16 [2018-12-02 14:52:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:47,036 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-02 14:52:47,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:52:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-02 14:52:47,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-02 14:52:47,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:47,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:47,037 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:47,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:47,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1210784726, now seen corresponding path program 1 times [2018-12-02 14:52:47,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:47,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:47,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:47,120 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:52:47,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:47,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:52:47,120 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:47,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:52:47,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:52:47,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:52:47,120 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 7 states. [2018-12-02 14:52:47,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:47,179 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-12-02 14:52:47,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:52:47,179 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-02 14:52:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:47,181 INFO L225 Difference]: With dead ends: 55 [2018-12-02 14:52:47,181 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 14:52:47,181 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:52:47,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 14:52:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-12-02 14:52:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 14:52:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-02 14:52:47,184 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2018-12-02 14:52:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:47,184 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-02 14:52:47,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:52:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-02 14:52:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 14:52:47,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:47,185 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:52:47,185 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:47,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:47,185 INFO L82 PathProgramCache]: Analyzing trace with hash -372016138, now seen corresponding path program 1 times [2018-12-02 14:52:47,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:47,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:47,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:47,213 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:52:47,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:47,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:52:47,214 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:47,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:52:47,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:52:47,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:52:47,214 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 6 states. [2018-12-02 14:52:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:47,264 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-12-02 14:52:47,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:52:47,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-02 14:52:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:47,265 INFO L225 Difference]: With dead ends: 45 [2018-12-02 14:52:47,266 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 14:52:47,266 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:52:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 14:52:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-02 14:52:47,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 14:52:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-12-02 14:52:47,268 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 18 [2018-12-02 14:52:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:47,268 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-12-02 14:52:47,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:52:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-12-02 14:52:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 14:52:47,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:47,269 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:52:47,269 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:47,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash -372016137, now seen corresponding path program 1 times [2018-12-02 14:52:47,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:47,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:47,331 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:52:47,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:47,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:52:47,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:47,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 14:52:47,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:52:47,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:52:47,333 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 8 states. [2018-12-02 14:52:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:47,402 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-12-02 14:52:47,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:52:47,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-02 14:52:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:47,403 INFO L225 Difference]: With dead ends: 47 [2018-12-02 14:52:47,403 INFO L226 Difference]: Without dead ends: 47 [2018-12-02 14:52:47,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:52:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-02 14:52:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-12-02 14:52:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 14:52:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-12-02 14:52:47,405 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2018-12-02 14:52:47,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:47,405 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-12-02 14:52:47,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 14:52:47,405 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-12-02 14:52:47,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 14:52:47,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:47,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:47,406 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:47,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:47,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1352649081, now seen corresponding path program 1 times [2018-12-02 14:52:47,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:47,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:47,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:47,454 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:52:47,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:47,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:52:47,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:47,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:52:47,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:52:47,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:52:47,456 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 4 states. [2018-12-02 14:52:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:47,500 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-12-02 14:52:47,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:52:47,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-02 14:52:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:47,501 INFO L225 Difference]: With dead ends: 44 [2018-12-02 14:52:47,501 INFO L226 Difference]: Without dead ends: 38 [2018-12-02 14:52:47,501 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:52:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-02 14:52:47,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-02 14:52:47,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 14:52:47,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-02 14:52:47,503 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 19 [2018-12-02 14:52:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:47,503 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-02 14:52:47,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:52:47,503 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-02 14:52:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 14:52:47,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:47,504 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:52:47,504 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:47,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:47,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1025222217, now seen corresponding path program 1 times [2018-12-02 14:52:47,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:47,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:47,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:47,530 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:52:47,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:47,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:52:47,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:47,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:52:47,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:52:47,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:52:47,531 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-12-02 14:52:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:47,573 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-02 14:52:47,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:52:47,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-02 14:52:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:47,573 INFO L225 Difference]: With dead ends: 37 [2018-12-02 14:52:47,573 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 14:52:47,573 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:52:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 14:52:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-02 14:52:47,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 14:52:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-12-02 14:52:47,575 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 20 [2018-12-02 14:52:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:47,575 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-12-02 14:52:47,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:52:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-12-02 14:52:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 14:52:47,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:47,576 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:52:47,576 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:47,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:47,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1025222216, now seen corresponding path program 1 times [2018-12-02 14:52:47,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:47,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:47,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:47,613 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:52:47,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:47,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:52:47,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:47,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:52:47,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:52:47,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:52:47,614 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 7 states. [2018-12-02 14:52:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:47,659 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-02 14:52:47,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:52:47,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-02 14:52:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:47,660 INFO L225 Difference]: With dead ends: 42 [2018-12-02 14:52:47,660 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 14:52:47,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:52:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 14:52:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-12-02 14:52:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 14:52:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-02 14:52:47,663 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2018-12-02 14:52:47,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:47,663 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-02 14:52:47,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:52:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-02 14:52:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 14:52:47,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:47,664 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:52:47,664 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:47,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:47,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1691315848, now seen corresponding path program 1 times [2018-12-02 14:52:47,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:47,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:47,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:47,697 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:52:47,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:47,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:52:47,698 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:47,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:52:47,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:52:47,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:52:47,698 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-12-02 14:52:47,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:47,738 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-02 14:52:47,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:52:47,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-02 14:52:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:47,739 INFO L225 Difference]: With dead ends: 37 [2018-12-02 14:52:47,739 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 14:52:47,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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:52:47,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 14:52:47,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-02 14:52:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 14:52:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-12-02 14:52:47,741 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2018-12-02 14:52:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:47,741 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-12-02 14:52:47,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:52:47,741 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-12-02 14:52:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 14:52:47,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:47,742 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:52:47,742 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:47,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:47,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1691315847, now seen corresponding path program 1 times [2018-12-02 14:52:47,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:47,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:47,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:47,823 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:52:47,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:47,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 14:52:47,823 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:47,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:52:47,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:52:47,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:52:47,824 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 10 states. [2018-12-02 14:52:47,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:47,910 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-12-02 14:52:47,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:52:47,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-02 14:52:47,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:47,910 INFO L225 Difference]: With dead ends: 45 [2018-12-02 14:52:47,910 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 14:52:47,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:52:47,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 14:52:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-12-02 14:52:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 14:52:47,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-02 14:52:47,913 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2018-12-02 14:52:47,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:47,913 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-02 14:52:47,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:52:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-02 14:52:47,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 14:52:47,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:47,914 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:52:47,914 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:47,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:47,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1590515975, now seen corresponding path program 1 times [2018-12-02 14:52:47,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:47,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:47,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:47,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:48,033 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:52:48,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:52:48,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 14:52:48,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:48,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:52:48,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:52:48,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 14:52:48,034 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-12-02 14:52:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:48,111 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-12-02 14:52:48,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:52:48,112 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-12-02 14:52:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:48,112 INFO L225 Difference]: With dead ends: 50 [2018-12-02 14:52:48,112 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 14:52:48,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-02 14:52:48,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 14:52:48,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-02 14:52:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 14:52:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-02 14:52:48,114 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 24 [2018-12-02 14:52:48,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:48,114 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-02 14:52:48,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:52:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-02 14:52:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 14:52:48,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:48,115 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:52:48,115 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:48,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:48,115 INFO L82 PathProgramCache]: Analyzing trace with hash 710306615, now seen corresponding path program 1 times [2018-12-02 14:52:48,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:48,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:48,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:48,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:48,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:48,259 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:52:48,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:48,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:52:48,260 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-02 14:52:48,261 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [25], [30], [34], [38], [40], [41], [42], [56], [57], [64], [66], [71], [77], [78], [79], [81] [2018-12-02 14:52:48,282 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:52:48,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:52:48,394 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:52:48,394 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Merged at 8 different actions 8 times. Never widened. Performed 276 root evaluator evaluations with a maximum evaluation depth of 3. Performed 276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-02 14:52:48,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:48,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:52:48,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:48,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/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:52:48,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:48,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:52:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:48,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:48,480 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:52:48,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:48,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:48,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-02 14:52:48,505 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:52:48,507 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:52:48,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:48,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:48,514 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:52:48,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-02 14:52:48,544 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:52:48,546 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:52:48,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:48,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:48,556 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:52:48,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-02 14:52:48,686 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 30 treesize of output 28 [2018-12-02 14:52:48,693 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 16 treesize of output 13 [2018-12-02 14:52:48,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:52:48,700 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:52:48,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:48,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:52:48,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:52:48,716 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-12-02 14:52:48,746 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:52:48,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:52:48,912 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:52:48,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:48,918 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:52:48,925 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:52:48,925 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:48,926 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:48,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:48,931 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-02 14:52:48,936 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:52:48,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:52:48,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 22 [2018-12-02 14:52:48,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:52:48,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 14:52:48,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 14:52:48,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-12-02 14:52:48,952 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 17 states. [2018-12-02 14:52:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:49,393 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-12-02 14:52:49,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:52:49,394 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-12-02 14:52:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:49,394 INFO L225 Difference]: With dead ends: 48 [2018-12-02 14:52:49,394 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 14:52:49,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2018-12-02 14:52:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 14:52:49,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-12-02 14:52:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 14:52:49,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-12-02 14:52:49,397 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 24 [2018-12-02 14:52:49,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:49,397 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-12-02 14:52:49,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 14:52:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-12-02 14:52:49,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 14:52:49,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:49,398 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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:52:49,398 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:49,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:49,398 INFO L82 PathProgramCache]: Analyzing trace with hash -295143656, now seen corresponding path program 1 times [2018-12-02 14:52:49,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:49,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:49,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:49,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:49,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:49,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:49,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:49,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:52:49,611 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-02 14:52:49,611 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [25], [30], [34], [38], [41], [42], [44], [56], [57], [64], [66], [71], [77], [78], [79], [81] [2018-12-02 14:52:49,612 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:52:49,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:52:49,647 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:52:49,647 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Merged at 8 different actions 8 times. Never widened. Performed 276 root evaluator evaluations with a maximum evaluation depth of 3. Performed 276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-02 14:52:49,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:49,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:52:49,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:49,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/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:52:49,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:49,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:52:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:49,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:49,675 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:52:49,676 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:52:49,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,681 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:52:49,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-02 14:52:49,843 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 31 treesize of output 31 [2018-12-02 14:52:49,849 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 27 treesize of output 25 [2018-12-02 14:52:49,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:52:49,862 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 15 treesize of output 8 [2018-12-02 14:52:49,862 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,864 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 19 treesize of output 14 [2018-12-02 14:52:49,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:49,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-12-02 14:52:49,883 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 14:52:49,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:52:49,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:52:49,905 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-12-02 14:52:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:49,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:52:50,276 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:52:50,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:50,289 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:52:50,312 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:52:50,313 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:50,318 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:50,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:50,326 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-12-02 14:52:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:50,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:52:50,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2018-12-02 14:52:50,346 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:52:50,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 14:52:50,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 14:52:50,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-12-02 14:52:50,346 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 22 states. [2018-12-02 14:52:50,996 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2018-12-02 14:52:51,199 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2018-12-02 14:52:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:51,534 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-02 14:52:51,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:52:51,535 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-12-02 14:52:51,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:51,535 INFO L225 Difference]: With dead ends: 44 [2018-12-02 14:52:51,535 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 14:52:51,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=210, Invalid=1512, Unknown=0, NotChecked=0, Total=1722 [2018-12-02 14:52:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 14:52:51,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-02 14:52:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 14:52:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-02 14:52:51,537 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 26 [2018-12-02 14:52:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:51,537 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-02 14:52:51,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 14:52:51,538 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-02 14:52:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 14:52:51,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:51,538 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:51,538 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:51,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:51,538 INFO L82 PathProgramCache]: Analyzing trace with hash -165212007, now seen corresponding path program 1 times [2018-12-02 14:52:51,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:51,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:51,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:51,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:51,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:51,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:51,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:51,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:52:51,572 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-02 14:52:51,572 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [25], [30], [34], [38], [41], [42], [56], [57], [59], [64], [66], [71], [77], [78], [79], [81] [2018-12-02 14:52:51,573 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:52:51,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:52:51,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:52:51,602 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Merged at 8 different actions 8 times. Never widened. Performed 276 root evaluator evaluations with a maximum evaluation depth of 3. Performed 276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-02 14:52:51,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:51,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:52:51,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:51,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/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:52:51,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:51,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:52:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:51,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:51,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:52:51,652 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 8 treesize of output 6 [2018-12-02 14:52:51,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:51,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:51,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-02 14:52:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:51,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:52:51,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 14:52:51,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:52:51,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:52:51,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:52:51,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:52:51,693 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 6 states. [2018-12-02 14:52:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:51,736 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-02 14:52:51,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:52:51,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-02 14:52:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:51,737 INFO L225 Difference]: With dead ends: 42 [2018-12-02 14:52:51,737 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 14:52:51,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:52:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 14:52:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-12-02 14:52:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 14:52:51,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-02 14:52:51,739 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 28 [2018-12-02 14:52:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:51,739 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-02 14:52:51,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:52:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-02 14:52:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 14:52:51,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:51,740 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:51,740 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:51,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:51,740 INFO L82 PathProgramCache]: Analyzing trace with hash 144774170, now seen corresponding path program 1 times [2018-12-02 14:52:51,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:51,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:51,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:51,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:51,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:51,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:51,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:52:51,805 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-02 14:52:51,805 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [25], [30], [34], [38], [41], [42], [47], [48], [51], [54], [56], [57], [64], [66], [71], [77], [78], [79], [81] [2018-12-02 14:52:51,806 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:52:51,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:52:51,849 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:52:51,849 INFO L272 AbstractInterpreter]: Visited 27 different actions 38 times. Merged at 11 different actions 11 times. Never widened. Performed 330 root evaluator evaluations with a maximum evaluation depth of 3. Performed 330 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-12-02 14:52:51,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:51,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:52:51,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:51,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/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:52:51,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:51,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:52:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:51,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:51,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:52:51,930 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2018-12-02 14:52:51,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 14:52:51,936 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 12 treesize of output 10 [2018-12-02 14:52:51,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:51,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:52:51,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2018-12-02 14:52:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:51,983 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:52:51,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 17 [2018-12-02 14:52:51,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:52:51,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:52:51,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:52:51,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:52:51,984 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 7 states. [2018-12-02 14:52:52,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:52,034 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-02 14:52:52,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:52:52,034 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-02 14:52:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:52,034 INFO L225 Difference]: With dead ends: 39 [2018-12-02 14:52:52,034 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 14:52:52,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-12-02 14:52:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 14:52:52,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-02 14:52:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 14:52:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-02 14:52:52,035 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-12-02 14:52:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:52,036 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-02 14:52:52,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:52:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-02 14:52:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 14:52:52,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:52,036 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:52,037 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:52,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:52,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1955399002, now seen corresponding path program 2 times [2018-12-02 14:52:52,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:52,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:52,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:52:52,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:52,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:52,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:52,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:52:52,195 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:52:52,196 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:52:52,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:52,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/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:52:52,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:52:52,201 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:52:52,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 14:52:52,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:52:52,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:52,229 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:52:52,231 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:52:52,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,240 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:52:52,241 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,248 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-12-02 14:52:52,269 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 16 treesize of output 13 [2018-12-02 14:52:52,271 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:52:52,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,278 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:52:52,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-02 14:52:52,303 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 29 treesize of output 30 [2018-12-02 14:52:52,305 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:52:52,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,315 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:52:52,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2018-12-02 14:52:52,466 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 34 treesize of output 32 [2018-12-02 14:52:52,471 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 18 treesize of output 15 [2018-12-02 14:52:52,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:52:52,477 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 10 treesize of output 1 [2018-12-02 14:52:52,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:52:52,489 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:52:52,489 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:58, output treesize:37 [2018-12-02 14:52:52,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 14:52:52,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:52:52,759 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-12-02 14:52:52,772 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:52:52,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,779 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 19 treesize of output 15 [2018-12-02 14:52:52,781 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 15 treesize of output 10 [2018-12-02 14:52:52,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:52,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:52:52,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:52:52,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:200 [2018-12-02 14:52:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 14:52:52,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:52:52,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 27 [2018-12-02 14:52:52,917 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:52:52,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-02 14:52:52,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-02 14:52:52,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-12-02 14:52:52,918 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 20 states. [2018-12-02 14:52:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:53,808 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-12-02 14:52:53,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 14:52:53,808 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2018-12-02 14:52:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:53,809 INFO L225 Difference]: With dead ends: 38 [2018-12-02 14:52:53,809 INFO L226 Difference]: Without dead ends: 38 [2018-12-02 14:52:53,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 14:52:53,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-02 14:52:53,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-12-02 14:52:53,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 14:52:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-02 14:52:53,810 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-02 14:52:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:53,811 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-02 14:52:53,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-02 14:52:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-02 14:52:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 14:52:53,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:53,811 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:53,811 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:53,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:53,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2057235333, now seen corresponding path program 2 times [2018-12-02 14:52:53,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:53,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:53,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:52:53,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:53,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:54,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:54,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:52:54,165 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:52:54,165 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:52:54,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:54,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/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:52:54,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:52:54,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:52:54,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 14:52:54,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:52:54,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:54,198 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:52:54,205 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:52:54,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:52:54,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:52:54,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:52:54,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:28 [2018-12-02 14:52:54,247 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:52:54,248 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:52:54,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,253 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:52:54,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-12-02 14:52:54,468 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 33 treesize of output 33 [2018-12-02 14:52:54,470 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 29 treesize of output 22 [2018-12-02 14:52:54,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:54,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2018-12-02 14:52:54,491 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 14:52:54,507 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 22 treesize of output 20 [2018-12-02 14:52:54,507 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 14:52:54,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:52:54,526 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:52:54,526 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:105 [2018-12-02 14:52:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:54,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:52:55,023 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 30 treesize of output 32 [2018-12-02 14:52:55,047 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 28 treesize of output 18 [2018-12-02 14:52:55,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:55,056 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 25 treesize of output 15 [2018-12-02 14:52:55,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:55,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:55,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:52:55,068 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:77, output treesize:97 [2018-12-02 14:52:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:55,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:52:55,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 40 [2018-12-02 14:52:55,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:52:55,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-02 14:52:55,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-02 14:52:55,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1504, Unknown=0, NotChecked=0, Total=1640 [2018-12-02 14:52:55,145 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 29 states. [2018-12-02 14:52:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:52:56,075 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-12-02 14:52:56,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 14:52:56,076 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2018-12-02 14:52:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:52:56,076 INFO L225 Difference]: With dead ends: 44 [2018-12-02 14:52:56,076 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 14:52:56,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=299, Invalid=2671, Unknown=0, NotChecked=0, Total=2970 [2018-12-02 14:52:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 14:52:56,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-12-02 14:52:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 14:52:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-02 14:52:56,079 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 34 [2018-12-02 14:52:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:52:56,079 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-02 14:52:56,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-02 14:52:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-02 14:52:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-02 14:52:56,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:52:56,079 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:52:56,080 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION]=== [2018-12-02 14:52:56,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:52:56,080 INFO L82 PathProgramCache]: Analyzing trace with hash -219963682, now seen corresponding path program 3 times [2018-12-02 14:52:56,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:52:56,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:56,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:52:56,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:52:56,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:52:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:52:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:56,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:56,356 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:52:56,356 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:52:56,356 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:52:56,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:52:56,356 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:52:56,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:52:56,364 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:52:56,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:52:56,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:52:56,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:52:56,391 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:52:56,403 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:52:56,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:52:56,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 14:52:56,419 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:52:56,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-02 14:52:56,439 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 15 treesize of output 12 [2018-12-02 14:52:56,441 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:52:56,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:56,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:56,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:52:56,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-02 14:52:56,644 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 32 treesize of output 32 [2018-12-02 14:52:56,649 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 28 treesize of output 26 [2018-12-02 14:52:56,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 14:52:56,662 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 20 treesize of output 15 [2018-12-02 14:52:56,662 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:56,664 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 15 treesize of output 8 [2018-12-02 14:52:56,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 14:52:56,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-12-02 14:52:56,686 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 14:52:56,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 14:52:56,705 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:52:56,705 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-12-02 14:52:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:52:56,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:52:57,998 WARN L180 SmtUtils]: Spent 902.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-02 14:53:00,739 WARN L180 SmtUtils]: Spent 2.70 s on a formula simplification that was a NOOP. DAG size: 50 [2018-12-02 14:53:00,903 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 32 treesize of output 34 [2018-12-02 14:53:00,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 treesize of output 15 [2018-12-02 14:53:00,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 14:53:00,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 14:53:00,940 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:53:00,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:35 [2018-12-02 14:53:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:53:01,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:53:01,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 46 [2018-12-02 14:53:01,001 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:53:01,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-02 14:53:01,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 14:53:01,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1935, Unknown=0, NotChecked=0, Total=2162 [2018-12-02 14:53:01,002 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 31 states. [2018-12-02 14:53:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:53:01,969 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-02 14:53:01,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 14:53:01,969 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 42 [2018-12-02 14:53:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:53:01,970 INFO L225 Difference]: With dead ends: 43 [2018-12-02 14:53:01,970 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 14:53:01,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=758, Invalid=4072, Unknown=0, NotChecked=0, Total=4830 [2018-12-02 14:53:01,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 14:53:01,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 14:53:01,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 14:53:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 14:53:01,971 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-12-02 14:53:01,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:53:01,971 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:53:01,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-02 14:53:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 14:53:01,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 14:53:01,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:53:01 BoogieIcfgContainer [2018-12-02 14:53:01,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:53:01,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:53:01,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:53:01,974 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:53:01,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:52:46" (3/4) ... [2018-12-02 14:53:01,976 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 14:53:01,979 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 14:53:01,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 14:53:01,980 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncmp [2018-12-02 14:53:01,982 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-12-02 14:53:01,982 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 14:53:01,982 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 14:53:02,006 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e7bc7df1-a700-4e01-a768-c7dc733fffe4/bin-2019/utaipan/witness.graphml [2018-12-02 14:53:02,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:53:02,007 INFO L168 Benchmark]: Toolchain (without parser) took 15971.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.7 MB). Free memory was 948.1 MB in the beginning and 1.2 GB in the end (delta: -301.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:53:02,007 INFO L168 Benchmark]: CDTParser took 0.18 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:53:02,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:53:02,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.60 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:53:02,008 INFO L168 Benchmark]: Boogie Preprocessor took 15.53 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:53:02,008 INFO L168 Benchmark]: RCFGBuilder took 191.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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:53:02,008 INFO L168 Benchmark]: TraceAbstraction took 15403.41 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -182.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:53:02,008 INFO L168 Benchmark]: Witness Printer took 32.45 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:53:02,009 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.18 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 308.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.60 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.53 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 191.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: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15403.41 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 151.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -182.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 32.45 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: 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: 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: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: 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: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: 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, 50 locations, 15 error locations. SAFE Result, 15.3s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 593 SDtfs, 844 SDslu, 2183 SDs, 0 SdLazy, 2287 SolverSat, 164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 676 GetRequests, 331 SyntacticMatches, 11 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2022 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 31 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 669 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 850 ConstructedInterpolants, 109 QuantifiedInterpolants, 332648 SizeOfPredicates, 115 NumberOfNonLiveVariables, 1206 ConjunctsInSsa, 277 ConjunctsInUnsatCore, 35 InterpolantComputations, 16 PerfectInterpolantSequences, 45/211 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...