./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/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_a48a4206-0680-4ead-9933-77498fc8b39f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/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 60847b137b78d6fc8305d5c5fcc8bf5228130e36 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:29:00,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:29:00,495 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:29:00,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:29:00,501 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:29:00,501 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:29:00,502 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:29:00,503 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:29:00,503 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:29:00,504 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:29:00,504 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:29:00,504 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:29:00,505 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:29:00,505 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:29:00,506 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:29:00,506 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:29:00,507 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:29:00,507 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:29:00,508 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:29:00,509 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:29:00,509 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:29:00,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:29:00,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:29:00,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:29:00,511 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:29:00,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:29:00,512 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:29:00,513 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:29:00,513 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:29:00,514 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:29:00,514 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:29:00,514 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:29:00,514 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:29:00,515 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:29:00,515 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:29:00,515 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:29:00,516 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 19:29:00,523 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:29:00,523 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:29:00,523 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:29:00,523 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:29:00,523 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:29:00,524 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:29:00,524 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:29:00,524 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:29:00,524 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:29:00,524 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:29:00,524 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:29:00,524 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:29:00,524 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:29:00,525 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 19:29:00,525 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 19:29:00,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:29:00,525 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:29:00,525 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 19:29:00,525 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:29:00,525 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:29:00,525 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:29:00,525 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 19:29:00,525 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 19:29:00,525 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 19:29:00,526 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:29:00,526 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:29:00,526 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:29:00,526 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:29:00,526 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:29:00,526 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:29:00,526 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:29:00,526 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:29:00,526 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:29:00,526 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:29:00,526 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:29:00,527 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:29:00,527 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_a48a4206-0680-4ead-9933-77498fc8b39f/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 -> 60847b137b78d6fc8305d5c5fcc8bf5228130e36 [2018-12-09 19:29:00,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:29:00,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:29:00,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:29:00,552 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:29:00,553 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:29:00,553 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 19:29:00,588 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/bin-2019/utaipan/data/b11607fe4/1aaf4fff8cd94d9b921a404086e2f668/FLAG451c4833f [2018-12-09 19:29:00,983 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:29:00,983 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/sv-benchmarks/c/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 19:29:00,989 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/bin-2019/utaipan/data/b11607fe4/1aaf4fff8cd94d9b921a404086e2f668/FLAG451c4833f [2018-12-09 19:29:00,997 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/bin-2019/utaipan/data/b11607fe4/1aaf4fff8cd94d9b921a404086e2f668 [2018-12-09 19:29:00,998 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:29:00,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:29:00,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:29:01,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:29:01,001 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:29:01,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:29:00" (1/1) ... [2018-12-09 19:29:01,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ef7631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01, skipping insertion in model container [2018-12-09 19:29:01,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:29:00" (1/1) ... [2018-12-09 19:29:01,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:29:01,026 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:29:01,167 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:29:01,207 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:29:01,239 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:29:01,258 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:29:01,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01 WrapperNode [2018-12-09 19:29:01,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:29:01,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:29:01,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:29:01,259 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:29:01,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01" (1/1) ... [2018-12-09 19:29:01,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01" (1/1) ... [2018-12-09 19:29:01,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:29:01,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:29:01,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:29:01,277 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:29:01,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01" (1/1) ... [2018-12-09 19:29:01,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01" (1/1) ... [2018-12-09 19:29:01,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01" (1/1) ... [2018-12-09 19:29:01,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01" (1/1) ... [2018-12-09 19:29:01,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01" (1/1) ... [2018-12-09 19:29:01,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01" (1/1) ... [2018-12-09 19:29:01,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01" (1/1) ... [2018-12-09 19:29:01,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:29:01,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:29:01,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:29:01,293 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:29:01,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/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-09 19:29:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:29:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 19:29:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:29:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 19:29:01,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 19:29:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 19:29:01,323 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 19:29:01,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:29:01,324 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-12-09 19:29:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-12-09 19:29:01,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:29:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:29:01,511 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:29:01,511 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 19:29:01,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:29:01 BoogieIcfgContainer [2018-12-09 19:29:01,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:29:01,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:29:01,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:29:01,515 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:29:01,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:29:00" (1/3) ... [2018-12-09 19:29:01,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7b0710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:29:01, skipping insertion in model container [2018-12-09 19:29:01,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:29:01" (2/3) ... [2018-12-09 19:29:01,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a7b0710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:29:01, skipping insertion in model container [2018-12-09 19:29:01,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:29:01" (3/3) ... [2018-12-09 19:29:01,517 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 19:29:01,525 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:29:01,532 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 19:29:01,541 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 19:29:01,561 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:29:01,561 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 19:29:01,561 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:29:01,561 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:29:01,561 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:29:01,561 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:29:01,561 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:29:01,561 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:29:01,573 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-12-09 19:29:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 19:29:01,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:01,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:01,580 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:01,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:01,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1956342163, now seen corresponding path program 1 times [2018-12-09 19:29:01,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:01,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:01,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:01,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:01,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:01,685 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-09 19:29:01,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:01,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:29:01,687 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:01,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:29:01,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:29:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:29:01,699 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2018-12-09 19:29:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:01,745 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-12-09 19:29:01,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:29:01,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 19:29:01,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:01,751 INFO L225 Difference]: With dead ends: 52 [2018-12-09 19:29:01,752 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 19:29:01,753 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-09 19:29:01,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 19:29:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-09 19:29:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 19:29:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-12-09 19:29:01,774 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 10 [2018-12-09 19:29:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:01,775 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-12-09 19:29:01,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:29:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-12-09 19:29:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 19:29:01,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:01,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:01,775 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:01,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1956342164, now seen corresponding path program 1 times [2018-12-09 19:29:01,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:01,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:01,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:01,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:01,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:01,815 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-09 19:29:01,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:01,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:29:01,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:01,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:29:01,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:29:01,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:29:01,817 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 4 states. [2018-12-09 19:29:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:01,834 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-12-09 19:29:01,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:29:01,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 19:29:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:01,835 INFO L225 Difference]: With dead ends: 48 [2018-12-09 19:29:01,835 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 19:29:01,836 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-09 19:29:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 19:29:01,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-09 19:29:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 19:29:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-12-09 19:29:01,838 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 10 [2018-12-09 19:29:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:01,838 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-12-09 19:29:01,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:29:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-12-09 19:29:01,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 19:29:01,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:01,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:01,839 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:01,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:01,839 INFO L82 PathProgramCache]: Analyzing trace with hash 517064901, now seen corresponding path program 1 times [2018-12-09 19:29:01,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:01,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:01,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:01,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:01,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:01,860 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-09 19:29:01,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:01,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 19:29:01,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:01,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:29:01,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:29:01,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:29:01,861 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 3 states. [2018-12-09 19:29:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:01,877 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-12-09 19:29:01,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:29:01,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 19:29:01,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:01,878 INFO L225 Difference]: With dead ends: 47 [2018-12-09 19:29:01,878 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 19:29:01,878 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-09 19:29:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 19:29:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-09 19:29:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 19:29:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-12-09 19:29:01,881 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 11 [2018-12-09 19:29:01,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:01,881 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-12-09 19:29:01,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:29:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-12-09 19:29:01,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 19:29:01,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:01,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:01,881 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:01,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:01,882 INFO L82 PathProgramCache]: Analyzing trace with hash 517064902, now seen corresponding path program 1 times [2018-12-09 19:29:01,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:01,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:01,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:01,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:01,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:01,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:01,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:29:01,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:01,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:29:01,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:29:01,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:29:01,908 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2018-12-09 19:29:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:01,921 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-12-09 19:29:01,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:29:01,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 19:29:01,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:01,922 INFO L225 Difference]: With dead ends: 46 [2018-12-09 19:29:01,922 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 19:29:01,922 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-09 19:29:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 19:29:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-09 19:29:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 19:29:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-12-09 19:29:01,925 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 11 [2018-12-09 19:29:01,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:01,925 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-12-09 19:29:01,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:29:01,925 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-12-09 19:29:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 19:29:01,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:01,925 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-09 19:29:01,925 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:01,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:01,926 INFO L82 PathProgramCache]: Analyzing trace with hash 97684603, now seen corresponding path program 1 times [2018-12-09 19:29:01,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:01,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:01,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:01,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:01,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:01,962 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-09 19:29:01,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:01,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:29:01,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:01,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:29:01,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:29:01,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:29:01,963 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 5 states. [2018-12-09 19:29:02,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:02,005 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-12-09 19:29:02,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:29:02,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 19:29:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:02,006 INFO L225 Difference]: With dead ends: 43 [2018-12-09 19:29:02,006 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 19:29:02,006 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-09 19:29:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 19:29:02,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 19:29:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 19:29:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-12-09 19:29:02,010 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 18 [2018-12-09 19:29:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:02,010 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-12-09 19:29:02,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:29:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-12-09 19:29:02,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 19:29:02,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:02,011 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-09 19:29:02,011 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:02,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:02,011 INFO L82 PathProgramCache]: Analyzing trace with hash 97684604, now seen corresponding path program 1 times [2018-12-09 19:29:02,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:02,081 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-09 19:29:02,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:02,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:29:02,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:02,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:29:02,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:29:02,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:29:02,083 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 7 states. [2018-12-09 19:29:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:02,141 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-12-09 19:29:02,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:29:02,141 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-09 19:29:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:02,144 INFO L225 Difference]: With dead ends: 65 [2018-12-09 19:29:02,144 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 19:29:02,144 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-09 19:29:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 19:29:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2018-12-09 19:29:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 19:29:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2018-12-09 19:29:02,148 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 18 [2018-12-09 19:29:02,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:02,149 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2018-12-09 19:29:02,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:29:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2018-12-09 19:29:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 19:29:02,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:02,150 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-09 19:29:02,150 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:02,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:02,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1266097387, now seen corresponding path program 1 times [2018-12-09 19:29:02,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:02,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:02,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:02,185 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-09 19:29:02,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:02,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:29:02,186 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:02,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:29:02,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:29:02,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:29:02,186 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand 4 states. [2018-12-09 19:29:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:02,232 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-12-09 19:29:02,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:29:02,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-09 19:29:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:02,233 INFO L225 Difference]: With dead ends: 51 [2018-12-09 19:29:02,233 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 19:29:02,234 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-09 19:29:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 19:29:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 19:29:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 19:29:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-12-09 19:29:02,236 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 19 [2018-12-09 19:29:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:02,236 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-12-09 19:29:02,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:29:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-12-09 19:29:02,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 19:29:02,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:02,237 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-09 19:29:02,237 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:02,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1266744586, now seen corresponding path program 1 times [2018-12-09 19:29:02,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:02,281 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-09 19:29:02,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:02,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:29:02,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:02,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:29:02,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:29:02,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:29:02,283 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 7 states. [2018-12-09 19:29:02,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:02,330 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-12-09 19:29:02,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:29:02,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-09 19:29:02,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:02,331 INFO L225 Difference]: With dead ends: 50 [2018-12-09 19:29:02,331 INFO L226 Difference]: Without dead ends: 50 [2018-12-09 19:29:02,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:29:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-09 19:29:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-12-09 19:29:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 19:29:02,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-09 19:29:02,333 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 19 [2018-12-09 19:29:02,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:02,334 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-09 19:29:02,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:29:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-09 19:29:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 19:29:02,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:02,334 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-09 19:29:02,334 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:02,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:02,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1266744587, now seen corresponding path program 1 times [2018-12-09 19:29:02,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:02,361 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-09 19:29:02,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:02,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:29:02,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:02,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:29:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:29:02,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:29:02,362 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 5 states. [2018-12-09 19:29:02,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:02,387 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-12-09 19:29:02,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:29:02,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-09 19:29:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:02,388 INFO L225 Difference]: With dead ends: 44 [2018-12-09 19:29:02,388 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 19:29:02,388 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-09 19:29:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 19:29:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 19:29:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 19:29:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-12-09 19:29:02,390 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 19 [2018-12-09 19:29:02,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:02,390 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-12-09 19:29:02,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:29:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-12-09 19:29:02,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 19:29:02,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:02,391 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:02,391 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:02,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2071887360, now seen corresponding path program 1 times [2018-12-09 19:29:02,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:02,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:02,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:02,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:29:02,407 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:02,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:29:02,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:29:02,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:29:02,408 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 3 states. [2018-12-09 19:29:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:02,412 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-09 19:29:02,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:29:02,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 19:29:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:02,414 INFO L225 Difference]: With dead ends: 43 [2018-12-09 19:29:02,414 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 19:29:02,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:29:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 19:29:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 19:29:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 19:29:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-12-09 19:29:02,417 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 23 [2018-12-09 19:29:02,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:02,417 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-12-09 19:29:02,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:29:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-12-09 19:29:02,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 19:29:02,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:02,418 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-09 19:29:02,418 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:02,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:02,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1482519971, now seen corresponding path program 1 times [2018-12-09 19:29:02,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:02,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:02,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:02,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:29:02,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:29:02,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:02,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:29:02,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:29:02,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:29:02,439 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 3 states. [2018-12-09 19:29:02,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:02,443 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-09 19:29:02,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:29:02,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 19:29:02,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:02,444 INFO L225 Difference]: With dead ends: 43 [2018-12-09 19:29:02,444 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 19:29:02,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:29:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 19:29:02,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 19:29:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 19:29:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-12-09 19:29:02,446 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 26 [2018-12-09 19:29:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:02,446 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-12-09 19:29:02,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:29:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-12-09 19:29:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:29:02,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:02,447 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, 1, 1] [2018-12-09 19:29:02,447 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:02,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash 344318600, now seen corresponding path program 1 times [2018-12-09 19:29:02,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:02,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:02,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:02,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:02,874 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-09 19:29:02,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:02,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:29:02,875 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-09 19:29:02,876 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [8], [16], [18], [19], [22], [25], [30], [34], [39], [42], [43], [45], [46], [49], [57], [62], [63], [66], [71], [91], [92], [93], [95] [2018-12-09 19:29:02,897 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:29:02,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:29:02,999 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:29:03,000 INFO L272 AbstractInterpreter]: Visited 26 different actions 26 times. Never merged. Never widened. Performed 204 root evaluator evaluations with a maximum evaluation depth of 3. Performed 204 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-12-09 19:29:03,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:03,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:29:03,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:03,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/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-09 19:29:03,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:03,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:29:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:03,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:29:03,076 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-09 19:29:03,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 19:29:03,107 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-09 19:29:03,109 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-09 19:29:03,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,115 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-09 19:29:03,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 19:29:03,150 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-09 19:29:03,151 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-09 19:29:03,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,161 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-09 19:29:03,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:31 [2018-12-09 19:29:03,280 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 28 treesize of output 26 [2018-12-09 19:29:03,283 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 19:29:03,283 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 0 case distinctions, treesize of input 14 treesize of output 10 [2018-12-09 19:29:03,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,292 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-09 19:29:03,292 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,300 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:38, output treesize:3 [2018-12-09 19:29:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:03,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:29:03,452 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-09 19:29:03,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 19:29:03,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:03,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:3 [2018-12-09 19:29:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:03,488 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 19:29:03,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [14] total 25 [2018-12-09 19:29:03,489 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:29:03,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:29:03,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:29:03,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2018-12-09 19:29:03,489 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 10 states. [2018-12-09 19:29:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:03,673 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-09 19:29:03,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:29:03,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-12-09 19:29:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:03,674 INFO L225 Difference]: With dead ends: 60 [2018-12-09 19:29:03,674 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 19:29:03,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2018-12-09 19:29:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 19:29:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-09 19:29:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 19:29:03,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-12-09 19:29:03,676 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 28 [2018-12-09 19:29:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:03,676 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-09 19:29:03,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:29:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-12-09 19:29:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 19:29:03,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:03,677 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, 1, 1] [2018-12-09 19:29:03,677 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:03,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:03,677 INFO L82 PathProgramCache]: Analyzing trace with hash 563173318, now seen corresponding path program 1 times [2018-12-09 19:29:03,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:03,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:03,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:03,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:03,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:03,953 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-09 19:29:03,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:03,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:29:03,953 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-09 19:29:03,953 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [25], [30], [34], [39], [42], [43], [45], [46], [49], [57], [62], [63], [66], [71], [91], [92], [93], [95] [2018-12-09 19:29:03,955 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:29:03,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:29:03,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:29:03,994 INFO L272 AbstractInterpreter]: Visited 26 different actions 26 times. Never merged. Never widened. Performed 202 root evaluator evaluations with a maximum evaluation depth of 3. Performed 202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-12-09 19:29:03,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:03,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:29:03,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:03,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/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-09 19:29:04,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:04,012 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:29:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:04,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:29:04,031 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-09 19:29:04,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:04,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:04,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 19:29:04,054 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-09 19:29:04,055 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-09 19:29:04,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:04,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:04,061 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-09 19:29:04,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 19:29:04,095 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-09 19:29:04,097 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-09 19:29:04,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:04,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:04,107 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-09 19:29:04,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 19:29:04,256 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 28 treesize of output 26 [2018-12-09 19:29:04,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-12-09 19:29:04,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 19:29:04,271 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-09 19:29:04,271 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:04,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:29:04,284 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-09 19:29:04,284 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-12-09 19:29:04,349 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-09 19:29:04,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:29:04,769 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-09 19:29:04,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:04,775 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-09 19:29:04,782 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-09 19:29:04,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:04,783 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:04,788 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-09 19:29:04,789 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-09 19:29:04,793 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-09 19:29:04,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:29:04,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 30 [2018-12-09 19:29:04,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:29:04,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 19:29:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 19:29:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2018-12-09 19:29:04,809 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 24 states. [2018-12-09 19:29:05,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:05,448 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-09 19:29:05,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:29:05,448 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2018-12-09 19:29:05,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:05,449 INFO L225 Difference]: With dead ends: 60 [2018-12-09 19:29:05,449 INFO L226 Difference]: Without dead ends: 60 [2018-12-09 19:29:05,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=188, Invalid=1294, Unknown=0, NotChecked=0, Total=1482 [2018-12-09 19:29:05,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-09 19:29:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-12-09 19:29:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 19:29:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-12-09 19:29:05,455 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 28 [2018-12-09 19:29:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:05,455 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-12-09 19:29:05,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 19:29:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-12-09 19:29:05,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 19:29:05,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:05,457 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] [2018-12-09 19:29:05,457 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:05,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:05,458 INFO L82 PathProgramCache]: Analyzing trace with hash 278503660, now seen corresponding path program 1 times [2018-12-09 19:29:05,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:05,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:05,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:05,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:05,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:05,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:05,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:29:05,655 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-12-09 19:29:05,655 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [25], [30], [34], [39], [42], [43], [46], [48], [49], [57], [62], [63], [66], [71], [91], [92], [93], [95] [2018-12-09 19:29:05,656 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 19:29:05,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 19:29:05,679 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 19:29:05,679 INFO L272 AbstractInterpreter]: Visited 26 different actions 26 times. Never merged. Never widened. Performed 202 root evaluator evaluations with a maximum evaluation depth of 3. Performed 202 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-12-09 19:29:05,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:05,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 19:29:05,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:05,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/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-09 19:29:05,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:05,694 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 19:29:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:05,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:29:05,710 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-09 19:29:05,712 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-09 19:29:05,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:05,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:05,719 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-09 19:29:05,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 19:29:05,922 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 29 treesize of output 29 [2018-12-09 19:29:05,932 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 21 treesize of output 23 [2018-12-09 19:29:05,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 19:29:05,942 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 25 treesize of output 18 [2018-12-09 19:29:05,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:05,954 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 16 [2018-12-09 19:29:05,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 19:29:05,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 19:29:05,975 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-09 19:29:05,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:33 [2018-12-09 19:29:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:06,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:29:06,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 19:29:06,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:06,348 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-09 19:29:06,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-12-09 19:29:06,371 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:06,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-12-09 19:29:06,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:06,388 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-09 19:29:06,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:06,391 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:06,397 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-09 19:29:06,397 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-12-09 19:29:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:06,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:29:06,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2018-12-09 19:29:06,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:29:06,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 19:29:06,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 19:29:06,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 19:29:06,418 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 23 states. [2018-12-09 19:29:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:07,164 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-12-09 19:29:07,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:29:07,164 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-12-09 19:29:07,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:07,165 INFO L225 Difference]: With dead ends: 58 [2018-12-09 19:29:07,165 INFO L226 Difference]: Without dead ends: 54 [2018-12-09 19:29:07,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=260, Invalid=1546, Unknown=0, NotChecked=0, Total=1806 [2018-12-09 19:29:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-09 19:29:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-12-09 19:29:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-09 19:29:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-09 19:29:07,168 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 29 [2018-12-09 19:29:07,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:07,168 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-09 19:29:07,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 19:29:07,168 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-09 19:29:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 19:29:07,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:07,169 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:07,169 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:07,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:07,169 INFO L82 PathProgramCache]: Analyzing trace with hash 2124323154, now seen corresponding path program 2 times [2018-12-09 19:29:07,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:07,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:07,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:29:07,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:07,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:07,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:07,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:07,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:29:07,381 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:29:07,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:29:07,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:07,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/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-09 19:29:07,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:29:07,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 19:29:07,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 19:29:07,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:29:07,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:29:07,415 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-09 19:29:07,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,419 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-09 19:29:07,422 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-09 19:29:07,422 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,431 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-12-09 19:29:07,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 19:29:07,446 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-09 19:29:07,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-12-09 19:29:07,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-12-09 19:29:07,470 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-09 19:29:07,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,478 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-09 19:29:07,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-12-09 19:29:07,537 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 31 treesize of output 29 [2018-12-09 19:29:07,538 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-09 19:29:07,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 19:29:07,546 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 19:29:07,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:29:07,559 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-09 19:29:07,559 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-12-09 19:29:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:29:07,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:29:07,802 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-09 19:29:07,809 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-09 19:29:07,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:07,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-12-09 19:29:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 19:29:07,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:29:07,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2018-12-09 19:29:07,863 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:29:07,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 19:29:07,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 19:29:07,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2018-12-09 19:29:07,864 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 19 states. [2018-12-09 19:29:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:08,702 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-12-09 19:29:08,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:29:08,702 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-12-09 19:29:08,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:08,702 INFO L225 Difference]: With dead ends: 51 [2018-12-09 19:29:08,703 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 19:29:08,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=216, Invalid=1190, Unknown=0, NotChecked=0, Total=1406 [2018-12-09 19:29:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 19:29:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-12-09 19:29:08,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 19:29:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-12-09 19:29:08,705 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 38 [2018-12-09 19:29:08,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:08,706 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-12-09 19:29:08,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 19:29:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-12-09 19:29:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 19:29:08,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:29:08,706 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:29:08,707 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION]=== [2018-12-09 19:29:08,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:29:08,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1429508320, now seen corresponding path program 2 times [2018-12-09 19:29:08,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:29:08,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:08,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:29:08,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:29:08,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:29:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:29:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:29:08,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:08,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 19:29:08,967 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 19:29:08,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 19:29:08,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 19:29:08,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/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-09 19:29:08,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 19:29:08,974 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 19:29:08,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 19:29:08,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 19:29:08,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 19:29:08,995 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-09 19:29:09,001 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-09 19:29:09,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 19:29:09,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 19:29:09,017 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-09 19:29:09,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 19:29:09,030 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-09 19:29:09,031 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-09 19:29:09,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:09,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:09,035 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-09 19:29:09,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-12-09 19:29:09,230 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-09 19:29:09,233 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 27 treesize of output 20 [2018-12-09 19:29:09,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:09,251 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 27 [2018-12-09 19:29:09,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 19:29:09,263 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 20 treesize of output 18 [2018-12-09 19:29:09,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 19:29:09,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 19:29:09,282 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-09 19:29:09,282 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:39 [2018-12-09 19:29:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:29:09,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 19:29:09,702 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-09 19:29:09,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-12-09 19:29:09,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:09,739 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 16 treesize of output 14 [2018-12-09 19:29:09,739 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:09,759 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-09 19:29:09,759 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 19:29:09,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:09,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 19:29:09,770 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:73, output treesize:43 [2018-12-09 19:29:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 19:29:09,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 19:29:09,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2018-12-09 19:29:09,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 19:29:09,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-09 19:29:09,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-09 19:29:09,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1150, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 19:29:09,825 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 25 states. [2018-12-09 19:29:10,967 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2018-12-09 19:29:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:29:11,536 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-12-09 19:29:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-09 19:29:11,536 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 39 [2018-12-09 19:29:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:29:11,537 INFO L225 Difference]: With dead ends: 49 [2018-12-09 19:29:11,537 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 19:29:11,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=492, Invalid=3048, Unknown=0, NotChecked=0, Total=3540 [2018-12-09 19:29:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 19:29:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 19:29:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 19:29:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 19:29:11,538 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-12-09 19:29:11,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:29:11,538 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 19:29:11,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-09 19:29:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 19:29:11,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 19:29:11,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:29:11 BoogieIcfgContainer [2018-12-09 19:29:11,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:29:11,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:29:11,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:29:11,541 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:29:11,541 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:29:01" (3/4) ... [2018-12-09 19:29:11,543 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 19:29:11,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 19:29:11,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 19:29:11,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncmp [2018-12-09 19:29:11,549 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-12-09 19:29:11,550 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 19:29:11,550 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 19:29:11,578 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a48a4206-0680-4ead-9933-77498fc8b39f/bin-2019/utaipan/witness.graphml [2018-12-09 19:29:11,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:29:11,578 INFO L168 Benchmark]: Toolchain (without parser) took 10579.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 948.1 MB in the beginning and 938.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 221.0 MB. Max. memory is 11.5 GB. [2018-12-09 19:29:11,579 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:29:11,579 INFO L168 Benchmark]: CACSL2BoogieTranslator took 259.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:29:11,579 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.42 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-09 19:29:11,579 INFO L168 Benchmark]: Boogie Preprocessor took 15.76 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-09 19:29:11,579 INFO L168 Benchmark]: RCFGBuilder took 218.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-09 19:29:11,579 INFO L168 Benchmark]: TraceAbstraction took 10028.78 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 114.8 MB). Free memory was 1.1 GB in the beginning and 946.1 MB in the end (delta: 112.1 MB). Peak memory consumption was 227.0 MB. Max. memory is 11.5 GB. [2018-12-09 19:29:11,579 INFO L168 Benchmark]: Witness Printer took 36.89 ms. Allocated memory is still 1.2 GB. Free memory was 946.1 MB in the beginning and 938.4 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:29:11,581 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 259.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -137.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.42 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.76 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 218.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10028.78 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 114.8 MB). Free memory was 1.1 GB in the beginning and 946.1 MB in the end (delta: 112.1 MB). Peak memory consumption was 227.0 MB. Max. memory is 11.5 GB. * Witness Printer took 36.89 ms. Allocated memory is still 1.2 GB. Free memory was 946.1 MB in the beginning and 938.4 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 566]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: 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: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 545]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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, 53 locations, 15 error locations. SAFE Result, 9.9s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 566 SDtfs, 872 SDslu, 1993 SDs, 0 SdLazy, 1780 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 251 SyntacticMatches, 10 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 508 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 644 ConstructedInterpolants, 134 QuantifiedInterpolants, 282583 SizeOfPredicates, 88 NumberOfNonLiveVariables, 775 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 26 InterpolantComputations, 13 PerfectInterpolantSequences, 38/137 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...