./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adee0aad8018029b1a093d0ddfc0de44abfd0e03 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:20:22,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:20:22,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:20:22,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:20:22,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:20:22,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:20:22,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:20:22,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:20:22,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:20:22,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:20:22,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:20:22,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:20:22,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:20:22,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:20:22,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:20:22,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:20:22,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:20:22,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:20:22,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:20:22,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:20:22,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:20:22,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:20:22,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:20:22,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:20:22,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:20:22,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:20:22,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:20:22,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:20:22,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:20:22,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:20:22,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:20:22,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:20:22,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:20:22,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:20:22,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:20:22,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:20:22,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:20:22,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:20:22,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:20:22,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:20:22,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:20:22,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-28 20:20:22,300 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:20:22,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:20:22,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:20:22,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:20:22,302 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:20:22,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:20:22,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:20:22,303 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:20:22,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:20:22,304 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:20:22,304 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:20:22,304 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:20:22,304 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:20:22,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:20:22,305 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:20:22,305 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:20:22,305 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:20:22,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:20:22,306 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:20:22,306 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:20:22,306 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:20:22,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:20:22,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:20:22,307 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:20:22,307 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:20:22,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:20:22,307 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:20:22,308 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-memcleanup) ) 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 -> adee0aad8018029b1a093d0ddfc0de44abfd0e03 [2019-11-28 20:20:22,613 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:20:22,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:20:22,631 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:20:22,632 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:20:22,633 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:20:22,634 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2019-11-28 20:20:22,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd1439c8/c63e3cc203944dbca6fd073d29aa1ead/FLAGd8b3e3f7e [2019-11-28 20:20:23,279 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:20:23,280 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-2.i [2019-11-28 20:20:23,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd1439c8/c63e3cc203944dbca6fd073d29aa1ead/FLAGd8b3e3f7e [2019-11-28 20:20:23,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cd1439c8/c63e3cc203944dbca6fd073d29aa1ead [2019-11-28 20:20:23,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:20:23,566 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:20:23,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:20:23,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:20:23,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:20:23,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:23" (1/1) ... [2019-11-28 20:20:23,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6822e6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:23, skipping insertion in model container [2019-11-28 20:20:23,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:23" (1/1) ... [2019-11-28 20:20:23,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:20:23,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:20:24,084 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:20:24,100 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:20:24,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:20:24,214 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:20:24,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:24 WrapperNode [2019-11-28 20:20:24,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:20:24,216 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:20:24,216 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:20:24,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:20:24,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:24" (1/1) ... [2019-11-28 20:20:24,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:24" (1/1) ... [2019-11-28 20:20:24,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:24" (1/1) ... [2019-11-28 20:20:24,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:24" (1/1) ... [2019-11-28 20:20:24,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:24" (1/1) ... [2019-11-28 20:20:24,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:24" (1/1) ... [2019-11-28 20:20:24,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:24" (1/1) ... [2019-11-28 20:20:24,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:20:24,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:20:24,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:20:24,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:20:24,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:20:24,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:20:24,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:20:24,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:20:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:20:24,353 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:20:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:20:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:20:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:20:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:20:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:20:24,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:20:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:20:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:20:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:20:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:20:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:20:24,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:20:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:20:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:20:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:20:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:20:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:20:24,356 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:20:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:20:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:20:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:20:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:20:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:20:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:20:24,357 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:20:24,358 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:20:24,358 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:20:24,358 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:20:24,358 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:20:24,358 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:20:24,358 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:20:24,358 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:20:24,359 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:20:24,359 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:20:24,359 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:20:24,359 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:20:24,359 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:20:24,359 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:20:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:20:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:20:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:20:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:20:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:20:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:20:24,360 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:20:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:20:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:20:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:20:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:20:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:20:24,361 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:20:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:20:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-28 20:20:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:20:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:20:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:20:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:20:24,362 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:20:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:20:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:20:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:20:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:20:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:20:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:20:24,363 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:20:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:20:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:20:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:20:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:20:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:20:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:20:24,364 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:20:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:20:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:20:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:20:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:20:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:20:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:20:24,365 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:20:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:20:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:20:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:20:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:20:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:20:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:20:24,366 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:20:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:20:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:20:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:20:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:20:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:20:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:20:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:20:24,367 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:20:24,368 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:20:24,368 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:20:24,368 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:20:24,368 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:20:24,368 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:20:24,368 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:20:24,368 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:20:24,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:20:24,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:20:24,369 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:20:24,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:20:24,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:20:24,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:20:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:20:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:20:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:20:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:20:24,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:20:25,124 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:20:25,124 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 20:20:25,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:25 BoogieIcfgContainer [2019-11-28 20:20:25,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:20:25,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:20:25,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:20:25,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:20:25,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:20:23" (1/3) ... [2019-11-28 20:20:25,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c022f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:25, skipping insertion in model container [2019-11-28 20:20:25,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:24" (2/3) ... [2019-11-28 20:20:25,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c022f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:25, skipping insertion in model container [2019-11-28 20:20:25,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:25" (3/3) ... [2019-11-28 20:20:25,137 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-2.i [2019-11-28 20:20:25,148 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:20:25,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2019-11-28 20:20:25,180 INFO L249 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2019-11-28 20:20:25,202 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:20:25,203 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:20:25,203 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:20:25,203 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:20:25,203 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:20:25,204 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:20:25,204 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:20:25,204 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:20:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-28 20:20:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:20:25,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:25,234 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:25,234 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:25,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:25,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1423383935, now seen corresponding path program 1 times [2019-11-28 20:20:25,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:25,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210335740] [2019-11-28 20:20:25,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:25,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:25,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210335740] [2019-11-28 20:20:25,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:25,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:20:25,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633636571] [2019-11-28 20:20:25,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:25,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:25,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:25,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:25,481 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 4 states. [2019-11-28 20:20:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:25,906 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2019-11-28 20:20:25,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:20:25,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 20:20:25,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:25,923 INFO L225 Difference]: With dead ends: 137 [2019-11-28 20:20:25,924 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 20:20:25,927 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:20:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 20:20:25,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 104. [2019-11-28 20:20:25,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 20:20:25,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-11-28 20:20:25,994 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 7 [2019-11-28 20:20:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:25,995 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-11-28 20:20:25,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-11-28 20:20:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:20:25,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:25,997 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:25,997 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:25,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:25,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1423383934, now seen corresponding path program 1 times [2019-11-28 20:20:25,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:25,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122567522] [2019-11-28 20:20:26,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:26,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122567522] [2019-11-28 20:20:26,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:26,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:20:26,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190700799] [2019-11-28 20:20:26,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:26,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:26,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:26,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:26,118 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 4 states. [2019-11-28 20:20:26,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:26,514 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2019-11-28 20:20:26,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:20:26,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 20:20:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:26,517 INFO L225 Difference]: With dead ends: 131 [2019-11-28 20:20:26,517 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 20:20:26,518 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 20:20:26,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 102. [2019-11-28 20:20:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-28 20:20:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2019-11-28 20:20:26,528 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2019-11-28 20:20:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:26,529 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2019-11-28 20:20:26,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2019-11-28 20:20:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:20:26,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:26,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:26,531 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:26,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:26,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1881569075, now seen corresponding path program 1 times [2019-11-28 20:20:26,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:26,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837248698] [2019-11-28 20:20:26,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:26,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837248698] [2019-11-28 20:20:26,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:26,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:20:26,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508229145] [2019-11-28 20:20:26,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:20:26,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:26,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:20:26,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:20:26,626 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 5 states. [2019-11-28 20:20:26,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:26,899 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2019-11-28 20:20:26,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:20:26,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 20:20:26,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:26,901 INFO L225 Difference]: With dead ends: 105 [2019-11-28 20:20:26,901 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 20:20:26,901 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-11-28 20:20:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 20:20:26,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-11-28 20:20:26,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 20:20:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-11-28 20:20:26,910 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 12 [2019-11-28 20:20:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:26,910 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-11-28 20:20:26,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:20:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-11-28 20:20:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:20:26,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:26,912 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:26,912 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:26,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:26,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1881569074, now seen corresponding path program 1 times [2019-11-28 20:20:26,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:26,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822722992] [2019-11-28 20:20:26,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:27,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822722992] [2019-11-28 20:20:27,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:27,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:20:27,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580484877] [2019-11-28 20:20:27,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:20:27,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:27,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:20:27,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:20:27,012 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 5 states. [2019-11-28 20:20:27,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:27,318 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-28 20:20:27,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:20:27,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 20:20:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:27,322 INFO L225 Difference]: With dead ends: 133 [2019-11-28 20:20:27,322 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 20:20:27,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:27,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 20:20:27,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2019-11-28 20:20:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 20:20:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2019-11-28 20:20:27,342 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 12 [2019-11-28 20:20:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:27,342 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2019-11-28 20:20:27,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:20:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2019-11-28 20:20:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:20:27,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:27,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:27,344 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:27,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash -206140083, now seen corresponding path program 1 times [2019-11-28 20:20:27,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:27,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878417105] [2019-11-28 20:20:27,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:27,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878417105] [2019-11-28 20:20:27,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:27,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:20:27,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595220618] [2019-11-28 20:20:27,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:20:27,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:27,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:20:27,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:20:27,463 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 7 states. [2019-11-28 20:20:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:28,075 INFO L93 Difference]: Finished difference Result 188 states and 212 transitions. [2019-11-28 20:20:28,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:20:28,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-28 20:20:28,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:28,077 INFO L225 Difference]: With dead ends: 188 [2019-11-28 20:20:28,077 INFO L226 Difference]: Without dead ends: 188 [2019-11-28 20:20:28,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:20:28,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-28 20:20:28,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 111. [2019-11-28 20:20:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-28 20:20:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2019-11-28 20:20:28,086 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 15 [2019-11-28 20:20:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:28,087 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2019-11-28 20:20:28,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:20:28,087 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2019-11-28 20:20:28,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:20:28,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:28,088 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:28,088 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:28,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:28,088 INFO L82 PathProgramCache]: Analyzing trace with hash -206140082, now seen corresponding path program 1 times [2019-11-28 20:20:28,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:28,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35095560] [2019-11-28 20:20:28,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:28,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35095560] [2019-11-28 20:20:28,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:28,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:20:28,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124246814] [2019-11-28 20:20:28,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:20:28,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:28,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:20:28,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:20:28,167 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 7 states. [2019-11-28 20:20:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:28,792 INFO L93 Difference]: Finished difference Result 197 states and 223 transitions. [2019-11-28 20:20:28,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:20:28,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-28 20:20:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:28,794 INFO L225 Difference]: With dead ends: 197 [2019-11-28 20:20:28,795 INFO L226 Difference]: Without dead ends: 197 [2019-11-28 20:20:28,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:20:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-28 20:20:28,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 103. [2019-11-28 20:20:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-28 20:20:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2019-11-28 20:20:28,806 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 15 [2019-11-28 20:20:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:28,806 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2019-11-28 20:20:28,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:20:28,806 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2019-11-28 20:20:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 20:20:28,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:28,808 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:28,809 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:28,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1612763797, now seen corresponding path program 1 times [2019-11-28 20:20:28,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:28,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269757808] [2019-11-28 20:20:28,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:28,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:28,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269757808] [2019-11-28 20:20:28,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:28,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:20:28,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647092967] [2019-11-28 20:20:28,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:20:28,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:20:28,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:28,925 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand 6 states. [2019-11-28 20:20:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:29,151 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2019-11-28 20:20:29,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:20:29,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-28 20:20:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:29,153 INFO L225 Difference]: With dead ends: 114 [2019-11-28 20:20:29,153 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 20:20:29,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:20:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 20:20:29,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 109. [2019-11-28 20:20:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 20:20:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 124 transitions. [2019-11-28 20:20:29,159 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 124 transitions. Word has length 19 [2019-11-28 20:20:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:29,159 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 124 transitions. [2019-11-28 20:20:29,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:20:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 124 transitions. [2019-11-28 20:20:29,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:20:29,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:29,160 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] [2019-11-28 20:20:29,161 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:29,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:29,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1494366199, now seen corresponding path program 1 times [2019-11-28 20:20:29,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:29,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209229387] [2019-11-28 20:20:29,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:29,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:29,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:29,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209229387] [2019-11-28 20:20:29,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:29,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:20:29,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494522591] [2019-11-28 20:20:29,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:20:29,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:29,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:20:29,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:29,215 INFO L87 Difference]: Start difference. First operand 109 states and 124 transitions. Second operand 6 states. [2019-11-28 20:20:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:29,521 INFO L93 Difference]: Finished difference Result 144 states and 161 transitions. [2019-11-28 20:20:29,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:20:29,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 20:20:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:29,523 INFO L225 Difference]: With dead ends: 144 [2019-11-28 20:20:29,523 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 20:20:29,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 20:20:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 108. [2019-11-28 20:20:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 20:20:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2019-11-28 20:20:29,529 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 20 [2019-11-28 20:20:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:29,530 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2019-11-28 20:20:29,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:20:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2019-11-28 20:20:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:20:29,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:29,531 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] [2019-11-28 20:20:29,532 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:29,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1494366200, now seen corresponding path program 1 times [2019-11-28 20:20:29,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:29,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092781071] [2019-11-28 20:20:29,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:29,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092781071] [2019-11-28 20:20:29,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:29,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:20:29,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100075338] [2019-11-28 20:20:29,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:20:29,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:29,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:20:29,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:29,602 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 6 states. [2019-11-28 20:20:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:29,943 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2019-11-28 20:20:29,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:20:29,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-28 20:20:29,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:29,945 INFO L225 Difference]: With dead ends: 153 [2019-11-28 20:20:29,945 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 20:20:29,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 20:20:29,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 107. [2019-11-28 20:20:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 20:20:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2019-11-28 20:20:29,950 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 20 [2019-11-28 20:20:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:29,950 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2019-11-28 20:20:29,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:20:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2019-11-28 20:20:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:20:29,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:29,951 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] [2019-11-28 20:20:29,952 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:29,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:29,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1231522178, now seen corresponding path program 1 times [2019-11-28 20:20:29,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:29,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265615956] [2019-11-28 20:20:29,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:30,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265615956] [2019-11-28 20:20:30,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484060694] [2019-11-28 20:20:30,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:30,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 20:20:30,232 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:30,331 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:30,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-28 20:20:30,333 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:30,348 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-28 20:20:30,349 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:30,349 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-28 20:20:30,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:20:30,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:30,377 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:30,378 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:30,378 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-11-28 20:20:30,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-28 20:20:30,421 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:30,430 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:30,431 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:20:30,432 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2019-11-28 20:20:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:30,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:20:30,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2019-11-28 20:20:30,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717747393] [2019-11-28 20:20:30,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:20:30,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:30,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:20:30,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:20:30,468 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 12 states. [2019-11-28 20:20:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:30,995 INFO L93 Difference]: Finished difference Result 149 states and 164 transitions. [2019-11-28 20:20:30,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:30,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-28 20:20:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:31,000 INFO L225 Difference]: With dead ends: 149 [2019-11-28 20:20:31,000 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 20:20:31,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:20:31,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 20:20:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 110. [2019-11-28 20:20:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-28 20:20:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2019-11-28 20:20:31,006 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 22 [2019-11-28 20:20:31,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:31,007 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2019-11-28 20:20:31,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:20:31,007 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2019-11-28 20:20:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:20:31,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:31,008 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] [2019-11-28 20:20:31,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:31,217 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:31,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1231522177, now seen corresponding path program 1 times [2019-11-28 20:20:31,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:31,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172183610] [2019-11-28 20:20:31,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:31,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172183610] [2019-11-28 20:20:31,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147341365] [2019-11-28 20:20:31,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:31,533 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-28 20:20:31,535 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:31,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:20:31,541 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:31,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:31,543 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:31,543 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 20:20:31,588 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:31,589 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 33 [2019-11-28 20:20:31,590 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:31,612 INFO L614 ElimStorePlain]: treesize reduction 14, result has 57.6 percent of original size [2019-11-28 20:20:31,613 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:31,613 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2019-11-28 20:20:31,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:20:31,645 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:31,657 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:31,661 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-28 20:20:31,661 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:31,672 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:31,674 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:31,674 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:31 [2019-11-28 20:20:31,726 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-28 20:20:31,727 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:31,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:31,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-28 20:20:31,746 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:31,754 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:31,755 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:20:31,755 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:19 [2019-11-28 20:20:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:31,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:20:31,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-28 20:20:31,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139329576] [2019-11-28 20:20:31,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 20:20:31,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:31,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 20:20:31,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:20:31,808 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 16 states. [2019-11-28 20:20:33,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:33,006 INFO L93 Difference]: Finished difference Result 173 states and 188 transitions. [2019-11-28 20:20:33,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:20:33,007 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-28 20:20:33,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:33,010 INFO L225 Difference]: With dead ends: 173 [2019-11-28 20:20:33,010 INFO L226 Difference]: Without dead ends: 173 [2019-11-28 20:20:33,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:20:33,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-28 20:20:33,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 109. [2019-11-28 20:20:33,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 20:20:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 122 transitions. [2019-11-28 20:20:33,017 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 122 transitions. Word has length 22 [2019-11-28 20:20:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:33,018 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 122 transitions. [2019-11-28 20:20:33,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 20:20:33,018 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 122 transitions. [2019-11-28 20:20:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:20:33,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:33,019 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] [2019-11-28 20:20:33,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:33,223 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:33,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:33,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1327467012, now seen corresponding path program 1 times [2019-11-28 20:20:33,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:33,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366474688] [2019-11-28 20:20:33,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:33,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366474688] [2019-11-28 20:20:33,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:33,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:20:33,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137266832] [2019-11-28 20:20:33,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:20:33,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:33,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:20:33,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:20:33,354 INFO L87 Difference]: Start difference. First operand 109 states and 122 transitions. Second operand 10 states. [2019-11-28 20:20:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:33,856 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2019-11-28 20:20:33,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:20:33,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 20:20:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:33,858 INFO L225 Difference]: With dead ends: 115 [2019-11-28 20:20:33,858 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 20:20:33,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:20:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 20:20:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2019-11-28 20:20:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 20:20:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-11-28 20:20:33,866 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 23 [2019-11-28 20:20:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:33,866 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-11-28 20:20:33,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:20:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-11-28 20:20:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:20:33,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:33,872 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] [2019-11-28 20:20:33,873 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:33,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:33,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1327467013, now seen corresponding path program 1 times [2019-11-28 20:20:33,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:33,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709012770] [2019-11-28 20:20:33,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:34,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709012770] [2019-11-28 20:20:34,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:34,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:20:34,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63456054] [2019-11-28 20:20:34,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:20:34,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:34,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:20:34,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:20:34,029 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 10 states. [2019-11-28 20:20:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:34,593 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2019-11-28 20:20:34,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:34,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 20:20:34,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:34,595 INFO L225 Difference]: With dead ends: 114 [2019-11-28 20:20:34,596 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 20:20:34,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:20:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 20:20:34,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2019-11-28 20:20:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 20:20:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2019-11-28 20:20:34,601 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 23 [2019-11-28 20:20:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:34,602 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2019-11-28 20:20:34,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:20:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2019-11-28 20:20:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:20:34,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:34,604 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] [2019-11-28 20:20:34,604 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:34,605 INFO L82 PathProgramCache]: Analyzing trace with hash 475887303, now seen corresponding path program 1 times [2019-11-28 20:20:34,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:34,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467809087] [2019-11-28 20:20:34,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:34,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467809087] [2019-11-28 20:20:34,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:34,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:34,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076398178] [2019-11-28 20:20:34,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:34,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:34,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:34,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:34,698 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 9 states. [2019-11-28 20:20:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:35,188 INFO L93 Difference]: Finished difference Result 151 states and 167 transitions. [2019-11-28 20:20:35,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:35,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-28 20:20:35,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:35,190 INFO L225 Difference]: With dead ends: 151 [2019-11-28 20:20:35,191 INFO L226 Difference]: Without dead ends: 151 [2019-11-28 20:20:35,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:20:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-28 20:20:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 111. [2019-11-28 20:20:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-28 20:20:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2019-11-28 20:20:35,196 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 23 [2019-11-28 20:20:35,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:35,196 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2019-11-28 20:20:35,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2019-11-28 20:20:35,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:20:35,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:35,197 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] [2019-11-28 20:20:35,198 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:35,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:35,198 INFO L82 PathProgramCache]: Analyzing trace with hash 475887304, now seen corresponding path program 1 times [2019-11-28 20:20:35,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:35,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912323219] [2019-11-28 20:20:35,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:35,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912323219] [2019-11-28 20:20:35,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:35,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:35,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904003708] [2019-11-28 20:20:35,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:35,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:35,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:35,327 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand 9 states. [2019-11-28 20:20:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:35,961 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2019-11-28 20:20:35,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:20:35,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-28 20:20:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:35,963 INFO L225 Difference]: With dead ends: 175 [2019-11-28 20:20:35,963 INFO L226 Difference]: Without dead ends: 175 [2019-11-28 20:20:35,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:20:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-28 20:20:35,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 113. [2019-11-28 20:20:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-28 20:20:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2019-11-28 20:20:35,971 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 23 [2019-11-28 20:20:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:35,971 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2019-11-28 20:20:35,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2019-11-28 20:20:35,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:20:35,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:35,973 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-11-28 20:20:35,973 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_LEAK, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:35,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2061168108, now seen corresponding path program 1 times [2019-11-28 20:20:35,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:35,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166545032] [2019-11-28 20:20:35,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:20:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:20:36,072 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:20:36,073 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:20:36,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:20:36 BoogieIcfgContainer [2019-11-28 20:20:36,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:20:36,126 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:20:36,126 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:20:36,127 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:20:36,129 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:25" (3/4) ... [2019-11-28 20:20:36,132 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 20:20:36,236 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:20:36,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:20:36,239 INFO L168 Benchmark]: Toolchain (without parser) took 12671.73 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 329.3 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -229.5 MB). Peak memory consumption was 99.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:36,239 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:20:36,244 INFO L168 Benchmark]: CACSL2BoogieTranslator took 648.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:36,244 INFO L168 Benchmark]: Boogie Preprocessor took 68.64 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:36,245 INFO L168 Benchmark]: RCFGBuilder took 840.57 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: 58.5 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:36,246 INFO L168 Benchmark]: TraceAbstraction took 10998.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -141.9 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:36,246 INFO L168 Benchmark]: Witness Printer took 110.20 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:36,249 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 648.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.64 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 840.57 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: 58.5 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10998.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -141.9 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. * Witness Printer took 110.20 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1042]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L988] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L989] head->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L990] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L992] SLL* x = head; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND TRUE __VERIFIER_nondet_int() [L1006] x = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}] [L1007] x->data = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}] [L1008] x->next = head VAL [head={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}] [L1009] head = x VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}] [L1029] x = head VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}] [L1032] EXPR x->data VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}, x->data=1] [L1032] COND FALSE !(x->data != 1) [L1038] EXPR x->next VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-2:0}, x->next={-1:0}] [L1038] x = x->next [L1039] COND TRUE \read(*x) VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1041] EXPR x->data VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}, x->data=0] [L1041] COND TRUE x->data != 1 [L1042] __VERIFIER_error() VAL [head={-2:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 110 locations, 49 error locations. Result: UNSAFE, OverallTime: 10.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 954 SDtfs, 2245 SDslu, 1922 SDs, 0 SdLazy, 5698 SolverSat, 379 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 564 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 38655 SizeOfPredicates, 21 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 1/5 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 incorrect! Received shutdown request...