./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/cstrchr-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/cstrchr-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 276936ba1494f32a328b3de86f664a380d5263e9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:35:15,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:35:15,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:35:15,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:35:15,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:35:15,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:35:15,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:35:15,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:35:15,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:35:15,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:35:15,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:35:15,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:35:15,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:35:15,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:35:15,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:35:15,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:35:15,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:35:15,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:35:15,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:35:15,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:35:15,300 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:35:15,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:35:15,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:35:15,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:35:15,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:35:15,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:35:15,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:35:15,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:35:15,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:35:15,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:35:15,313 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:35:15,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:35:15,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:35:15,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:35:15,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:35:15,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:35:15,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:35:15,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:35:15,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:35:15,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:35:15,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:35:15,319 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:35:15,343 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:35:15,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:35:15,354 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:35:15,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:35:15,355 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:35:15,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:35:15,355 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:35:15,355 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:35:15,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:35:15,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:35:15,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:35:15,356 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:35:15,357 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:35:15,357 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:35:15,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:35:15,359 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:35:15,360 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:35:15,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:35:15,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:35:15,361 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:35:15,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:35:15,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:35:15,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:35:15,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:35:15,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:35:15,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:35:15,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer 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 -> Automizer 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 -> 276936ba1494f32a328b3de86f664a380d5263e9 [2019-11-15 21:35:15,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:35:15,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:35:15,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:35:15,413 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:35:15,413 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:35:15,414 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/cstrchr-alloca-2.i [2019-11-15 21:35:15,480 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/data/0666bbb3c/c54973b3741244cabb9ce09991954d5b/FLAGb6ac99a0c [2019-11-15 21:35:15,948 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:35:15,949 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/sv-benchmarks/c/array-memsafety/cstrchr-alloca-2.i [2019-11-15 21:35:15,974 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/data/0666bbb3c/c54973b3741244cabb9ce09991954d5b/FLAGb6ac99a0c [2019-11-15 21:35:16,483 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/data/0666bbb3c/c54973b3741244cabb9ce09991954d5b [2019-11-15 21:35:16,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:35:16,486 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:35:16,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:35:16,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:35:16,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:35:16,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:35:16" (1/1) ... [2019-11-15 21:35:16,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b255a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:16, skipping insertion in model container [2019-11-15 21:35:16,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:35:16" (1/1) ... [2019-11-15 21:35:16,499 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:35:16,538 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:35:16,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:35:16,859 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:35:16,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:35:16,937 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:35:16,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:16 WrapperNode [2019-11-15 21:35:16,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:35:16,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:35:16,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:35:16,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:35:16,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:16" (1/1) ... [2019-11-15 21:35:16,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:16" (1/1) ... [2019-11-15 21:35:16,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:16" (1/1) ... [2019-11-15 21:35:16,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:16" (1/1) ... [2019-11-15 21:35:17,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:16" (1/1) ... [2019-11-15 21:35:17,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:16" (1/1) ... [2019-11-15 21:35:17,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:16" (1/1) ... [2019-11-15 21:35:17,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:35:17,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:35:17,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:35:17,030 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:35:17,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/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 [2019-11-15 21:35:17,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:35:17,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:35:17,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:35:17,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:35:17,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 21:35:17,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 21:35:17,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 21:35:17,096 INFO L138 BoogieDeclarations]: Found implementation of procedure cstrchr [2019-11-15 21:35:17,096 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:35:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:35:17,096 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:35:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:35:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:35:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:35:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:35:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:35:17,098 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:35:17,098 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:35:17,098 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:35:17,098 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:35:17,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:35:17,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:35:17,099 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:35:17,099 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:35:17,099 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:35:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:35:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:35:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 21:35:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 21:35:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 21:35:17,100 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:35:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:35:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:35:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:35:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:35:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:35:17,101 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:35:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:35:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:35:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:35:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:35:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:35:17,102 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:35:17,103 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:35:17,103 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:35:17,103 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:35:17,103 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:35:17,103 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:35:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:35:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:35:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:35:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:35:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:35:17,104 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:35:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:35:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:35:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:35:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:35:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:35:17,105 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:35:17,106 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:35:17,106 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:35:17,106 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:35:17,106 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:35:17,106 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:35:17,106 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:35:17,107 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:35:17,107 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:35:17,107 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:35:17,107 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:35:17,107 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:35:17,107 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:35:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:35:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:35:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:35:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:35:17,108 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:35:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:35:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:35:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:35:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:35:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:35:17,109 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:35:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:35:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:35:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:35:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:35:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:35:17,110 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:35:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:35:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:35:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:35:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:35:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:35:17,111 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:35:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:35:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:35:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:35:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:35:17,112 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:35:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:35:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:35:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:35:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:35:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:35:17,113 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:35:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:35:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:35:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:35:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:35:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:35:17,114 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:35:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:35:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:35:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:35:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:35:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 21:35:17,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-15 21:35:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure cstrchr [2019-11-15 21:35:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:35:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:35:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:35:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:35:17,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:35:17,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:35:17,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:35:17,528 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:35:17,528 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-15 21:35:17,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:35:17 BoogieIcfgContainer [2019-11-15 21:35:17,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:35:17,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:35:17,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:35:17,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:35:17,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:35:16" (1/3) ... [2019-11-15 21:35:17,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354225df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:35:17, skipping insertion in model container [2019-11-15 21:35:17,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:35:16" (2/3) ... [2019-11-15 21:35:17,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@354225df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:35:17, skipping insertion in model container [2019-11-15 21:35:17,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:35:17" (3/3) ... [2019-11-15 21:35:17,535 INFO L109 eAbstractionObserver]: Analyzing ICFG cstrchr-alloca-2.i [2019-11-15 21:35:17,544 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:35:17,551 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-11-15 21:35:17,560 INFO L249 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2019-11-15 21:35:17,577 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:35:17,577 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:35:17,577 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:35:17,578 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:35:17,578 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:35:17,578 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:35:17,578 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:35:17,578 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:35:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-11-15 21:35:17,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:35:17,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:17,600 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:17,602 INFO L410 AbstractCegarLoop]: === Iteration 1 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:17,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:17,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1287232828, now seen corresponding path program 1 times [2019-11-15 21:35:17,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:17,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997911587] [2019-11-15 21:35:17,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:17,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:17,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:17,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997911587] [2019-11-15 21:35:17,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:17,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:35:17,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163225901] [2019-11-15 21:35:17,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:35:17,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:17,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:35:17,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:17,775 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2019-11-15 21:35:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:17,874 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-11-15 21:35:17,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:35:17,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-15 21:35:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:17,884 INFO L225 Difference]: With dead ends: 43 [2019-11-15 21:35:17,885 INFO L226 Difference]: Without dead ends: 40 [2019-11-15 21:35:17,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:35:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-15 21:35:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-15 21:35:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 21:35:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-15 21:35:17,932 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 10 [2019-11-15 21:35:17,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:17,932 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-15 21:35:17,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:35:17,933 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-15 21:35:17,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:35:17,933 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:17,933 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:17,934 INFO L410 AbstractCegarLoop]: === Iteration 2 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:17,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:17,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1287232518, now seen corresponding path program 1 times [2019-11-15 21:35:17,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:17,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413962824] [2019-11-15 21:35:17,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:17,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:17,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:18,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413962824] [2019-11-15 21:35:18,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:18,010 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:35:18,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541225869] [2019-11-15 21:35:18,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:35:18,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:18,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:35:18,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:35:18,013 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 4 states. [2019-11-15 21:35:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:18,146 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-15 21:35:18,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:35:18,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 21:35:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:18,148 INFO L225 Difference]: With dead ends: 38 [2019-11-15 21:35:18,148 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 21:35:18,148 INFO L600 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 [2019-11-15 21:35:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 21:35:18,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-15 21:35:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 21:35:18,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-11-15 21:35:18,153 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 10 [2019-11-15 21:35:18,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:18,154 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-11-15 21:35:18,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:35:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-11-15 21:35:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:35:18,155 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:18,155 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:18,155 INFO L410 AbstractCegarLoop]: === Iteration 3 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:18,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:18,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1287232519, now seen corresponding path program 1 times [2019-11-15 21:35:18,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:18,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623513751] [2019-11-15 21:35:18,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:18,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:18,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:18,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623513751] [2019-11-15 21:35:18,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:18,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:35:18,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941846869] [2019-11-15 21:35:18,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:35:18,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:18,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:35:18,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:35:18,231 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 5 states. [2019-11-15 21:35:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:18,345 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-11-15 21:35:18,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:35:18,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 21:35:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:18,347 INFO L225 Difference]: With dead ends: 37 [2019-11-15 21:35:18,347 INFO L226 Difference]: Without dead ends: 37 [2019-11-15 21:35:18,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:35:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-15 21:35:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-15 21:35:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 21:35:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-11-15 21:35:18,352 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 10 [2019-11-15 21:35:18,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:18,352 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-11-15 21:35:18,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:35:18,352 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-11-15 21:35:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:35:18,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:18,353 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:18,353 INFO L410 AbstractCegarLoop]: === Iteration 4 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:18,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:18,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1287232572, now seen corresponding path program 1 times [2019-11-15 21:35:18,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:18,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625517432] [2019-11-15 21:35:18,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:18,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:18,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:18,420 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625517432] [2019-11-15 21:35:18,420 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:18,421 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:35:18,421 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452573076] [2019-11-15 21:35:18,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:35:18,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:18,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:35:18,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:35:18,422 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2019-11-15 21:35:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:18,528 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-11-15 21:35:18,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:35:18,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 21:35:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:18,532 INFO L225 Difference]: With dead ends: 45 [2019-11-15 21:35:18,532 INFO L226 Difference]: Without dead ends: 45 [2019-11-15 21:35:18,533 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:35:18,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-15 21:35:18,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-11-15 21:35:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 21:35:18,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-15 21:35:18,542 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 10 [2019-11-15 21:35:18,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:18,542 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-15 21:35:18,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:35:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-15 21:35:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 21:35:18,543 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:18,543 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:18,543 INFO L410 AbstractCegarLoop]: === Iteration 5 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:18,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:18,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1287292154, now seen corresponding path program 1 times [2019-11-15 21:35:18,544 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:18,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977168259] [2019-11-15 21:35:18,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:18,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:18,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:18,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:18,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977168259] [2019-11-15 21:35:18,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:18,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:35:18,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849184510] [2019-11-15 21:35:18,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:35:18,607 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:18,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:35:18,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:35:18,608 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-11-15 21:35:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:18,755 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-11-15 21:35:18,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:35:18,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-15 21:35:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:18,758 INFO L225 Difference]: With dead ends: 49 [2019-11-15 21:35:18,758 INFO L226 Difference]: Without dead ends: 49 [2019-11-15 21:35:18,759 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:35:18,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-15 21:35:18,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-11-15 21:35:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 21:35:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-11-15 21:35:18,764 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 10 [2019-11-15 21:35:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:18,764 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2019-11-15 21:35:18,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:35:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2019-11-15 21:35:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 21:35:18,765 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:18,765 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:18,765 INFO L410 AbstractCegarLoop]: === Iteration 6 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:18,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash -554371049, now seen corresponding path program 1 times [2019-11-15 21:35:18,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:18,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433927602] [2019-11-15 21:35:18,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:18,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:18,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:18,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433927602] [2019-11-15 21:35:18,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:18,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:35:18,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917428253] [2019-11-15 21:35:18,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:35:18,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:18,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:35:18,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:35:18,868 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 6 states. [2019-11-15 21:35:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:19,002 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-11-15 21:35:19,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:35:19,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-15 21:35:19,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:19,003 INFO L225 Difference]: With dead ends: 38 [2019-11-15 21:35:19,003 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 21:35:19,004 INFO L600 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 [2019-11-15 21:35:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 21:35:19,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-15 21:35:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 21:35:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2019-11-15 21:35:19,008 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 14 [2019-11-15 21:35:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:19,008 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-11-15 21:35:19,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:35:19,008 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2019-11-15 21:35:19,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 21:35:19,009 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:19,009 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:19,009 INFO L410 AbstractCegarLoop]: === Iteration 7 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash -554371048, now seen corresponding path program 1 times [2019-11-15 21:35:19,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:19,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424219066] [2019-11-15 21:35:19,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:19,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:19,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:19,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424219066] [2019-11-15 21:35:19,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:19,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:35:19,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367923002] [2019-11-15 21:35:19,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:35:19,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:19,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:35:19,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:35:19,124 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 8 states. [2019-11-15 21:35:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:19,349 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2019-11-15 21:35:19,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:35:19,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-11-15 21:35:19,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:19,352 INFO L225 Difference]: With dead ends: 49 [2019-11-15 21:35:19,352 INFO L226 Difference]: Without dead ends: 49 [2019-11-15 21:35:19,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:35:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-15 21:35:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2019-11-15 21:35:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 21:35:19,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-11-15 21:35:19,358 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 14 [2019-11-15 21:35:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:19,358 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-11-15 21:35:19,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:35:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-11-15 21:35:19,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-15 21:35:19,359 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:19,359 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:19,360 INFO L410 AbstractCegarLoop]: === Iteration 8 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:19,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:19,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1315055555, now seen corresponding path program 1 times [2019-11-15 21:35:19,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:19,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384777688] [2019-11-15 21:35:19,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:19,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:19,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:19,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384777688] [2019-11-15 21:35:19,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888351842] [2019-11-15 21:35:19,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:19,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 21:35:19,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:19,675 INFO L375 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 6 treesize of output 5 [2019-11-15 21:35:19,675 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:19,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:19,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:19,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 21:35:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:19,709 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:19,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-15 21:35:19,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618468743] [2019-11-15 21:35:19,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:35:19,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:19,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:35:19,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:35:19,710 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 7 states. [2019-11-15 21:35:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:19,852 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-15 21:35:19,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:35:19,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-11-15 21:35:19,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:19,853 INFO L225 Difference]: With dead ends: 52 [2019-11-15 21:35:19,853 INFO L226 Difference]: Without dead ends: 52 [2019-11-15 21:35:19,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:35:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-15 21:35:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2019-11-15 21:35:19,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-15 21:35:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-11-15 21:35:19,858 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 14 [2019-11-15 21:35:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:19,859 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-11-15 21:35:19,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:35:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-11-15 21:35:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 21:35:19,860 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:19,860 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:20,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:20,063 INFO L410 AbstractCegarLoop]: === Iteration 9 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:20,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:20,063 INFO L82 PathProgramCache]: Analyzing trace with hash -319565009, now seen corresponding path program 1 times [2019-11-15 21:35:20,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:20,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543691252] [2019-11-15 21:35:20,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:20,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:20,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:20,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:20,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543691252] [2019-11-15 21:35:20,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:20,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:35:20,124 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023667250] [2019-11-15 21:35:20,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:35:20,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:20,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:35:20,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:35:20,125 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 4 states. [2019-11-15 21:35:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:20,200 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-11-15 21:35:20,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:35:20,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-15 21:35:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:20,201 INFO L225 Difference]: With dead ends: 44 [2019-11-15 21:35:20,201 INFO L226 Difference]: Without dead ends: 44 [2019-11-15 21:35:20,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:35:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-15 21:35:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-15 21:35:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-15 21:35:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-11-15 21:35:20,205 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 18 [2019-11-15 21:35:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:20,205 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-11-15 21:35:20,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:35:20,205 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-11-15 21:35:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 21:35:20,206 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:20,206 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:20,206 INFO L410 AbstractCegarLoop]: === Iteration 10 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:20,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2129811308, now seen corresponding path program 1 times [2019-11-15 21:35:20,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:20,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870958639] [2019-11-15 21:35:20,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:20,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:20,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:20,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870958639] [2019-11-15 21:35:20,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:20,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:35:20,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168347457] [2019-11-15 21:35:20,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:35:20,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:20,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:35:20,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:35:20,400 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 10 states. [2019-11-15 21:35:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:20,706 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2019-11-15 21:35:20,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:35:20,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-15 21:35:20,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:20,708 INFO L225 Difference]: With dead ends: 60 [2019-11-15 21:35:20,708 INFO L226 Difference]: Without dead ends: 60 [2019-11-15 21:35:20,708 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:35:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-15 21:35:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-11-15 21:35:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-15 21:35:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2019-11-15 21:35:20,713 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 20 [2019-11-15 21:35:20,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:20,713 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2019-11-15 21:35:20,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:35:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2019-11-15 21:35:20,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 21:35:20,714 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:20,714 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:20,715 INFO L410 AbstractCegarLoop]: === Iteration 11 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:20,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:20,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1118694058, now seen corresponding path program 1 times [2019-11-15 21:35:20,716 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:20,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480472267] [2019-11-15 21:35:20,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:20,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:20,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:20,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480472267] [2019-11-15 21:35:20,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:20,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 21:35:20,892 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744544744] [2019-11-15 21:35:20,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:35:20,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:20,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:35:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:35:20,893 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 11 states. [2019-11-15 21:35:21,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:21,266 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2019-11-15 21:35:21,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:35:21,267 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-15 21:35:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:21,268 INFO L225 Difference]: With dead ends: 77 [2019-11-15 21:35:21,268 INFO L226 Difference]: Without dead ends: 77 [2019-11-15 21:35:21,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-11-15 21:35:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-15 21:35:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2019-11-15 21:35:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 21:35:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2019-11-15 21:35:21,274 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 20 [2019-11-15 21:35:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:21,274 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2019-11-15 21:35:21,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:35:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2019-11-15 21:35:21,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 21:35:21,275 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:21,275 INFO L380 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] [2019-11-15 21:35:21,275 INFO L410 AbstractCegarLoop]: === Iteration 12 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:21,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:21,277 INFO L82 PathProgramCache]: Analyzing trace with hash 842532891, now seen corresponding path program 1 times [2019-11-15 21:35:21,277 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:21,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623163085] [2019-11-15 21:35:21,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:21,277 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:21,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:21,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623163085] [2019-11-15 21:35:21,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:35:21,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:35:21,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218112972] [2019-11-15 21:35:21,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:35:21,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:21,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:35:21,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:35:21,339 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 5 states. [2019-11-15 21:35:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:21,403 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-11-15 21:35:21,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:35:21,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-11-15 21:35:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:21,404 INFO L225 Difference]: With dead ends: 57 [2019-11-15 21:35:21,404 INFO L226 Difference]: Without dead ends: 34 [2019-11-15 21:35:21,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:35:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-15 21:35:21,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-15 21:35:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-15 21:35:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2019-11-15 21:35:21,408 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 24 [2019-11-15 21:35:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:21,408 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2019-11-15 21:35:21,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:35:21,408 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2019-11-15 21:35:21,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 21:35:21,409 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:21,409 INFO L380 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] [2019-11-15 21:35:21,409 INFO L410 AbstractCegarLoop]: === Iteration 13 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1168131629, now seen corresponding path program 1 times [2019-11-15 21:35:21,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:21,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409657608] [2019-11-15 21:35:21,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:21,410 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:21,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:21,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409657608] [2019-11-15 21:35:21,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062277172] [2019-11-15 21:35:21,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:21,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 21:35:21,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:21,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:21,764 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:21,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-15 21:35:21,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12388920] [2019-11-15 21:35:21,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 21:35:21,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:35:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:35:21,765 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 16 states. [2019-11-15 21:35:22,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:22,054 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-11-15 21:35:22,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:35:22,055 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 24 [2019-11-15 21:35:22,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:22,056 INFO L225 Difference]: With dead ends: 42 [2019-11-15 21:35:22,056 INFO L226 Difference]: Without dead ends: 40 [2019-11-15 21:35:22,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:35:22,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-15 21:35:22,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-15 21:35:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 21:35:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2019-11-15 21:35:22,059 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 24 [2019-11-15 21:35:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:22,059 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2019-11-15 21:35:22,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 21:35:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2019-11-15 21:35:22,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:35:22,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:22,061 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:22,263 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:22,264 INFO L410 AbstractCegarLoop]: === Iteration 14 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:22,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:22,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1984823745, now seen corresponding path program 2 times [2019-11-15 21:35:22,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:22,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845201271] [2019-11-15 21:35:22,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:22,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:22,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:22,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845201271] [2019-11-15 21:35:22,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606968852] [2019-11-15 21:35:22,603 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:22,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:35:22,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:22,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 21:35:22,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:22,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-15 21:35:22,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:22,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:22,777 INFO L496 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. [2019-11-15 21:35:22,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-11-15 21:35:22,967 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:22,967 INFO L375 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 18 treesize of output 18 [2019-11-15 21:35:22,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:35:22,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:22,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:35:22,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:22,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2019-11-15 21:35:23,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:35:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:23,129 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:23,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2019-11-15 21:35:23,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017628993] [2019-11-15 21:35:23,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 21:35:23,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:23,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 21:35:23,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:35:23,130 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 23 states. [2019-11-15 21:35:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:24,837 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-11-15 21:35:24,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 21:35:24,838 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2019-11-15 21:35:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:24,838 INFO L225 Difference]: With dead ends: 68 [2019-11-15 21:35:24,839 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 21:35:24,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=209, Invalid=1431, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 21:35:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 21:35:24,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-11-15 21:35:24,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 21:35:24,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-11-15 21:35:24,843 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 30 [2019-11-15 21:35:24,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:24,843 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-11-15 21:35:24,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 21:35:24,843 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-11-15 21:35:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-15 21:35:24,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:24,845 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:25,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:25,048 INFO L410 AbstractCegarLoop]: === Iteration 15 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:25,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:25,048 INFO L82 PathProgramCache]: Analyzing trace with hash -77155368, now seen corresponding path program 3 times [2019-11-15 21:35:25,048 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:25,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981273590] [2019-11-15 21:35:25,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:25,048 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:25,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:25,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981273590] [2019-11-15 21:35:25,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167742123] [2019-11-15 21:35:25,255 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:25,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 21:35:25,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:25,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-15 21:35:25,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:25,498 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-15 21:35:25,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:25,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:25,504 INFO L496 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. [2019-11-15 21:35:25,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 21:35:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:25,702 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:25,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2019-11-15 21:35:25,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072306769] [2019-11-15 21:35:25,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 21:35:25,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:25,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 21:35:25,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2019-11-15 21:35:25,704 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 25 states. [2019-11-15 21:35:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:26,444 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-11-15 21:35:26,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:35:26,445 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 40 [2019-11-15 21:35:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:26,446 INFO L225 Difference]: With dead ends: 76 [2019-11-15 21:35:26,446 INFO L226 Difference]: Without dead ends: 57 [2019-11-15 21:35:26,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 21:35:26,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-15 21:35:26,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-11-15 21:35:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-15 21:35:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2019-11-15 21:35:26,450 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 40 [2019-11-15 21:35:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:26,450 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2019-11-15 21:35:26,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 21:35:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2019-11-15 21:35:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-15 21:35:26,451 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:26,451 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:26,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:26,660 INFO L410 AbstractCegarLoop]: === Iteration 16 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:26,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash -488427557, now seen corresponding path program 4 times [2019-11-15 21:35:26,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:26,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670105457] [2019-11-15 21:35:26,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:26,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:26,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:26,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670105457] [2019-11-15 21:35:26,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76456117] [2019-11-15 21:35:26,835 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:26,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:35:26,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:26,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-15 21:35:26,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:26,998 INFO L375 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 6 treesize of output 5 [2019-11-15 21:35:26,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:27,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:27,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:27,004 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 21:35:27,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-15 21:35:27,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:27,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:27,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:27,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-15 21:35:27,197 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:27,197 INFO L375 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 19 treesize of output 19 [2019-11-15 21:35:27,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:35:27,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:27,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:27,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-11-15 21:35:27,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:35:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:27,386 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:27,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2019-11-15 21:35:27,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197825918] [2019-11-15 21:35:27,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 21:35:27,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:27,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 21:35:27,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2019-11-15 21:35:27,388 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 25 states. [2019-11-15 21:35:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:28,109 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-11-15 21:35:28,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:35:28,110 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-11-15 21:35:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:28,110 INFO L225 Difference]: With dead ends: 62 [2019-11-15 21:35:28,110 INFO L226 Difference]: Without dead ends: 60 [2019-11-15 21:35:28,111 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 21:35:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-15 21:35:28,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-15 21:35:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-15 21:35:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-15 21:35:28,114 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 44 [2019-11-15 21:35:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:28,115 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-15 21:35:28,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 21:35:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-15 21:35:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 21:35:28,116 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:28,116 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:28,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:28,320 INFO L410 AbstractCegarLoop]: === Iteration 17 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:28,320 INFO L82 PathProgramCache]: Analyzing trace with hash 444231919, now seen corresponding path program 5 times [2019-11-15 21:35:28,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:28,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835503272] [2019-11-15 21:35:28,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:28,320 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:28,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:28,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835503272] [2019-11-15 21:35:28,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061944437] [2019-11-15 21:35:28,627 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:28,768 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-11-15 21:35:28,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:28,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-15 21:35:28,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:28,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-15 21:35:28,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:28,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:28,947 INFO L496 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. [2019-11-15 21:35:28,947 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 21:35:29,113 INFO L375 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 15 treesize of output 7 [2019-11-15 21:35:29,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:29,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:29,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:29,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 21:35:29,130 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 13 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:29,131 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:29,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 26 [2019-11-15 21:35:29,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585817794] [2019-11-15 21:35:29,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 21:35:29,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:29,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 21:35:29,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2019-11-15 21:35:29,133 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 26 states. [2019-11-15 21:35:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:29,891 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-11-15 21:35:29,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:35:29,892 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-11-15 21:35:29,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:29,892 INFO L225 Difference]: With dead ends: 92 [2019-11-15 21:35:29,892 INFO L226 Difference]: Without dead ends: 67 [2019-11-15 21:35:29,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 21:35:29,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-15 21:35:29,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2019-11-15 21:35:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-15 21:35:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-11-15 21:35:29,898 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 50 [2019-11-15 21:35:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:29,903 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-11-15 21:35:29,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 21:35:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-11-15 21:35:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 21:35:29,905 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:29,905 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:30,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:30,109 INFO L410 AbstractCegarLoop]: === Iteration 18 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:30,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:30,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1547306290, now seen corresponding path program 6 times [2019-11-15 21:35:30,109 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:30,109 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765927385] [2019-11-15 21:35:30,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:30,109 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:30,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:30,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765927385] [2019-11-15 21:35:30,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927243692] [2019-11-15 21:35:30,334 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:30,476 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-15 21:35:30,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:30,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-15 21:35:30,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:30,490 INFO L375 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 6 treesize of output 5 [2019-11-15 21:35:30,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:30,495 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:30,496 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:30,496 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 21:35:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 15 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:30,773 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:30,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2019-11-15 21:35:30,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130083689] [2019-11-15 21:35:30,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 21:35:30,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:30,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 21:35:30,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-11-15 21:35:30,775 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 28 states. [2019-11-15 21:35:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:31,564 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2019-11-15 21:35:31,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:35:31,568 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-11-15 21:35:31,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:31,569 INFO L225 Difference]: With dead ends: 72 [2019-11-15 21:35:31,569 INFO L226 Difference]: Without dead ends: 70 [2019-11-15 21:35:31,570 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 21:35:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-15 21:35:31,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-15 21:35:31,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-15 21:35:31,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-15 21:35:31,575 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 54 [2019-11-15 21:35:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:31,576 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-15 21:35:31,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 21:35:31,576 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-15 21:35:31,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 21:35:31,577 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:31,578 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:31,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:31,780 INFO L410 AbstractCegarLoop]: === Iteration 19 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:31,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:31,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1155246342, now seen corresponding path program 7 times [2019-11-15 21:35:31,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:31,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920032871] [2019-11-15 21:35:31,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:31,781 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:31,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 17 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:32,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920032871] [2019-11-15 21:35:32,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233828645] [2019-11-15 21:35:32,085 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:32,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 21:35:32,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:32,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-15 21:35:32,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:32,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:32,426 INFO L496 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. [2019-11-15 21:35:32,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 21:35:32,608 INFO L375 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 15 treesize of output 7 [2019-11-15 21:35:32,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:32,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:32,611 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:32,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 21:35:32,619 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 17 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:32,619 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:32,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 29 [2019-11-15 21:35:32,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866426954] [2019-11-15 21:35:32,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 21:35:32,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:32,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 21:35:32,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2019-11-15 21:35:32,621 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 29 states. [2019-11-15 21:35:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:33,457 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-11-15 21:35:33,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:35:33,457 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2019-11-15 21:35:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:33,458 INFO L225 Difference]: With dead ends: 108 [2019-11-15 21:35:33,458 INFO L226 Difference]: Without dead ends: 77 [2019-11-15 21:35:33,459 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=1483, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 21:35:33,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-15 21:35:33,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2019-11-15 21:35:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 21:35:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-11-15 21:35:33,462 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 60 [2019-11-15 21:35:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:33,462 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-11-15 21:35:33,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 21:35:33,463 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-11-15 21:35:33,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 21:35:33,463 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:33,464 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:33,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:33,664 INFO L410 AbstractCegarLoop]: === Iteration 20 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:33,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:33,665 INFO L82 PathProgramCache]: Analyzing trace with hash -754121335, now seen corresponding path program 8 times [2019-11-15 21:35:33,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:33,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610401947] [2019-11-15 21:35:33,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:33,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:33,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 30 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:33,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610401947] [2019-11-15 21:35:33,934 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157046549] [2019-11-15 21:35:33,934 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:34,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:35:34,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:34,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 21:35:34,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:34,248 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:34,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 26 [2019-11-15 21:35:34,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377824537] [2019-11-15 21:35:34,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 21:35:34,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:34,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 21:35:34,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2019-11-15 21:35:34,250 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 27 states. [2019-11-15 21:35:34,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:34,958 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-11-15 21:35:34,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 21:35:34,959 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2019-11-15 21:35:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:34,959 INFO L225 Difference]: With dead ends: 82 [2019-11-15 21:35:34,959 INFO L226 Difference]: Without dead ends: 80 [2019-11-15 21:35:34,960 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 21:35:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-15 21:35:34,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-15 21:35:34,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-15 21:35:34,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-11-15 21:35:34,962 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 64 [2019-11-15 21:35:34,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:34,963 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-11-15 21:35:34,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 21:35:34,963 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-11-15 21:35:34,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-15 21:35:34,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:34,964 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:35,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:35,165 INFO L410 AbstractCegarLoop]: === Iteration 21 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:35,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:35,165 INFO L82 PathProgramCache]: Analyzing trace with hash 195873821, now seen corresponding path program 9 times [2019-11-15 21:35:35,165 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:35,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326593455] [2019-11-15 21:35:35,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:35,165 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:35,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:35,479 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:35,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326593455] [2019-11-15 21:35:35,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549310900] [2019-11-15 21:35:35,479 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:35,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-15 21:35:35,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:35,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-15 21:35:35,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:35,811 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-15 21:35:35,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:35,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:35,817 INFO L496 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. [2019-11-15 21:35:35,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 21:35:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 21 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:36,016 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:36,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 34 [2019-11-15 21:35:36,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711427786] [2019-11-15 21:35:36,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 21:35:36,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:36,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 21:35:36,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1039, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 21:35:36,018 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 34 states. [2019-11-15 21:35:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:37,239 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2019-11-15 21:35:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 21:35:37,240 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2019-11-15 21:35:37,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:37,240 INFO L225 Difference]: With dead ends: 124 [2019-11-15 21:35:37,240 INFO L226 Difference]: Without dead ends: 87 [2019-11-15 21:35:37,241 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=1980, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 21:35:37,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-15 21:35:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2019-11-15 21:35:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-15 21:35:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-11-15 21:35:37,243 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 70 [2019-11-15 21:35:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:37,244 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-11-15 21:35:37,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 21:35:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-11-15 21:35:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 21:35:37,246 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:37,246 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:37,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:37,448 INFO L410 AbstractCegarLoop]: === Iteration 22 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:37,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:37,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1310547744, now seen corresponding path program 10 times [2019-11-15 21:35:37,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:37,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281370491] [2019-11-15 21:35:37,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:37,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:37,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:37,779 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 47 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:37,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281370491] [2019-11-15 21:35:37,779 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138383276] [2019-11-15 21:35:37,779 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:37,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:35:37,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:37,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-15 21:35:37,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:37,899 INFO L375 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 6 treesize of output 5 [2019-11-15 21:35:37,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:37,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:37,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:37,904 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 21:35:37,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-15 21:35:37,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:37,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:37,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:37,945 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-15 21:35:38,237 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:38,238 INFO L375 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 19 treesize of output 19 [2019-11-15 21:35:38,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:35:38,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:38,246 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:38,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-11-15 21:35:38,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:35:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 50 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:38,406 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:38,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 33 [2019-11-15 21:35:38,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324627991] [2019-11-15 21:35:38,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 21:35:38,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 21:35:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 21:35:38,407 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 34 states. [2019-11-15 21:35:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:39,750 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2019-11-15 21:35:39,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:35:39,752 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 74 [2019-11-15 21:35:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:39,753 INFO L225 Difference]: With dead ends: 92 [2019-11-15 21:35:39,753 INFO L226 Difference]: Without dead ends: 90 [2019-11-15 21:35:39,754 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=1860, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 21:35:39,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-15 21:35:39,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-11-15 21:35:39,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-15 21:35:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2019-11-15 21:35:39,756 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 74 [2019-11-15 21:35:39,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:39,757 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2019-11-15 21:35:39,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 21:35:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2019-11-15 21:35:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 21:35:39,758 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:39,758 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:39,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:39,960 INFO L410 AbstractCegarLoop]: === Iteration 23 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash 383797812, now seen corresponding path program 11 times [2019-11-15 21:35:39,961 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:39,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052343597] [2019-11-15 21:35:39,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:39,961 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:39,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 25 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:40,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052343597] [2019-11-15 21:35:40,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775603464] [2019-11-15 21:35:40,367 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:40,550 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-15 21:35:40,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:40,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-15 21:35:40,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:40,792 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-15 21:35:40,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:40,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:40,797 INFO L496 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. [2019-11-15 21:35:40,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 21:35:40,966 INFO L375 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 15 treesize of output 7 [2019-11-15 21:35:40,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:40,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:40,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:40,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 21:35:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 25 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:40,985 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:40,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 35 [2019-11-15 21:35:40,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23105792] [2019-11-15 21:35:40,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 21:35:40,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:40,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 21:35:40,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1108, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 21:35:40,988 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 35 states. [2019-11-15 21:35:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:42,146 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2019-11-15 21:35:42,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 21:35:42,147 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 80 [2019-11-15 21:35:42,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:42,147 INFO L225 Difference]: With dead ends: 140 [2019-11-15 21:35:42,147 INFO L226 Difference]: Without dead ends: 97 [2019-11-15 21:35:42,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2019-11-15 21:35:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-11-15 21:35:42,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2019-11-15 21:35:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-15 21:35:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-11-15 21:35:42,151 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 80 [2019-11-15 21:35:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:42,151 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-11-15 21:35:42,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 21:35:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-11-15 21:35:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-15 21:35:42,152 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:42,152 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:42,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:42,357 INFO L410 AbstractCegarLoop]: === Iteration 24 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:42,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:42,357 INFO L82 PathProgramCache]: Analyzing trace with hash 219236151, now seen corresponding path program 12 times [2019-11-15 21:35:42,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:42,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320964510] [2019-11-15 21:35:42,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:42,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:42,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 68 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:42,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320964510] [2019-11-15 21:35:42,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344555756] [2019-11-15 21:35:42,739 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:42,887 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-11-15 21:35:42,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:42,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 21:35:42,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:42,895 INFO L375 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 6 treesize of output 5 [2019-11-15 21:35:42,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:42,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:42,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:42,900 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 21:35:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 66 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:43,495 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:43,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2019-11-15 21:35:43,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448924452] [2019-11-15 21:35:43,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 21:35:43,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:43,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 21:35:43,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1371, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 21:35:43,497 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 40 states. [2019-11-15 21:35:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:44,429 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2019-11-15 21:35:44,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:35:44,430 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2019-11-15 21:35:44,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:44,431 INFO L225 Difference]: With dead ends: 102 [2019-11-15 21:35:44,431 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 21:35:44,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=312, Invalid=2138, Unknown=0, NotChecked=0, Total=2450 [2019-11-15 21:35:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 21:35:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-15 21:35:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-15 21:35:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-11-15 21:35:44,434 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 84 [2019-11-15 21:35:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:44,434 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-11-15 21:35:44,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 21:35:44,435 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-11-15 21:35:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 21:35:44,435 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:44,435 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:44,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:44,636 INFO L410 AbstractCegarLoop]: === Iteration 25 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:44,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:44,637 INFO L82 PathProgramCache]: Analyzing trace with hash 473469771, now seen corresponding path program 13 times [2019-11-15 21:35:44,637 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:44,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705096760] [2019-11-15 21:35:44,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:44,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:44,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 29 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:45,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705096760] [2019-11-15 21:35:45,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49975452] [2019-11-15 21:35:45,235 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:45,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-15 21:35:45,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:45,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-15 21:35:45,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:45,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:45,653 INFO L496 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. [2019-11-15 21:35:45,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 21:35:45,865 INFO L375 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 15 treesize of output 7 [2019-11-15 21:35:45,865 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:45,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:45,868 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:45,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 21:35:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 29 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:45,888 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:45,888 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 38 [2019-11-15 21:35:45,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980380551] [2019-11-15 21:35:45,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-15 21:35:45,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:45,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-15 21:35:45,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1317, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 21:35:45,891 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 38 states. [2019-11-15 21:35:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:47,493 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-11-15 21:35:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 21:35:47,493 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 90 [2019-11-15 21:35:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:47,494 INFO L225 Difference]: With dead ends: 156 [2019-11-15 21:35:47,494 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 21:35:47,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=199, Invalid=2557, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 21:35:47,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 21:35:47,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2019-11-15 21:35:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 21:35:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-11-15 21:35:47,498 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 90 [2019-11-15 21:35:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:47,498 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-11-15 21:35:47,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-15 21:35:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-11-15 21:35:47,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 21:35:47,499 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:47,499 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:47,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:47,702 INFO L410 AbstractCegarLoop]: === Iteration 26 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:47,703 INFO L82 PathProgramCache]: Analyzing trace with hash -641767282, now seen corresponding path program 14 times [2019-11-15 21:35:47,703 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:47,703 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748134532] [2019-11-15 21:35:47,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:47,703 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:47,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 93 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:48,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748134532] [2019-11-15 21:35:48,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880873785] [2019-11-15 21:35:48,078 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:48,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:35:48,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:48,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-15 21:35:48,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 91 proven. 205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:48,623 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:48,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 35 [2019-11-15 21:35:48,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604769968] [2019-11-15 21:35:48,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-15 21:35:48,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:48,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-15 21:35:48,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 21:35:48,625 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 36 states. [2019-11-15 21:35:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:49,642 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-11-15 21:35:49,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 21:35:49,643 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 94 [2019-11-15 21:35:49,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:49,644 INFO L225 Difference]: With dead ends: 112 [2019-11-15 21:35:49,644 INFO L226 Difference]: Without dead ends: 110 [2019-11-15 21:35:49,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=268, Invalid=1894, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 21:35:49,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-15 21:35:49,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-15 21:35:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 21:35:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-11-15 21:35:49,648 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 94 [2019-11-15 21:35:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:49,648 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-11-15 21:35:49,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-15 21:35:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-11-15 21:35:49,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 21:35:49,649 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:49,649 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:49,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:49,859 INFO L410 AbstractCegarLoop]: === Iteration 27 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:49,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash -699918494, now seen corresponding path program 15 times [2019-11-15 21:35:49,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:49,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344077135] [2019-11-15 21:35:49,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:49,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:49,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 33 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:50,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344077135] [2019-11-15 21:35:50,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755167756] [2019-11-15 21:35:50,500 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:50,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-15 21:35:50,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:50,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-15 21:35:50,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:51,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-15 21:35:51,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:51,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:51,011 INFO L496 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. [2019-11-15 21:35:51,011 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 21:35:51,177 INFO L375 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 15 treesize of output 7 [2019-11-15 21:35:51,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:51,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:51,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:51,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 21:35:51,194 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 33 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:51,194 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:51,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 41 [2019-11-15 21:35:51,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716051544] [2019-11-15 21:35:51,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-15 21:35:51,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:51,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-15 21:35:51,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1544, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 21:35:51,196 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 41 states. [2019-11-15 21:35:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:53,214 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2019-11-15 21:35:53,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 21:35:53,215 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 100 [2019-11-15 21:35:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:53,216 INFO L225 Difference]: With dead ends: 172 [2019-11-15 21:35:53,216 INFO L226 Difference]: Without dead ends: 117 [2019-11-15 21:35:53,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=213, Invalid=2979, Unknown=0, NotChecked=0, Total=3192 [2019-11-15 21:35:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-15 21:35:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-11-15 21:35:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 21:35:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-11-15 21:35:53,220 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 100 [2019-11-15 21:35:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:53,220 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-11-15 21:35:53,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-15 21:35:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-11-15 21:35:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 21:35:53,222 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:53,222 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:53,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:53,422 INFO L410 AbstractCegarLoop]: === Iteration 28 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:53,423 INFO L82 PathProgramCache]: Analyzing trace with hash 618886373, now seen corresponding path program 16 times [2019-11-15 21:35:53,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:53,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781856109] [2019-11-15 21:35:53,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:53,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:53,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 122 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:53,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781856109] [2019-11-15 21:35:53,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002032206] [2019-11-15 21:35:53,966 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:54,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:35:54,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:54,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 66 conjunts are in the unsatisfiable core [2019-11-15 21:35:54,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:54,151 INFO L375 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 6 treesize of output 5 [2019-11-15 21:35:54,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:54,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:54,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:54,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 21:35:54,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-15 21:35:54,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:54,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:54,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:54,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-15 21:35:54,761 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:54,762 INFO L375 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 19 treesize of output 19 [2019-11-15 21:35:54,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:35:54,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:54,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:54,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-11-15 21:35:54,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:35:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 128 proven. 250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:55,000 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:55,000 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 42 [2019-11-15 21:35:55,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890243996] [2019-11-15 21:35:55,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-15 21:35:55,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:55,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-15 21:35:55,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1669, Unknown=0, NotChecked=0, Total=1806 [2019-11-15 21:35:55,002 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 43 states. [2019-11-15 21:35:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:35:57,018 INFO L93 Difference]: Finished difference Result 122 states and 125 transitions. [2019-11-15 21:35:57,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 21:35:57,019 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 104 [2019-11-15 21:35:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:35:57,019 INFO L225 Difference]: With dead ends: 122 [2019-11-15 21:35:57,019 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 21:35:57,020 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=288, Invalid=3018, Unknown=0, NotChecked=0, Total=3306 [2019-11-15 21:35:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 21:35:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-11-15 21:35:57,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 21:35:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-11-15 21:35:57,024 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 104 [2019-11-15 21:35:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:35:57,024 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-11-15 21:35:57,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-15 21:35:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-11-15 21:35:57,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-15 21:35:57,025 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:35:57,026 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:35:57,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:57,229 INFO L410 AbstractCegarLoop]: === Iteration 29 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:35:57,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:35:57,229 INFO L82 PathProgramCache]: Analyzing trace with hash -76462471, now seen corresponding path program 17 times [2019-11-15 21:35:57,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:35:57,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40079503] [2019-11-15 21:35:57,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:57,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:35:57,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:35:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:35:57,803 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 37 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:57,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40079503] [2019-11-15 21:35:57,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139596869] [2019-11-15 21:35:57,803 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:35:57,972 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-15 21:35:57,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:35:57,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 70 conjunts are in the unsatisfiable core [2019-11-15 21:35:57,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:35:58,363 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-15 21:35:58,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:58,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:58,368 INFO L496 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. [2019-11-15 21:35:58,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:17 [2019-11-15 21:35:58,560 INFO L375 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 15 treesize of output 7 [2019-11-15 21:35:58,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:35:58,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:35:58,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:35:58,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-15 21:35:58,581 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 37 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:35:58,581 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:35:58,581 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 44 [2019-11-15 21:35:58,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326624693] [2019-11-15 21:35:58,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-15 21:35:58,582 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:35:58,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-15 21:35:58,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1789, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 21:35:58,583 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 44 states. [2019-11-15 21:36:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:36:00,548 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2019-11-15 21:36:00,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 21:36:00,548 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 110 [2019-11-15 21:36:00,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:36:00,549 INFO L225 Difference]: With dead ends: 188 [2019-11-15 21:36:00,549 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 21:36:00,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=227, Invalid=3433, Unknown=0, NotChecked=0, Total=3660 [2019-11-15 21:36:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 21:36:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2019-11-15 21:36:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 21:36:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2019-11-15 21:36:00,553 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 110 [2019-11-15 21:36:00,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:36:00,553 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2019-11-15 21:36:00,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-15 21:36:00,553 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2019-11-15 21:36:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-15 21:36:00,554 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:36:00,554 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:36:00,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:36:00,758 INFO L410 AbstractCegarLoop]: === Iteration 30 === [cstrchrErr4REQUIRES_VIOLATION, cstrchrErr3REQUIRES_VIOLATION, cstrchrErr5REQUIRES_VIOLATION, cstrchrErr0REQUIRES_VIOLATION, cstrchrErr1REQUIRES_VIOLATION, cstrchrErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2019-11-15 21:36:00,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:36:00,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1245961276, now seen corresponding path program 18 times [2019-11-15 21:36:00,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:36:00,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666793774] [2019-11-15 21:36:00,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:00,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:36:00,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:36:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:36:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:36:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 155 proven. 315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:36:01,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666793774] [2019-11-15 21:36:01,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115139579] [2019-11-15 21:36:01,411 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:36:01,707 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-11-15 21:36:01,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:36:01,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 21:36:01,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:36:01,714 INFO L375 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 6 treesize of output 5 [2019-11-15 21:36:01,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:01,717 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:01,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:36:01,718 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 21:36:01,729 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2019-11-15 21:36:01,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:36:01,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:01,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:36:01,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-15 21:36:01,843 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:01,843 INFO L375 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 19 treesize of output 19 [2019-11-15 21:36:01,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:36:01,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:36:01,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 21:36:01,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2019-11-15 21:36:01,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:36:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 415 trivial. 0 not checked. [2019-11-15 21:36:02,049 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:36:02,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10] total 35 [2019-11-15 21:36:02,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450863309] [2019-11-15 21:36:02,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-15 21:36:02,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:36:02,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-15 21:36:02,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 21:36:02,050 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 36 states. [2019-11-15 21:36:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:36:03,394 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2019-11-15 21:36:03,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 21:36:03,395 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 114 [2019-11-15 21:36:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:36:03,395 INFO L225 Difference]: With dead ends: 122 [2019-11-15 21:36:03,395 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:36:03,396 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=398, Invalid=2358, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 21:36:03,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:36:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:36:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:36:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:36:03,397 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 114 [2019-11-15 21:36:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:36:03,397 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:36:03,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-15 21:36:03,397 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:36:03,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:36:03,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:36:03,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:36:03 BoogieIcfgContainer [2019-11-15 21:36:03,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:36:03,603 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:36:03,603 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:36:03,603 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:36:03,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:35:17" (3/4) ... [2019-11-15 21:36:03,606 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:36:03,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure cstrchr [2019-11-15 21:36:03,613 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-15 21:36:03,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-15 21:36:03,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-15 21:36:03,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-15 21:36:03,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-15 21:36:03,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-15 21:36:03,614 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-15 21:36:03,633 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-15 21:36:03,633 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-15 21:36:03,634 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 21:36:03,671 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_33ed52a9-b221-4411-8fa1-c1172b5ae013/bin/uautomizer/witness.graphml [2019-11-15 21:36:03,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:36:03,673 INFO L168 Benchmark]: Toolchain (without parser) took 47186.73 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 533.7 MB). Free memory was 938.0 MB in the beginning and 1.2 GB in the end (delta: -284.6 MB). Peak memory consumption was 249.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:36:03,673 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:36:03,673 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:36:03,674 INFO L168 Benchmark]: Boogie Preprocessor took 90.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:36:03,674 INFO L168 Benchmark]: RCFGBuilder took 499.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:36:03,675 INFO L168 Benchmark]: TraceAbstraction took 46072.24 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 397.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -158.0 MB). Peak memory consumption was 240.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:36:03,675 INFO L168 Benchmark]: Witness Printer took 69.16 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:36:03,677 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 451.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 499.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46072.24 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 397.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -158.0 MB). Peak memory consumption was 240.0 MB. Max. memory is 11.5 GB. * Witness Printer took 69.16 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 516]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 516]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 516]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 516]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 529]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 58 locations, 11 error locations. Result: SAFE, OverallTime: 46.0s, OverallIterations: 30, TraceHistogramMax: 10, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 952 SDtfs, 3308 SDslu, 4248 SDs, 0 SdLazy, 25299 SolverSat, 556 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 13.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1994 GetRequests, 1131 SyntacticMatches, 24 SemanticMatches, 839 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5525 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 77 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 2760 NumberOfCodeBlocks, 2718 NumberOfCodeBlocksAsserted, 112 NumberOfCheckSat, 2711 ConstructedInterpolants, 82 QuantifiedInterpolants, 2024485 SizeOfPredicates, 134 NumberOfNonLiveVariables, 4431 ConjunctsInSsa, 816 ConjunctsInUnsatCore, 49 InterpolantComputations, 11 PerfectInterpolantSequences, 1720/6637 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...