./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0019-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0019-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/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 4494187e77773a0836e533a199cc56d858d4efc9 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:49:23,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:49:23,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:49:23,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:49:23,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:49:23,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:49:23,202 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:49:23,203 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:49:23,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:49:23,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:49:23,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:49:23,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:49:23,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:49:23,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:49:23,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:49:23,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:49:23,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:49:23,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:49:23,211 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:49:23,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:49:23,213 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:49:23,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:49:23,215 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:49:23,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:49:23,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:49:23,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:49:23,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:49:23,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:49:23,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:49:23,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:49:23,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:49:23,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:49:23,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:49:23,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:49:23,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:49:23,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:49:23,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:49:23,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:49:23,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:49:23,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:49:23,223 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:49:23,224 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 11:49:23,234 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:49:23,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:49:23,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:49:23,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:49:23,235 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:49:23,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:49:23,235 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:49:23,235 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:49:23,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:49:23,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:49:23,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:49:23,236 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 11:49:23,236 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 11:49:23,236 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 11:49:23,236 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:49:23,236 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:49:23,236 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:49:23,236 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:49:23,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:49:23,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:49:23,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:49:23,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:49:23,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:49:23,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:49:23,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:49:23,237 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:49:23,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:49:23,238 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:49:23,238 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_36ae325b-cc40-437f-96a9-1be439acb5ee/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 -> 4494187e77773a0836e533a199cc56d858d4efc9 [2019-12-07 11:49:23,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:49:23,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:49:23,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:49:23,347 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:49:23,348 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:49:23,348 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-0019-1.i [2019-12-07 11:49:23,385 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/bin/uautomizer/data/d600ea334/d4f43ca2152842f7b70a3f3b471eb94c/FLAGf43443379 [2019-12-07 11:49:23,834 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:49:23,835 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/sv-benchmarks/c/memsafety/test-0019-1.i [2019-12-07 11:49:23,844 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/bin/uautomizer/data/d600ea334/d4f43ca2152842f7b70a3f3b471eb94c/FLAGf43443379 [2019-12-07 11:49:23,853 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/bin/uautomizer/data/d600ea334/d4f43ca2152842f7b70a3f3b471eb94c [2019-12-07 11:49:23,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:49:23,856 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 11:49:23,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:49:23,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:49:23,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:49:23,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:49:23" (1/1) ... [2019-12-07 11:49:23,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:23, skipping insertion in model container [2019-12-07 11:49:23,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:49:23" (1/1) ... [2019-12-07 11:49:23,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:49:23,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:49:24,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:49:24,099 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:49:24,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:49:24,161 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:49:24,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:24 WrapperNode [2019-12-07 11:49:24,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:49:24,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:49:24,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:49:24,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:49:24,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:24" (1/1) ... [2019-12-07 11:49:24,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:24" (1/1) ... [2019-12-07 11:49:24,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:24" (1/1) ... [2019-12-07 11:49:24,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:24" (1/1) ... [2019-12-07 11:49:24,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:24" (1/1) ... [2019-12-07 11:49:24,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:24" (1/1) ... [2019-12-07 11:49:24,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:24" (1/1) ... [2019-12-07 11:49:24,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:49:24,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:49:24,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:49:24,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:49:24,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/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-12-07 11:49:24,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 11:49:24,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:49:24,236 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 11:49:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 11:49:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 11:49:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 11:49:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 11:49:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-12-07 11:49:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-12-07 11:49:24,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 11:49:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-12-07 11:49:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 11:49:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 11:49:24,237 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 11:49:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 11:49:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 11:49:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 11:49:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 11:49:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 11:49:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 11:49:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 11:49:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 11:49:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 11:49:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 11:49:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 11:49:24,238 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 11:49:24,239 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 11:49:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 11:49:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 11:49:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 11:49:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 11:49:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 11:49:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 11:49:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 11:49:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 11:49:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 11:49:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 11:49:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 11:49:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 11:49:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 11:49:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 11:49:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 11:49:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 11:49:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 11:49:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 11:49:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 11:49:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 11:49:24,242 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 11:49:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 11:49:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 11:49:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 11:49:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 11:49:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 11:49:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 11:49:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 11:49:24,243 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 11:49:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 11:49:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 11:49:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 11:49:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 11:49:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 11:49:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 11:49:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 11:49:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 11:49:24,244 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 11:49:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 11:49:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 11:49:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 11:49:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 11:49:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 11:49:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 11:49:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 11:49:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 11:49:24,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 11:49:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 11:49:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 11:49:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 11:49:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 11:49:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 11:49:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 11:49:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 11:49:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 11:49:24,246 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 11:49:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 11:49:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 11:49:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 11:49:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 11:49:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 11:49:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 11:49:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 11:49:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 11:49:24,247 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 11:49:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 11:49:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-12-07 11:49:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:49:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:49:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-12-07 11:49:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:49:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:49:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:49:24,248 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 11:49:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 11:49:24,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:49:24,511 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:49:24,511 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2019-12-07 11:49:24,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:49:24 BoogieIcfgContainer [2019-12-07 11:49:24,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:49:24,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:49:24,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:49:24,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:49:24,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:49:23" (1/3) ... [2019-12-07 11:49:24,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6b1036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:49:24, skipping insertion in model container [2019-12-07 11:49:24,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:24" (2/3) ... [2019-12-07 11:49:24,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6b1036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:49:24, skipping insertion in model container [2019-12-07 11:49:24,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:49:24" (3/3) ... [2019-12-07 11:49:24,516 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019-1.i [2019-12-07 11:49:24,522 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:49:24,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 11:49:24,534 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 11:49:24,546 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:49:24,546 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 11:49:24,546 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:49:24,547 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:49:24,547 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:49:24,547 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:49:24,547 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:49:24,547 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:49:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-12-07 11:49:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:49:24,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:24,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:24,564 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:24,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash 163875527, now seen corresponding path program 1 times [2019-12-07 11:49:24,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:24,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483770017] [2019-12-07 11:49:24,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:24,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483770017] [2019-12-07 11:49:24,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:24,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:49:24,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789937118] [2019-12-07 11:49:24,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:49:24,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:24,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:49:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:49:24,741 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 6 states. [2019-12-07 11:49:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:24,890 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-12-07 11:49:24,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:49:24,891 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 11:49:24,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:24,898 INFO L225 Difference]: With dead ends: 56 [2019-12-07 11:49:24,898 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 11:49:24,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 11:49:24,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-12-07 11:49:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 11:49:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-12-07 11:49:24,927 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 9 [2019-12-07 11:49:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:24,928 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-12-07 11:49:24,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:49:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-12-07 11:49:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 11:49:24,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:24,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:24,928 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash 163875528, now seen corresponding path program 1 times [2019-12-07 11:49:24,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:24,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849054104] [2019-12-07 11:49:24,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:25,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849054104] [2019-12-07 11:49:25,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:25,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:49:25,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90372935] [2019-12-07 11:49:25,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:49:25,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:25,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:49:25,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:49:25,014 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 6 states. [2019-12-07 11:49:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:25,140 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-12-07 11:49:25,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:49:25,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-12-07 11:49:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:25,142 INFO L225 Difference]: With dead ends: 50 [2019-12-07 11:49:25,142 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 11:49:25,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 11:49:25,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-07 11:49:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 11:49:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-12-07 11:49:25,149 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 9 [2019-12-07 11:49:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:25,149 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-12-07 11:49:25,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:49:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-12-07 11:49:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:49:25,150 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:25,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:25,150 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:25,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:25,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1429408695, now seen corresponding path program 1 times [2019-12-07 11:49:25,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:25,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100313754] [2019-12-07 11:49:25,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:25,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100313754] [2019-12-07 11:49:25,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:25,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:49:25,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874915033] [2019-12-07 11:49:25,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:49:25,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:25,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:49:25,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:49:25,240 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 7 states. [2019-12-07 11:49:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:25,349 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-12-07 11:49:25,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:49:25,349 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-07 11:49:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:25,350 INFO L225 Difference]: With dead ends: 49 [2019-12-07 11:49:25,350 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 11:49:25,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:49:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 11:49:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-12-07 11:49:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-07 11:49:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-12-07 11:49:25,355 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 11 [2019-12-07 11:49:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:25,355 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-12-07 11:49:25,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:49:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-12-07 11:49:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:49:25,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:25,356 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:25,356 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:25,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:25,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2056472042, now seen corresponding path program 1 times [2019-12-07 11:49:25,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:25,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745487406] [2019-12-07 11:49:25,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:25,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745487406] [2019-12-07 11:49:25,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:25,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:49:25,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678697895] [2019-12-07 11:49:25,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:49:25,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:25,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:49:25,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:49:25,418 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2019-12-07 11:49:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:25,501 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-12-07 11:49:25,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:49:25,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 11:49:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:25,502 INFO L225 Difference]: With dead ends: 45 [2019-12-07 11:49:25,502 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 11:49:25,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-12-07 11:49:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 11:49:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-12-07 11:49:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 11:49:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-12-07 11:49:25,506 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 18 [2019-12-07 11:49:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:25,506 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-12-07 11:49:25,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:49:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-12-07 11:49:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:49:25,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:25,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:25,507 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:25,508 INFO L82 PathProgramCache]: Analyzing trace with hash -2056472043, now seen corresponding path program 1 times [2019-12-07 11:49:25,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:25,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282528849] [2019-12-07 11:49:25,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:25,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282528849] [2019-12-07 11:49:25,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:25,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:49:25,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484788948] [2019-12-07 11:49:25,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:49:25,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:25,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:49:25,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:49:25,553 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 5 states. [2019-12-07 11:49:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:25,622 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-12-07 11:49:25,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:49:25,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-12-07 11:49:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:25,623 INFO L225 Difference]: With dead ends: 41 [2019-12-07 11:49:25,624 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 11:49:25,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-12-07 11:49:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 11:49:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 11:49:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 11:49:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-12-07 11:49:25,627 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 18 [2019-12-07 11:49:25,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:25,628 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-12-07 11:49:25,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:49:25,628 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-12-07 11:49:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:49:25,628 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:25,628 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:25,629 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:25,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:25,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1835398156, now seen corresponding path program 1 times [2019-12-07 11:49:25,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:25,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238153631] [2019-12-07 11:49:25,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:25,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238153631] [2019-12-07 11:49:25,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:25,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 11:49:25,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420773928] [2019-12-07 11:49:25,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:49:25,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:25,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:49:25,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:49:25,822 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 13 states. [2019-12-07 11:49:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:26,042 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-12-07 11:49:26,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 11:49:26,043 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-12-07 11:49:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:26,043 INFO L225 Difference]: With dead ends: 40 [2019-12-07 11:49:26,043 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 11:49:26,044 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:49:26,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 11:49:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-07 11:49:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 11:49:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-12-07 11:49:26,047 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 25 [2019-12-07 11:49:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:26,047 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-12-07 11:49:26,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:49:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-12-07 11:49:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:49:26,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:26,048 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:26,048 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:26,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:26,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1062767907, now seen corresponding path program 1 times [2019-12-07 11:49:26,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:26,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257818737] [2019-12-07 11:49:26,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:26,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257818737] [2019-12-07 11:49:26,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:26,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 11:49:26,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106031782] [2019-12-07 11:49:26,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:49:26,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:26,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:49:26,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:49:26,194 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 13 states. [2019-12-07 11:49:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:26,421 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-12-07 11:49:26,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 11:49:26,421 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-12-07 11:49:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:26,421 INFO L225 Difference]: With dead ends: 39 [2019-12-07 11:49:26,422 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 11:49:26,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:49:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 11:49:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-12-07 11:49:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 11:49:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-12-07 11:49:26,424 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 26 [2019-12-07 11:49:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:26,425 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-12-07 11:49:26,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:49:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-12-07 11:49:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:49:26,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:26,425 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:26,426 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:26,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:26,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1413933334, now seen corresponding path program 1 times [2019-12-07 11:49:26,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:26,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382661155] [2019-12-07 11:49:26,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:26,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382661155] [2019-12-07 11:49:26,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:26,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 11:49:26,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638077674] [2019-12-07 11:49:26,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:49:26,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:26,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:49:26,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:49:26,607 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 14 states. [2019-12-07 11:49:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:26,853 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-12-07 11:49:26,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:49:26,853 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-12-07 11:49:26,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:26,854 INFO L225 Difference]: With dead ends: 38 [2019-12-07 11:49:26,854 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 11:49:26,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:49:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 11:49:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 11:49:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 11:49:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-12-07 11:49:26,856 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 27 [2019-12-07 11:49:26,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:26,857 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-12-07 11:49:26,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:49:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-12-07 11:49:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:49:26,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:26,857 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:26,858 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:26,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:26,858 INFO L82 PathProgramCache]: Analyzing trace with hash 881682728, now seen corresponding path program 1 times [2019-12-07 11:49:26,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:26,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126605169] [2019-12-07 11:49:26,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:27,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126605169] [2019-12-07 11:49:27,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:27,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 11:49:27,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344308493] [2019-12-07 11:49:27,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:49:27,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:27,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:49:27,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:49:27,108 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 19 states. [2019-12-07 11:49:27,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:27,503 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2019-12-07 11:49:27,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 11:49:27,504 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-12-07 11:49:27,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:27,504 INFO L225 Difference]: With dead ends: 40 [2019-12-07 11:49:27,504 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 11:49:27,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2019-12-07 11:49:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 11:49:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-07 11:49:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 11:49:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 37 transitions. [2019-12-07 11:49:27,507 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 37 transitions. Word has length 28 [2019-12-07 11:49:27,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:27,507 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 37 transitions. [2019-12-07 11:49:27,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:49:27,507 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 37 transitions. [2019-12-07 11:49:27,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:49:27,508 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:27,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:27,508 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:27,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:27,508 INFO L82 PathProgramCache]: Analyzing trace with hash 882260479, now seen corresponding path program 1 times [2019-12-07 11:49:27,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:27,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389031123] [2019-12-07 11:49:27,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:27,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389031123] [2019-12-07 11:49:27,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:27,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 11:49:27,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109906685] [2019-12-07 11:49:27,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:49:27,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:27,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:49:27,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:49:27,630 INFO L87 Difference]: Start difference. First operand 38 states and 37 transitions. Second operand 14 states. [2019-12-07 11:49:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:27,831 INFO L93 Difference]: Finished difference Result 37 states and 36 transitions. [2019-12-07 11:49:27,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:49:27,831 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-12-07 11:49:27,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:27,832 INFO L225 Difference]: With dead ends: 37 [2019-12-07 11:49:27,832 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 11:49:27,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:49:27,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 11:49:27,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-12-07 11:49:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 11:49:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 36 transitions. [2019-12-07 11:49:27,834 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 36 transitions. Word has length 28 [2019-12-07 11:49:27,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:27,834 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 36 transitions. [2019-12-07 11:49:27,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:49:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 36 transitions. [2019-12-07 11:49:27,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:49:27,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:27,835 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:27,835 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:27,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:27,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1580271160, now seen corresponding path program 1 times [2019-12-07 11:49:27,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:27,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539058104] [2019-12-07 11:49:27,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:27,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539058104] [2019-12-07 11:49:27,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:27,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 11:49:27,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726710666] [2019-12-07 11:49:27,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:49:27,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:27,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:49:27,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:49:27,959 INFO L87 Difference]: Start difference. First operand 37 states and 36 transitions. Second operand 14 states. [2019-12-07 11:49:28,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:28,191 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-12-07 11:49:28,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:49:28,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-12-07 11:49:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:28,191 INFO L225 Difference]: With dead ends: 36 [2019-12-07 11:49:28,192 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 11:49:28,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:49:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 11:49:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 11:49:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 11:49:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 35 transitions. [2019-12-07 11:49:28,194 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 35 transitions. Word has length 29 [2019-12-07 11:49:28,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:28,194 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 35 transitions. [2019-12-07 11:49:28,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:49:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 35 transitions. [2019-12-07 11:49:28,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:49:28,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:28,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:28,195 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:28,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:28,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1743765793, now seen corresponding path program 1 times [2019-12-07 11:49:28,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:28,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674212043] [2019-12-07 11:49:28,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:28,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674212043] [2019-12-07 11:49:28,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:28,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 11:49:28,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408696157] [2019-12-07 11:49:28,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:49:28,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:28,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:49:28,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:49:28,467 INFO L87 Difference]: Start difference. First operand 36 states and 35 transitions. Second operand 20 states. [2019-12-07 11:49:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:29,600 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2019-12-07 11:49:29,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 11:49:29,601 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-12-07 11:49:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:29,602 INFO L225 Difference]: With dead ends: 35 [2019-12-07 11:49:29,602 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 11:49:29,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=1052, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 11:49:29,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 11:49:29,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-12-07 11:49:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 11:49:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2019-12-07 11:49:29,609 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 30 [2019-12-07 11:49:29,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:29,609 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2019-12-07 11:49:29,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:49:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2019-12-07 11:49:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:49:29,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:29,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:29,612 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 11:49:29,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:29,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2049094415, now seen corresponding path program 1 times [2019-12-07 11:49:29,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:29,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454012036] [2019-12-07 11:49:29,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:30,814 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2019-12-07 11:49:31,147 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-12-07 11:49:31,388 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-12-07 11:49:31,631 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-12-07 11:49:31,863 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-12-07 11:49:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:32,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454012036] [2019-12-07 11:49:32,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:32,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-12-07 11:49:32,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296525200] [2019-12-07 11:49:32,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 11:49:32,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:32,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 11:49:32,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:49:32,170 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand 27 states. [2019-12-07 11:49:33,475 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-12-07 11:49:33,764 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2019-12-07 11:49:33,920 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-12-07 11:49:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:34,010 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2019-12-07 11:49:34,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 11:49:34,011 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-12-07 11:49:34,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:34,011 INFO L225 Difference]: With dead ends: 34 [2019-12-07 11:49:34,011 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:49:34,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=165, Invalid=1475, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 11:49:34,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:49:34,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:49:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:49:34,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:49:34,012 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2019-12-07 11:49:34,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:34,012 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:49:34,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 11:49:34,012 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:49:34,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:49:34,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:49:34 BoogieIcfgContainer [2019-12-07 11:49:34,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:49:34,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:49:34,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:49:34,016 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:49:34,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:49:24" (3/4) ... [2019-12-07 11:49:34,018 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:49:34,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 11:49:34,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 11:49:34,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 11:49:34,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-07 11:49:34,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-07 11:49:34,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2019-12-07 11:49:34,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 11:49:34,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-07 11:49:34,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2019-12-07 11:49:34,027 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 11:49:34,027 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-12-07 11:49:34,027 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 11:49:34,027 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 11:49:34,057 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_36ae325b-cc40-437f-96a9-1be439acb5ee/bin/uautomizer/witness.graphml [2019-12-07 11:49:34,057 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:49:34,058 INFO L168 Benchmark]: Toolchain (without parser) took 10202.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 936.0 MB in the beginning and 1.2 GB in the end (delta: -249.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:49:34,058 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:49:34,058 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:34,059 INFO L168 Benchmark]: Boogie Preprocessor took 34.88 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-12-07 11:49:34,059 INFO L168 Benchmark]: RCFGBuilder took 314.84 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:34,059 INFO L168 Benchmark]: TraceAbstraction took 9503.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -139.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:49:34,059 INFO L168 Benchmark]: Witness Printer took 41.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:34,061 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.88 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 314.84 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: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9503.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -139.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 41.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: 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: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 75 locations, 23 error locations. Result: SAFE, OverallTime: 9.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 306 SDtfs, 372 SDslu, 1308 SDs, 0 SdLazy, 3060 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 86439 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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...