./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2d654b7b73105d319f19561f723c76c3f2a6a70 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 18:02:01,218 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 18:02:01,219 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 18:02:01,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 18:02:01,225 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 18:02:01,226 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 18:02:01,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 18:02:01,227 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 18:02:01,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 18:02:01,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 18:02:01,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 18:02:01,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 18:02:01,229 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 18:02:01,230 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 18:02:01,230 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 18:02:01,231 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 18:02:01,231 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 18:02:01,232 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 18:02:01,233 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 18:02:01,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 18:02:01,234 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 18:02:01,235 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 18:02:01,236 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 18:02:01,236 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 18:02:01,236 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 18:02:01,237 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 18:02:01,237 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 18:02:01,238 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 18:02:01,238 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 18:02:01,238 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 18:02:01,239 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 18:02:01,239 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 18:02:01,239 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 18:02:01,239 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 18:02:01,240 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 18:02:01,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 18:02:01,240 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-12-09 18:02:01,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 18:02:01,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 18:02:01,248 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 18:02:01,248 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 18:02:01,248 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 18:02:01,248 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 18:02:01,248 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 18:02:01,248 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 18:02:01,248 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 18:02:01,249 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 18:02:01,249 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 18:02:01,249 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 18:02:01,249 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 18:02:01,249 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 18:02:01,249 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 18:02:01,249 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 18:02:01,249 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 18:02:01,249 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 18:02:01,249 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 18:02:01,250 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 18:02:01,250 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 18:02:01,250 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 18:02:01,250 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 18:02:01,250 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 18:02:01,250 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 18:02:01,250 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 18:02:01,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 18:02:01,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 18:02:01,250 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 18:02:01,250 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 18:02:01,250 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:02:01,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 18:02:01,251 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 18:02:01,251 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 18:02:01,251 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 18:02:01,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 18:02:01,251 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_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b2d654b7b73105d319f19561f723c76c3f2a6a70 [2018-12-09 18:02:01,269 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 18:02:01,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 18:02:01,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 18:02:01,281 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 18:02:01,281 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 18:02:01,282 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/../../sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 18:02:01,327 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/data/478c290e2/d352fa1dbec1444aa3fb11d88a9987b0/FLAG11ef72fe6 [2018-12-09 18:02:01,687 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 18:02:01,688 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/sv-benchmarks/c/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 18:02:01,694 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/data/478c290e2/d352fa1dbec1444aa3fb11d88a9987b0/FLAG11ef72fe6 [2018-12-09 18:02:02,056 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/data/478c290e2/d352fa1dbec1444aa3fb11d88a9987b0 [2018-12-09 18:02:02,058 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 18:02:02,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 18:02:02,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 18:02:02,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 18:02:02,062 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 18:02:02,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:02:02" (1/1) ... [2018-12-09 18:02:02,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4834854b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02, skipping insertion in model container [2018-12-09 18:02:02,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:02:02" (1/1) ... [2018-12-09 18:02:02,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 18:02:02,090 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 18:02:02,232 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:02:02,239 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 18:02:02,296 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:02:02,325 INFO L195 MainTranslator]: Completed translation [2018-12-09 18:02:02,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02 WrapperNode [2018-12-09 18:02:02,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 18:02:02,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 18:02:02,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 18:02:02,326 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 18:02:02,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02" (1/1) ... [2018-12-09 18:02:02,338 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02" (1/1) ... [2018-12-09 18:02:02,343 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 18:02:02,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 18:02:02,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 18:02:02,343 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 18:02:02,349 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02" (1/1) ... [2018-12-09 18:02:02,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02" (1/1) ... [2018-12-09 18:02:02,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02" (1/1) ... [2018-12-09 18:02:02,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02" (1/1) ... [2018-12-09 18:02:02,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02" (1/1) ... [2018-12-09 18:02:02,357 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02" (1/1) ... [2018-12-09 18:02:02,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02" (1/1) ... [2018-12-09 18:02:02,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 18:02:02,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 18:02:02,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 18:02:02,360 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 18:02:02,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/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 18:02:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 18:02:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 18:02:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 18:02:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 18:02:02,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 18:02:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 18:02:02,391 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 18:02:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 18:02:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-12-09 18:02:02,392 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-12-09 18:02:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 18:02:02,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 18:02:02,580 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 18:02:02,580 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 18:02:02,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:02:02 BoogieIcfgContainer [2018-12-09 18:02:02,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 18:02:02,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 18:02:02,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 18:02:02,583 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 18:02:02,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:02:02" (1/3) ... [2018-12-09 18:02:02,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618975b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:02:02, skipping insertion in model container [2018-12-09 18:02:02,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:02:02" (2/3) ... [2018-12-09 18:02:02,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618975b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:02:02, skipping insertion in model container [2018-12-09 18:02:02,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:02:02" (3/3) ... [2018-12-09 18:02:02,584 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-12-09 18:02:02,590 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 18:02:02,594 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-12-09 18:02:02,603 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-12-09 18:02:02,617 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 18:02:02,617 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-09 18:02:02,617 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 18:02:02,617 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 18:02:02,617 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 18:02:02,617 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 18:02:02,618 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 18:02:02,618 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 18:02:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-12-09 18:02:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 18:02:02,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:02,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:02,633 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:02,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:02,636 INFO L82 PathProgramCache]: Analyzing trace with hash 471606177, now seen corresponding path program 1 times [2018-12-09 18:02:02,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:02,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:02,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:02,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:02,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:02,746 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 18:02:02,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:02,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 18:02:02,748 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:02,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:02:02,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:02:02,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:02:02,761 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-12-09 18:02:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:02,803 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-09 18:02:02,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:02:02,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 18:02:02,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:02,811 INFO L225 Difference]: With dead ends: 49 [2018-12-09 18:02:02,811 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 18:02:02,812 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 18:02:02,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 18:02:02,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-09 18:02:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 18:02:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-12-09 18:02:02,836 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 10 [2018-12-09 18:02:02,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:02,837 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-12-09 18:02:02,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:02:02,837 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-12-09 18:02:02,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 18:02:02,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:02,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:02,838 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:02,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:02,838 INFO L82 PathProgramCache]: Analyzing trace with hash 471606178, now seen corresponding path program 1 times [2018-12-09 18:02:02,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:02,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:02,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:02,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:02,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:02,885 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 18:02:02,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:02,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:02:02,886 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:02,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:02:02,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:02:02,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:02:02,887 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 4 states. [2018-12-09 18:02:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:02,905 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-12-09 18:02:02,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:02:02,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-09 18:02:02,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:02,906 INFO L225 Difference]: With dead ends: 45 [2018-12-09 18:02:02,906 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 18:02:02,907 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 18:02:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 18:02:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 18:02:02,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 18:02:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-09 18:02:02,911 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2018-12-09 18:02:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:02,911 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-09 18:02:02,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:02:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-09 18:02:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 18:02:02,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:02,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:02,912 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:02,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:02,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1734889591, now seen corresponding path program 1 times [2018-12-09 18:02:02,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:02,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:02,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:02,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:02,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:02,941 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 18:02:02,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:02,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 18:02:02,941 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:02,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:02:02,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:02:02,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:02:02,941 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 3 states. [2018-12-09 18:02:02,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:02,958 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-12-09 18:02:02,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:02:02,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-09 18:02:02,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:02,958 INFO L225 Difference]: With dead ends: 44 [2018-12-09 18:02:02,959 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 18:02:02,959 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 18:02:02,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 18:02:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 18:02:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 18:02:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-09 18:02:02,961 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 11 [2018-12-09 18:02:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:02,961 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-09 18:02:02,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:02:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-09 18:02:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 18:02:02,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:02,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:02,962 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:02,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:02,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1734889592, now seen corresponding path program 1 times [2018-12-09 18:02:02,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:02,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:02,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:02,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:02,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:02,987 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 18:02:02,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:02,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:02:02,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:02,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:02:02,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:02:02,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:02:02,987 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2018-12-09 18:02:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:02,996 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-09 18:02:02,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:02:02,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 18:02:02,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:02,997 INFO L225 Difference]: With dead ends: 43 [2018-12-09 18:02:02,997 INFO L226 Difference]: Without dead ends: 43 [2018-12-09 18:02:02,998 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 18:02:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-09 18:02:02,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-09 18:02:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 18:02:03,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 18:02:03,000 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 11 [2018-12-09 18:02:03,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:03,000 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 18:02:03,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:02:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 18:02:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 18:02:03,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:03,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:03,001 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:03,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:03,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1210784725, now seen corresponding path program 1 times [2018-12-09 18:02:03,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:03,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:03,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:03,033 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 18:02:03,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:03,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:02:03,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:03,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:02:03,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:02:03,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:02:03,034 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 5 states. [2018-12-09 18:02:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:03,072 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-12-09 18:02:03,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:02:03,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-12-09 18:02:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:03,073 INFO L225 Difference]: With dead ends: 41 [2018-12-09 18:02:03,073 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 18:02:03,074 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 18:02:03,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 18:02:03,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 18:02:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 18:02:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-12-09 18:02:03,076 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 16 [2018-12-09 18:02:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:03,076 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-12-09 18:02:03,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:02:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-12-09 18:02:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 18:02:03,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:03,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:03,077 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:03,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:03,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1210784726, now seen corresponding path program 1 times [2018-12-09 18:02:03,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:03,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:03,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:03,140 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 18:02:03,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:03,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:02:03,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:03,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:02:03,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:02:03,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:02:03,142 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 7 states. [2018-12-09 18:02:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:03,200 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2018-12-09 18:02:03,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:02:03,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-12-09 18:02:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:03,202 INFO L225 Difference]: With dead ends: 55 [2018-12-09 18:02:03,203 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 18:02:03,203 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 18:02:03,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 18:02:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2018-12-09 18:02:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 18:02:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2018-12-09 18:02:03,206 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 16 [2018-12-09 18:02:03,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:03,206 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2018-12-09 18:02:03,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:02:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2018-12-09 18:02:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 18:02:03,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:03,207 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 18:02:03,207 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:03,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash -372016138, now seen corresponding path program 1 times [2018-12-09 18:02:03,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:03,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:03,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:03,232 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 18:02:03,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:03,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:02:03,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:03,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:02:03,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:02:03,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:02:03,234 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 6 states. [2018-12-09 18:02:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:03,291 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-12-09 18:02:03,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:02:03,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-09 18:02:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:03,292 INFO L225 Difference]: With dead ends: 45 [2018-12-09 18:02:03,292 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 18:02:03,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:02:03,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 18:02:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 18:02:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 18:02:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-12-09 18:02:03,294 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 18 [2018-12-09 18:02:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:03,294 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-12-09 18:02:03,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:02:03,294 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-12-09 18:02:03,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 18:02:03,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:03,295 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 18:02:03,295 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:03,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:03,295 INFO L82 PathProgramCache]: Analyzing trace with hash -372016137, now seen corresponding path program 1 times [2018-12-09 18:02:03,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:03,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:03,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:03,362 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 18:02:03,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:03,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 18:02:03,362 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:03,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 18:02:03,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 18:02:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:02:03,363 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 8 states. [2018-12-09 18:02:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:03,424 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-12-09 18:02:03,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:02:03,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-09 18:02:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:03,426 INFO L225 Difference]: With dead ends: 47 [2018-12-09 18:02:03,427 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 18:02:03,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:02:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 18:02:03,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-12-09 18:02:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 18:02:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-12-09 18:02:03,429 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2018-12-09 18:02:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:03,429 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-12-09 18:02:03,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 18:02:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-12-09 18:02:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 18:02:03,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:03,430 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 18:02:03,430 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:03,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1352649081, now seen corresponding path program 1 times [2018-12-09 18:02:03,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:03,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:03,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:03,466 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 18:02:03,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:03,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:02:03,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:03,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:02:03,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:02:03,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:02:03,467 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 4 states. [2018-12-09 18:02:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:03,508 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-12-09 18:02:03,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:02:03,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-09 18:02:03,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:03,509 INFO L225 Difference]: With dead ends: 44 [2018-12-09 18:02:03,509 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 18:02:03,509 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 18:02:03,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 18:02:03,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-09 18:02:03,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 18:02:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-09 18:02:03,511 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 19 [2018-12-09 18:02:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:03,511 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-09 18:02:03,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:02:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-09 18:02:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 18:02:03,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:03,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:03,512 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:03,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:03,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1025222217, now seen corresponding path program 1 times [2018-12-09 18:02:03,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:03,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:03,561 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 18:02:03,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:03,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:02:03,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:03,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:02:03,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:02:03,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:02:03,562 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-12-09 18:02:03,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:03,599 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-09 18:02:03,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:02:03,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-09 18:02:03,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:03,600 INFO L225 Difference]: With dead ends: 37 [2018-12-09 18:02:03,600 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 18:02:03,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:02:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 18:02:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-09 18:02:03,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 18:02:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-12-09 18:02:03,602 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 20 [2018-12-09 18:02:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:03,602 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-12-09 18:02:03,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:02:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-12-09 18:02:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 18:02:03,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:03,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:03,603 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:03,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:03,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1025222216, now seen corresponding path program 1 times [2018-12-09 18:02:03,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:03,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:03,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:03,649 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 18:02:03,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:03,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:02:03,649 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:03,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:02:03,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:02:03,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:02:03,650 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 7 states. [2018-12-09 18:02:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:03,697 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-09 18:02:03,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:02:03,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-12-09 18:02:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:03,698 INFO L225 Difference]: With dead ends: 42 [2018-12-09 18:02:03,698 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 18:02:03,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:02:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 18:02:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2018-12-09 18:02:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-09 18:02:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-12-09 18:02:03,700 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2018-12-09 18:02:03,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:03,700 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-12-09 18:02:03,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:02:03,700 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-12-09 18:02:03,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 18:02:03,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:03,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:03,701 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:03,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:03,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1691315848, now seen corresponding path program 1 times [2018-12-09 18:02:03,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:03,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:03,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:03,731 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 18:02:03,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:03,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:02:03,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:03,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:02:03,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:02:03,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:02:03,732 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-12-09 18:02:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:03,765 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-09 18:02:03,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:02:03,766 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-12-09 18:02:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:03,766 INFO L225 Difference]: With dead ends: 37 [2018-12-09 18:02:03,766 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 18:02:03,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:02:03,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 18:02:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-09 18:02:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-09 18:02:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-12-09 18:02:03,769 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2018-12-09 18:02:03,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:03,769 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-12-09 18:02:03,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:02:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-12-09 18:02:03,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 18:02:03,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:03,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:03,770 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:03,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:03,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1691315847, now seen corresponding path program 1 times [2018-12-09 18:02:03,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:03,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:03,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:03,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:03,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:03,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 18:02:03,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:03,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 18:02:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 18:02:03,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:02:03,852 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 10 states. [2018-12-09 18:02:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:03,941 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-12-09 18:02:03,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 18:02:03,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-09 18:02:03,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:03,942 INFO L225 Difference]: With dead ends: 45 [2018-12-09 18:02:03,942 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 18:02:03,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:02:03,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 18:02:03,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-12-09 18:02:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 18:02:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-09 18:02:03,944 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 22 [2018-12-09 18:02:03,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:03,944 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-09 18:02:03,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 18:02:03,944 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-09 18:02:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 18:02:03,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:03,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:03,945 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:03,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:03,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1590515975, now seen corresponding path program 1 times [2018-12-09 18:02:03,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:03,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:03,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:03,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:04,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:02:04,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 18:02:04,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:04,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 18:02:04,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 18:02:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:02:04,055 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-12-09 18:02:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:04,136 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-12-09 18:02:04,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 18:02:04,136 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-12-09 18:02:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:04,136 INFO L225 Difference]: With dead ends: 50 [2018-12-09 18:02:04,137 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 18:02:04,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-12-09 18:02:04,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 18:02:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 18:02:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 18:02:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-09 18:02:04,139 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 24 [2018-12-09 18:02:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:04,139 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-09 18:02:04,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 18:02:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-09 18:02:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 18:02:04,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:04,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:04,140 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:04,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:04,140 INFO L82 PathProgramCache]: Analyzing trace with hash 710306615, now seen corresponding path program 1 times [2018-12-09 18:02:04,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:04,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:04,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:04,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:04,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:04,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:04,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:02:04,300 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-09 18:02:04,301 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [25], [30], [34], [38], [40], [41], [42], [56], [57], [64], [66], [71], [77], [78], [79], [81] [2018-12-09 18:02:04,322 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:02:04,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:02:04,432 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:02:04,433 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Merged at 8 different actions 8 times. Never widened. Performed 276 root evaluator evaluations with a maximum evaluation depth of 3. Performed 276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-09 18:02:04,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:04,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:02:04,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:04,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/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 18:02:04,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:04,451 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:02:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:04,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:02:04,505 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 18:02:04,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:04,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:04,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-12-09 18:02:04,529 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 18:02:04,531 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 18:02:04,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:04,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:04,539 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 18:02:04,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-12-09 18:02:04,561 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 18:02:04,563 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 18:02:04,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:04,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:04,580 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 18:02:04,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-12-09 18:02:04,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-12-09 18:02:04,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 18:02:04,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 18:02:04,718 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 18:02:04,718 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:04,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:02:04,731 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 18:02:04,731 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-12-09 18:02:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:04,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:02:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-12-09 18:02:04,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:04,947 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 18:02:04,954 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 18:02:04,954 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:04,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:04,960 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 18:02:04,960 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:7 [2018-12-09 18:02:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:04,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:02:04,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 22 [2018-12-09 18:02:04,981 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:02:04,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 18:02:04,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 18:02:04,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-12-09 18:02:04,981 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 17 states. [2018-12-09 18:02:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:05,453 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-12-09 18:02:05,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 18:02:05,453 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-12-09 18:02:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:05,454 INFO L225 Difference]: With dead ends: 48 [2018-12-09 18:02:05,454 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 18:02:05,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=790, Unknown=0, NotChecked=0, Total=930 [2018-12-09 18:02:05,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 18:02:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-12-09 18:02:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 18:02:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-12-09 18:02:05,457 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 24 [2018-12-09 18:02:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:05,457 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-12-09 18:02:05,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 18:02:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-12-09 18:02:05,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 18:02:05,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:05,458 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 18:02:05,458 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:05,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:05,458 INFO L82 PathProgramCache]: Analyzing trace with hash -295143656, now seen corresponding path program 1 times [2018-12-09 18:02:05,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:05,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:05,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:05,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:05,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:05,664 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 18:02:05,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:05,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:02:05,664 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-09 18:02:05,665 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [25], [30], [34], [38], [41], [42], [44], [56], [57], [64], [66], [71], [77], [78], [79], [81] [2018-12-09 18:02:05,666 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:02:05,666 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:02:05,711 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:02:05,711 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Merged at 8 different actions 8 times. Never widened. Performed 276 root evaluator evaluations with a maximum evaluation depth of 3. Performed 276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-09 18:02:05,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:05,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:02:05,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:05,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/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 18:02:05,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:05,720 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:02:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:05,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:02:05,738 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 18:02:05,739 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 18:02:05,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:05,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:05,745 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 18:02:05,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-12-09 18:02:05,965 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 18:02:05,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2018-12-09 18:02:05,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 18:02:05,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 18:02:05,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:05,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-12-09 18:02:05,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:06,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2018-12-09 18:02:06,012 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 18:02:06,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:02:06,035 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 18:02:06,035 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-12-09 18:02:06,066 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 18:02:06,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:02:06,387 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 18:02:06,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:06,400 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 18:02:06,425 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 18:02:06,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:06,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:06,437 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 18:02:06,437 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:69, output treesize:7 [2018-12-09 18:02:06,441 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 18:02:06,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:02:06,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2018-12-09 18:02:06,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:02:06,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-09 18:02:06,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-09 18:02:06,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-12-09 18:02:06,457 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 22 states. [2018-12-09 18:02:07,073 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2018-12-09 18:02:07,490 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2018-12-09 18:02:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:07,846 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-09 18:02:07,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 18:02:07,846 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-12-09 18:02:07,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:07,846 INFO L225 Difference]: With dead ends: 44 [2018-12-09 18:02:07,846 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 18:02:07,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=210, Invalid=1512, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 18:02:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 18:02:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 18:02:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 18:02:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-09 18:02:07,848 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 26 [2018-12-09 18:02:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:07,849 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-09 18:02:07,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-09 18:02:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-09 18:02:07,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 18:02:07,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:07,849 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:07,849 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:07,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:07,849 INFO L82 PathProgramCache]: Analyzing trace with hash -165212007, now seen corresponding path program 1 times [2018-12-09 18:02:07,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:07,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:07,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:07,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:07,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:02:07,882 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-12-09 18:02:07,882 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [25], [30], [34], [38], [41], [42], [56], [57], [59], [64], [66], [71], [77], [78], [79], [81] [2018-12-09 18:02:07,883 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:02:07,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:02:07,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:02:07,918 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Merged at 8 different actions 8 times. Never widened. Performed 276 root evaluator evaluations with a maximum evaluation depth of 3. Performed 276 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 28 variables. [2018-12-09 18:02:07,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:07,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:02:07,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:07,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/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 18:02:07,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:07,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:02:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:07,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:02:07,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:07,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:02:07,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-12-09 18:02:07,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:07,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:07,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-12-09 18:02:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:08,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:02:08,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-09 18:02:08,012 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:02:08,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:02:08,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:02:08,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:02:08,013 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 6 states. [2018-12-09 18:02:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:08,058 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-09 18:02:08,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:02:08,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-12-09 18:02:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:08,058 INFO L225 Difference]: With dead ends: 42 [2018-12-09 18:02:08,059 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 18:02:08,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:02:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 18:02:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-12-09 18:02:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 18:02:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-09 18:02:08,060 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 28 [2018-12-09 18:02:08,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:08,060 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-09 18:02:08,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:02:08,060 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-09 18:02:08,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 18:02:08,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:08,061 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:08,061 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:08,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:08,061 INFO L82 PathProgramCache]: Analyzing trace with hash 144774170, now seen corresponding path program 1 times [2018-12-09 18:02:08,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:08,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:08,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:08,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:08,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:08,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:08,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:02:08,124 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-09 18:02:08,124 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [10], [16], [18], [19], [22], [25], [30], [34], [38], [41], [42], [47], [48], [51], [54], [56], [57], [64], [66], [71], [77], [78], [79], [81] [2018-12-09 18:02:08,125 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 18:02:08,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 18:02:08,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 18:02:08,153 INFO L272 AbstractInterpreter]: Visited 27 different actions 38 times. Merged at 11 different actions 11 times. Never widened. Performed 330 root evaluator evaluations with a maximum evaluation depth of 3. Performed 330 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 31 variables. [2018-12-09 18:02:08,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:08,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 18:02:08,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:08,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/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 18:02:08,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:08,163 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 18:02:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:08,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:02:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:08,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:02:08,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2018-12-09 18:02:08,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-09 18:02:08,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-12-09 18:02:08,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:08,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:02:08,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2018-12-09 18:02:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:08,282 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 18:02:08,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 17 [2018-12-09 18:02:08,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:02:08,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:02:08,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:02:08,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-12-09 18:02:08,283 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 7 states. [2018-12-09 18:02:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:08,332 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-09 18:02:08,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 18:02:08,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-12-09 18:02:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:08,333 INFO L225 Difference]: With dead ends: 39 [2018-12-09 18:02:08,333 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 18:02:08,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2018-12-09 18:02:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 18:02:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-09 18:02:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-09 18:02:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-09 18:02:08,334 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-12-09 18:02:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:08,335 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-09 18:02:08,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:02:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-09 18:02:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 18:02:08,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:08,335 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:08,336 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:08,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:08,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1955399002, now seen corresponding path program 2 times [2018-12-09 18:02:08,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:08,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:08,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:02:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:08,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:08,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:08,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:02:08,491 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:02:08,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:02:08,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:08,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/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 18:02:08,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 18:02:08,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 18:02:08,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 18:02:08,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:02:08,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:02:08,526 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 18:02:08,527 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 18:02:08,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:08,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:08,544 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 18:02:08,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:08,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:08,549 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-12-09 18:02:08,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-12-09 18:02:08,566 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 18:02:08,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:08,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:08,579 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 18:02:08,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-12-09 18:02:08,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-12-09 18:02:08,603 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 18:02:08,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:08,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:08,613 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 18:02:08,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:41 [2018-12-09 18:02:08,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-12-09 18:02:08,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-12-09 18:02:08,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 18:02:08,854 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 18:02:08,854 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:08,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:02:08,876 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 18:02:08,876 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:58, output treesize:37 [2018-12-09 18:02:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 18:02:08,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:02:09,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-12-09 18:02:09,230 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 18:02:09,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:09,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 18:02:09,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-12-09 18:02:09,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:09,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:09,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:02:09,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:02:09,296 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:200 [2018-12-09 18:02:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 18:02:09,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:02:09,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 27 [2018-12-09 18:02:09,528 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:02:09,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 18:02:09,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 18:02:09,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-12-09 18:02:09,529 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 20 states. [2018-12-09 18:02:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:10,569 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-12-09 18:02:10,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 18:02:10,569 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 32 [2018-12-09 18:02:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:10,570 INFO L225 Difference]: With dead ends: 38 [2018-12-09 18:02:10,570 INFO L226 Difference]: Without dead ends: 38 [2018-12-09 18:02:10,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=243, Invalid=1397, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 18:02:10,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-09 18:02:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-12-09 18:02:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 18:02:10,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-09 18:02:10,572 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-09 18:02:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:10,572 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-09 18:02:10,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 18:02:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-09 18:02:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 18:02:10,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:10,573 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:10,573 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:10,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:10,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2057235333, now seen corresponding path program 2 times [2018-12-09 18:02:10,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:10,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:10,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:02:10,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:10,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:10,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:10,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:02:10,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:02:10,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:02:10,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:10,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:02:10,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 18:02:10,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 18:02:10,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 18:02:10,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:02:10,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:02:10,947 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 18:02:10,961 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 18:02:10,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 18:02:10,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:02:10,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:02:10,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:28 [2018-12-09 18:02:11,002 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 18:02:11,004 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 18:02:11,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:11,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:11,010 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 18:02:11,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-12-09 18:02:11,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-12-09 18:02:11,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-12-09 18:02:11,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:11,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2018-12-09 18:02:11,241 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 18:02:11,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2018-12-09 18:02:11,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 18:02:11,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:02:11,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:02:11,272 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:105 [2018-12-09 18:02:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:11,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:02:11,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2018-12-09 18:02:11,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-12-09 18:02:11,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:11,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-12-09 18:02:11,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:11,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:11,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:02:11,815 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:77, output treesize:97 [2018-12-09 18:02:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:11,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:02:11,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 40 [2018-12-09 18:02:11,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:02:11,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-09 18:02:11,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-09 18:02:11,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1504, Unknown=0, NotChecked=0, Total=1640 [2018-12-09 18:02:11,887 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 29 states. [2018-12-09 18:02:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:13,012 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-12-09 18:02:13,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 18:02:13,012 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34 [2018-12-09 18:02:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:13,013 INFO L225 Difference]: With dead ends: 44 [2018-12-09 18:02:13,013 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 18:02:13,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=299, Invalid=2671, Unknown=0, NotChecked=0, Total=2970 [2018-12-09 18:02:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 18:02:13,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-12-09 18:02:13,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 18:02:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-09 18:02:13,015 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 34 [2018-12-09 18:02:13,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:13,016 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-09 18:02:13,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-09 18:02:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-09 18:02:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 18:02:13,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:02:13,016 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:02:13,016 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, cstrncmpErr0REQUIRES_VIOLATION, cstrncmpErr5REQUIRES_VIOLATION, cstrncmpErr1REQUIRES_VIOLATION, cstrncmpErr7REQUIRES_VIOLATION, cstrncmpErr6REQUIRES_VIOLATION, cstrncmpErr8REQUIRES_VIOLATION, cstrncmpErr2REQUIRES_VIOLATION, cstrncmpErr3REQUIRES_VIOLATION, cstrncmpErr4REQUIRES_VIOLATION, cstrncmpErr9REQUIRES_VIOLATION]=== [2018-12-09 18:02:13,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:02:13,017 INFO L82 PathProgramCache]: Analyzing trace with hash -219963682, now seen corresponding path program 3 times [2018-12-09 18:02:13,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:02:13,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:13,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:02:13,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:02:13,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:02:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:02:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:13,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:13,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 18:02:13,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 18:02:13,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 18:02:13,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 18:02:13,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 18:02:13,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 18:02:13,280 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 18:02:13,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 18:02:13,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 18:02:13,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 18:02:13,307 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 18:02:13,314 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 18:02:13,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 18:02:13,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 18:02:13,325 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 18:02:13,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 [2018-12-09 18:02:13,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 18:02:13,340 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 18:02:13,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:13,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:13,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:13,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-12-09 18:02:13,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2018-12-09 18:02:13,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 26 [2018-12-09 18:02:13,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-09 18:02:13,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-12-09 18:02:13,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:13,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-12-09 18:02:13,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:13,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 27 [2018-12-09 18:02:13,577 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-09 18:02:13,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 18:02:13,595 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 18:02:13,596 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-12-09 18:02:13,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:13,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 18:02:14,891 WARN L180 SmtUtils]: Spent 900.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-09 18:02:17,640 WARN L180 SmtUtils]: Spent 2.70 s on a formula simplification that was a NOOP. DAG size: 50 [2018-12-09 18:02:17,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2018-12-09 18:02:17,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-12-09 18:02:17,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 18:02:17,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 18:02:17,856 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 18:02:17,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:35 [2018-12-09 18:02:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:02:17,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 18:02:17,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 17] total 46 [2018-12-09 18:02:17,917 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 18:02:17,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-09 18:02:17,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-09 18:02:17,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1935, Unknown=0, NotChecked=0, Total=2162 [2018-12-09 18:02:17,918 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 31 states. [2018-12-09 18:02:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:02:18,910 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-09 18:02:18,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 18:02:18,910 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 42 [2018-12-09 18:02:18,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:02:18,911 INFO L225 Difference]: With dead ends: 43 [2018-12-09 18:02:18,911 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 18:02:18,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=758, Invalid=4072, Unknown=0, NotChecked=0, Total=4830 [2018-12-09 18:02:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 18:02:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 18:02:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 18:02:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 18:02:18,912 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-12-09 18:02:18,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:02:18,912 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 18:02:18,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-09 18:02:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 18:02:18,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 18:02:18,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:02:18 BoogieIcfgContainer [2018-12-09 18:02:18,915 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 18:02:18,915 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 18:02:18,915 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 18:02:18,915 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 18:02:18,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:02:02" (3/4) ... [2018-12-09 18:02:18,917 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 18:02:18,921 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 18:02:18,921 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 18:02:18,921 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrncmp [2018-12-09 18:02:18,923 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2018-12-09 18:02:18,923 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 18:02:18,923 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 18:02:18,947 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_86a9441a-8d29-4d4c-bb82-cd3c8d1e0db8/bin-2019/utaipan/witness.graphml [2018-12-09 18:02:18,947 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 18:02:18,947 INFO L168 Benchmark]: Toolchain (without parser) took 16889.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 247.5 MB). Free memory was 947.0 MB in the beginning and 1.2 GB in the end (delta: -276.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:02:18,948 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:02:18,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-09 18:02:18,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.25 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-09 18:02:18,948 INFO L168 Benchmark]: Boogie Preprocessor took 16.60 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 18:02:18,948 INFO L168 Benchmark]: RCFGBuilder took 220.70 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 18:02:18,948 INFO L168 Benchmark]: TraceAbstraction took 16333.93 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 145.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -160.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:02:18,948 INFO L168 Benchmark]: Witness Printer took 31.96 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 142.1 kB). Peak memory consumption was 142.1 kB. Max. memory is 11.5 GB. [2018-12-09 18:02:18,949 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.25 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.60 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 220.70 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16333.93 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 145.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -160.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 31.96 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 142.1 kB). Peak memory consumption was 142.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 50 locations, 15 error locations. SAFE Result, 16.3s OverallTime, 21 OverallIterations, 4 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 593 SDtfs, 844 SDslu, 2183 SDs, 0 SdLazy, 2287 SolverSat, 164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 676 GetRequests, 331 SyntacticMatches, 11 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2022 ImplicationChecksByTransitivity, 12.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 31 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 669 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 850 ConstructedInterpolants, 109 QuantifiedInterpolants, 332648 SizeOfPredicates, 115 NumberOfNonLiveVariables, 1206 ConjunctsInSsa, 277 ConjunctsInUnsatCore, 35 InterpolantComputations, 16 PerfectInterpolantSequences, 45/211 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...