./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-circular-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-circular-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 b651d63eb42259dfd3a213a6671e4c58ee528ad0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:19,124 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:20:19,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:20:19,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:20:19,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:20:19,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:20:19,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:20:19,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:20:19,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:20:19,149 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:20:19,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:20:19,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:20:19,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:20:19,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:20:19,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:20:19,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:20:19,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:20:19,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:20:19,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:20:19,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:20:19,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:20:19,165 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:20:19,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:20:19,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:20:19,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:20:19,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:20:19,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:20:19,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:20:19,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:20:19,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:20:19,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:20:19,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:20:19,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:20:19,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:20:19,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:20:19,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:20:19,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:20:19,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:20:19,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:20:19,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:20:19,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:20:19,197 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:19,221 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:20:19,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:20:19,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:20:19,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:20:19,224 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:20:19,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:20:19,224 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:20:19,225 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:20:19,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:20:19,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:20:19,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:20:19,227 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:20:19,227 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:20:19,227 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:20:19,228 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:20:19,228 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:20:19,228 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:20:19,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:20:19,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:20:19,229 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:20:19,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:20:19,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:20:19,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:20:19,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:20:19,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:20:19,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:20:19,231 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:20:19,232 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 -> b651d63eb42259dfd3a213a6671e4c58ee528ad0 [2019-11-28 20:20:19,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:20:19,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:20:19,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:20:19,548 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:20:19,549 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:20:19,550 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-2.i [2019-11-28 20:20:19,610 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e69c51d/f0b3db3ddc654bfe93704c40827115fd/FLAG1b281bd2d [2019-11-28 20:20:20,142 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:20:20,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-2.i [2019-11-28 20:20:20,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e69c51d/f0b3db3ddc654bfe93704c40827115fd/FLAG1b281bd2d [2019-11-28 20:20:20,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6e69c51d/f0b3db3ddc654bfe93704c40827115fd [2019-11-28 20:20:20,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:20:20,451 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:20:20,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:20:20,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:20:20,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:20:20,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:20" (1/1) ... [2019-11-28 20:20:20,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce65fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:20, skipping insertion in model container [2019-11-28 20:20:20,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:20:20" (1/1) ... [2019-11-28 20:20:20,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:20:20,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:20:20,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:20:20,987 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:20:21,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:20:21,090 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:20:21,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:21 WrapperNode [2019-11-28 20:20:21,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:20:21,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:20:21,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:20:21,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:20:21,107 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:21" (1/1) ... [2019-11-28 20:20:21,108 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:21" (1/1) ... [2019-11-28 20:20:21,129 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:21" (1/1) ... [2019-11-28 20:20:21,130 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:21" (1/1) ... [2019-11-28 20:20:21,150 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:21" (1/1) ... [2019-11-28 20:20:21,157 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:21" (1/1) ... [2019-11-28 20:20:21,161 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:21" (1/1) ... [2019-11-28 20:20:21,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:20:21,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:20:21,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:20:21,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:20:21,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:21" (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:21,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:20:21,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:20:21,230 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:20:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:20:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:20:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:20:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:20:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:20:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:20:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:20:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:20:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:20:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:20:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:20:21,232 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:20:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:20:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:20:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:20:21,233 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:20:21,234 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:20:21,234 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:20:21,234 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:20:21,234 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:20:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:20:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:20:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:20:21,235 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:20:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:20:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:20:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:20:21,236 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:20:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:20:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:20:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:20:21,237 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:20:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:20:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:20:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:20:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:20:21,238 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:20:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:20:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:20:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:20:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:20:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:20:21,239 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:20:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:20:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:20:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:20:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:20:21,240 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:20:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:20:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:20:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:20:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:20:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:20:21,241 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:20:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-28 20:20:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:20:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:20:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:20:21,242 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:20:21,243 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:20:21,243 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:20:21,243 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:20:21,243 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:20:21,243 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:20:21,243 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:20:21,244 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:20:21,244 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:20:21,244 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:20:21,244 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:20:21,244 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:20:21,244 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:20:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:20:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:20:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:20:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:20:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:20:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:20:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:20:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:20:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:20:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:20:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:20:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:20:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:20:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:20:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:20:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:20:21,247 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:20:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:20:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:20:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:20:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:20:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:20:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:20:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:20:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:20:21,248 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:20:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:20:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:20:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:20:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:20:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:20:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:20:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 20:20:21,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:20:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:20:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:20:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:20:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:20:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:20:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:20:21,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:20:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:20:21,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:20:21,929 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:20:21,929 INFO L287 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-28 20:20:21,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:21 BoogieIcfgContainer [2019-11-28 20:20:21,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:20:21,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:20:21,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:20:21,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:20:21,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:20:20" (1/3) ... [2019-11-28 20:20:21,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8d40e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:21, skipping insertion in model container [2019-11-28 20:20:21,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:20:21" (2/3) ... [2019-11-28 20:20:21,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8d40e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:20:21, skipping insertion in model container [2019-11-28 20:20:21,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:20:21" (3/3) ... [2019-11-28 20:20:21,941 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2019-11-28 20:20:21,952 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:20:21,963 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-28 20:20:21,978 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-28 20:20:22,012 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:20:22,012 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:20:22,013 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:20:22,013 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:20:22,013 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:20:22,014 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:20:22,014 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:20:22,015 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:20:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2019-11-28 20:20:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:20:22,061 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:22,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:22,073 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:22,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:22,081 INFO L82 PathProgramCache]: Analyzing trace with hash -393144633, now seen corresponding path program 1 times [2019-11-28 20:20:22,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:22,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287473630] [2019-11-28 20:20:22,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:22,334 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:22,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287473630] [2019-11-28 20:20:22,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:22,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:20:22,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066034797] [2019-11-28 20:20:22,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:22,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:22,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:22,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:22,369 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 4 states. [2019-11-28 20:20:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:22,760 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-11-28 20:20:22,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:20:22,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 20:20:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:22,774 INFO L225 Difference]: With dead ends: 112 [2019-11-28 20:20:22,774 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 20:20:22,776 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:22,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 20:20:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2019-11-28 20:20:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-28 20:20:22,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2019-11-28 20:20:22,825 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 7 [2019-11-28 20:20:22,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:22,825 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2019-11-28 20:20:22,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:22,826 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2019-11-28 20:20:22,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-28 20:20:22,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:22,828 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:22,829 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:22,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:22,829 INFO L82 PathProgramCache]: Analyzing trace with hash -393144632, now seen corresponding path program 1 times [2019-11-28 20:20:22,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:22,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759009848] [2019-11-28 20:20:22,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:22,925 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:22,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759009848] [2019-11-28 20:20:22,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:22,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 20:20:22,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109382045] [2019-11-28 20:20:22,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:22,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:22,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:22,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:22,932 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand 4 states. [2019-11-28 20:20:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:23,185 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2019-11-28 20:20:23,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:20:23,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-28 20:20:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:23,188 INFO L225 Difference]: With dead ends: 107 [2019-11-28 20:20:23,189 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 20:20:23,191 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:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 20:20:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2019-11-28 20:20:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-28 20:20:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2019-11-28 20:20:23,209 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 7 [2019-11-28 20:20:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:23,210 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2019-11-28 20:20:23,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:23,211 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2019-11-28 20:20:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:20:23,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:23,212 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:23,213 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:23,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1494937539, now seen corresponding path program 1 times [2019-11-28 20:20:23,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:23,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790439199] [2019-11-28 20:20:23,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:23,328 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:23,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790439199] [2019-11-28 20:20:23,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:23,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:20:23,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924948612] [2019-11-28 20:20:23,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:20:23,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:23,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:20:23,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:20:23,338 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand 5 states. [2019-11-28 20:20:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:23,588 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2019-11-28 20:20:23,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:20:23,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 20:20:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:23,590 INFO L225 Difference]: With dead ends: 93 [2019-11-28 20:20:23,590 INFO L226 Difference]: Without dead ends: 93 [2019-11-28 20:20:23,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-28 20:20:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2019-11-28 20:20:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 20:20:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2019-11-28 20:20:23,602 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 12 [2019-11-28 20:20:23,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:23,602 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2019-11-28 20:20:23,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:20:23,603 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2019-11-28 20:20:23,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 20:20:23,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:23,604 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:23,605 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:23,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:23,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1494937538, now seen corresponding path program 1 times [2019-11-28 20:20:23,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:23,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285758956] [2019-11-28 20:20:23,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:23,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:23,763 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:23,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285758956] [2019-11-28 20:20:23,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:23,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:20:23,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391141700] [2019-11-28 20:20:23,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:20:23,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:23,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:20:23,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:20:23,769 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 5 states. [2019-11-28 20:20:24,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:24,027 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2019-11-28 20:20:24,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:20:24,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 20:20:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:24,029 INFO L225 Difference]: With dead ends: 103 [2019-11-28 20:20:24,030 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 20:20:24,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:24,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 20:20:24,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2019-11-28 20:20:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 20:20:24,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2019-11-28 20:20:24,050 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 12 [2019-11-28 20:20:24,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:24,051 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2019-11-28 20:20:24,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:20:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2019-11-28 20:20:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:20:24,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:24,053 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:24,053 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:24,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:24,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1168041069, now seen corresponding path program 1 times [2019-11-28 20:20:24,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:24,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29315066] [2019-11-28 20:20:24,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:24,177 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:24,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29315066] [2019-11-28 20:20:24,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:24,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:20:24,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021145025] [2019-11-28 20:20:24,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:20:24,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:24,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:20:24,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:20:24,180 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 7 states. [2019-11-28 20:20:24,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:24,656 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2019-11-28 20:20:24,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:20:24,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-28 20:20:24,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:24,659 INFO L225 Difference]: With dead ends: 139 [2019-11-28 20:20:24,659 INFO L226 Difference]: Without dead ends: 139 [2019-11-28 20:20:24,660 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:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-28 20:20:24,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 88. [2019-11-28 20:20:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 20:20:24,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-11-28 20:20:24,668 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 15 [2019-11-28 20:20:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:24,668 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-11-28 20:20:24,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:20:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-11-28 20:20:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 20:20:24,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:24,669 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:24,670 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:24,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:24,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1168041068, now seen corresponding path program 1 times [2019-11-28 20:20:24,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:24,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141939181] [2019-11-28 20:20:24,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:24,797 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:24,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141939181] [2019-11-28 20:20:24,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:24,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:20:24,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828293077] [2019-11-28 20:20:24,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:20:24,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:24,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:20:24,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:20:24,800 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 7 states. [2019-11-28 20:20:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:25,371 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2019-11-28 20:20:25,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:20:25,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-28 20:20:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:25,373 INFO L225 Difference]: With dead ends: 137 [2019-11-28 20:20:25,373 INFO L226 Difference]: Without dead ends: 137 [2019-11-28 20:20:25,373 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:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-28 20:20:25,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 78. [2019-11-28 20:20:25,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-28 20:20:25,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2019-11-28 20:20:25,380 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 15 [2019-11-28 20:20:25,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:25,381 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2019-11-28 20:20:25,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:20:25,381 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2019-11-28 20:20:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:20:25,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:25,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:25,382 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:25,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:25,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1857169056, now seen corresponding path program 1 times [2019-11-28 20:20:25,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:25,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657756349] [2019-11-28 20:20:25,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:25,538 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,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657756349] [2019-11-28 20:20:25,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:25,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:20:25,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251141596] [2019-11-28 20:20:25,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:25,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:25,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:25,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:25,540 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand 9 states. [2019-11-28 20:20:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:25,946 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2019-11-28 20:20:25,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:20:25,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-11-28 20:20:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:25,948 INFO L225 Difference]: With dead ends: 166 [2019-11-28 20:20:25,948 INFO L226 Difference]: Without dead ends: 166 [2019-11-28 20:20:25,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:20:25,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-28 20:20:25,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 84. [2019-11-28 20:20:25,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-28 20:20:25,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2019-11-28 20:20:25,954 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 16 [2019-11-28 20:20:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:25,954 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2019-11-28 20:20:25,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:25,955 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2019-11-28 20:20:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:20:25,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:25,955 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:25,956 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:25,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:25,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1737661726, now seen corresponding path program 1 times [2019-11-28 20:20:25,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:25,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622278237] [2019-11-28 20:20:25,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:26,082 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,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622278237] [2019-11-28 20:20:26,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:26,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:26,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136808182] [2019-11-28 20:20:26,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:26,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:26,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:26,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:26,085 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 9 states. [2019-11-28 20:20:26,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:26,569 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-11-28 20:20:26,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:26,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-28 20:20:26,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:26,571 INFO L225 Difference]: With dead ends: 127 [2019-11-28 20:20:26,571 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 20:20:26,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:20:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 20:20:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 86. [2019-11-28 20:20:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 20:20:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2019-11-28 20:20:26,578 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 17 [2019-11-28 20:20:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:26,578 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2019-11-28 20:20:26,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2019-11-28 20:20:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 20:20:26,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:26,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:26,580 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:26,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:26,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1737661725, now seen corresponding path program 1 times [2019-11-28 20:20:26,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:26,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703422894] [2019-11-28 20:20:26,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:26,800 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,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703422894] [2019-11-28 20:20:26,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:26,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:26,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812505931] [2019-11-28 20:20:26,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:26,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:26,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:26,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:26,807 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 9 states. [2019-11-28 20:20:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:27,337 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-11-28 20:20:27,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:20:27,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2019-11-28 20:20:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:27,339 INFO L225 Difference]: With dead ends: 160 [2019-11-28 20:20:27,339 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 20:20:27,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:20:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 20:20:27,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 98. [2019-11-28 20:20:27,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 20:20:27,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2019-11-28 20:20:27,345 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 17 [2019-11-28 20:20:27,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:27,346 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2019-11-28 20:20:27,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2019-11-28 20:20:27,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:20:27,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:27,347 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:27,347 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:27,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:27,348 INFO L82 PathProgramCache]: Analyzing trace with hash 560416014, now seen corresponding path program 1 times [2019-11-28 20:20:27,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:27,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037499686] [2019-11-28 20:20:27,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:27,535 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,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037499686] [2019-11-28 20:20:27,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:27,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 20:20:27,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380255692] [2019-11-28 20:20:27,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:20:27,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:27,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:20:27,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:20:27,538 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 10 states. [2019-11-28 20:20:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:28,177 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2019-11-28 20:20:28,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:20:28,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 20:20:28,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:28,179 INFO L225 Difference]: With dead ends: 146 [2019-11-28 20:20:28,179 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 20:20:28,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-28 20:20:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 20:20:28,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 98. [2019-11-28 20:20:28,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 20:20:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2019-11-28 20:20:28,184 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 20 [2019-11-28 20:20:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:28,185 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2019-11-28 20:20:28,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:20:28,185 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2019-11-28 20:20:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:20:28,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:28,186 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:28,187 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:28,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:28,187 INFO L82 PathProgramCache]: Analyzing trace with hash 560416015, now seen corresponding path program 1 times [2019-11-28 20:20:28,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:28,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817856719] [2019-11-28 20:20:28,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:28,355 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,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817856719] [2019-11-28 20:20:28,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:28,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:28,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676684032] [2019-11-28 20:20:28,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:28,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:28,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:28,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:28,357 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 9 states. [2019-11-28 20:20:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:28,887 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-11-28 20:20:28,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:20:28,888 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-11-28 20:20:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:28,890 INFO L225 Difference]: With dead ends: 156 [2019-11-28 20:20:28,890 INFO L226 Difference]: Without dead ends: 156 [2019-11-28 20:20:28,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:20:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-28 20:20:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 98. [2019-11-28 20:20:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 20:20:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-11-28 20:20:28,900 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 20 [2019-11-28 20:20:28,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:28,901 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-11-28 20:20:28,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-11-28 20:20:28,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 20:20:28,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:28,905 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:28,905 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:28,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1476938481, now seen corresponding path program 1 times [2019-11-28 20:20:28,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:28,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212013153] [2019-11-28 20:20:28,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:29,024 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,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212013153] [2019-11-28 20:20:29,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:29,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:20:29,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858654125] [2019-11-28 20:20:29,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:20:29,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:29,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:20:29,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:20:29,028 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 7 states. [2019-11-28 20:20:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:29,334 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2019-11-28 20:20:29,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:20:29,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-28 20:20:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:29,336 INFO L225 Difference]: With dead ends: 146 [2019-11-28 20:20:29,336 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 20:20:29,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:20:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 20:20:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 96. [2019-11-28 20:20:29,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 20:20:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-28 20:20:29,341 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 20 [2019-11-28 20:20:29,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:29,343 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-28 20:20:29,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:20:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-28 20:20:29,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:20:29,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:29,345 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] [2019-11-28 20:20:29,346 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:29,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:29,346 INFO L82 PathProgramCache]: Analyzing trace with hash 193012442, now seen corresponding path program 1 times [2019-11-28 20:20:29,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:29,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382744389] [2019-11-28 20:20:29,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:29,413 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,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382744389] [2019-11-28 20:20:29,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:29,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 20:20:29,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110188501] [2019-11-28 20:20:29,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:20:29,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:29,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:20:29,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:20:29,416 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 8 states. [2019-11-28 20:20:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:29,797 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2019-11-28 20:20:29,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:29,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-28 20:20:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:29,799 INFO L225 Difference]: With dead ends: 133 [2019-11-28 20:20:29,800 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 20:20:29,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:20:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 20:20:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 97. [2019-11-28 20:20:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-28 20:20:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2019-11-28 20:20:29,804 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 21 [2019-11-28 20:20:29,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:29,804 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2019-11-28 20:20:29,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:20:29,804 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2019-11-28 20:20:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:20:29,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:29,806 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] [2019-11-28 20:20:29,806 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:29,806 INFO L82 PathProgramCache]: Analyzing trace with hash 193012443, now seen corresponding path program 1 times [2019-11-28 20:20:29,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:29,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56905764] [2019-11-28 20:20:29,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:30,007 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:30,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56905764] [2019-11-28 20:20:30,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:30,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 20:20:30,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219743697] [2019-11-28 20:20:30,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:20:30,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:30,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:20:30,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:20:30,010 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 12 states. [2019-11-28 20:20:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:30,693 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2019-11-28 20:20:30,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 20:20:30,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-28 20:20:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:30,695 INFO L225 Difference]: With dead ends: 144 [2019-11-28 20:20:30,695 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 20:20:30,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:20:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 20:20:30,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2019-11-28 20:20:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-28 20:20:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2019-11-28 20:20:30,703 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 21 [2019-11-28 20:20:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:30,706 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2019-11-28 20:20:30,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:20:30,707 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2019-11-28 20:20:30,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:20:30,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:30,711 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:30,711 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:30,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:30,712 INFO L82 PathProgramCache]: Analyzing trace with hash 801367497, now seen corresponding path program 1 times [2019-11-28 20:20:30,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:30,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136072789] [2019-11-28 20:20:30,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:31,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136072789] [2019-11-28 20:20:31,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:31,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-28 20:20:31,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561363156] [2019-11-28 20:20:31,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:20:31,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:31,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:20:31,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:20:31,013 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand 13 states. [2019-11-28 20:20:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:31,711 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2019-11-28 20:20:31,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:20:31,712 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-28 20:20:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:31,714 INFO L225 Difference]: With dead ends: 154 [2019-11-28 20:20:31,714 INFO L226 Difference]: Without dead ends: 154 [2019-11-28 20:20:31,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:20:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-28 20:20:31,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 117. [2019-11-28 20:20:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-28 20:20:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2019-11-28 20:20:31,721 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 23 [2019-11-28 20:20:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:31,721 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2019-11-28 20:20:31,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:20:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2019-11-28 20:20:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:20:31,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:31,723 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] [2019-11-28 20:20:31,723 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:31,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:31,724 INFO L82 PathProgramCache]: Analyzing trace with hash -927411151, now seen corresponding path program 1 times [2019-11-28 20:20:31,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:31,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614938149] [2019-11-28 20:20:31,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:31,869 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:31,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614938149] [2019-11-28 20:20:31,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:31,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:31,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287264544] [2019-11-28 20:20:31,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:31,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:31,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:31,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:31,872 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand 9 states. [2019-11-28 20:20:32,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:32,301 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2019-11-28 20:20:32,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:20:32,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-11-28 20:20:32,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:32,303 INFO L225 Difference]: With dead ends: 146 [2019-11-28 20:20:32,303 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 20:20:32,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-11-28 20:20:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 20:20:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 118. [2019-11-28 20:20:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 20:20:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2019-11-28 20:20:32,309 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 24 [2019-11-28 20:20:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:32,309 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2019-11-28 20:20:32,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2019-11-28 20:20:32,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:20:32,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:32,311 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] [2019-11-28 20:20:32,311 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:32,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:32,311 INFO L82 PathProgramCache]: Analyzing trace with hash -483711363, now seen corresponding path program 1 times [2019-11-28 20:20:32,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:32,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857197264] [2019-11-28 20:20:32,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:32,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:32,565 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:32,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857197264] [2019-11-28 20:20:32,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:32,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-28 20:20:32,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038243841] [2019-11-28 20:20:32,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 20:20:32,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:32,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 20:20:32,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:20:32,568 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand 13 states. [2019-11-28 20:20:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:33,250 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2019-11-28 20:20:33,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 20:20:33,251 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-11-28 20:20:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:33,252 INFO L225 Difference]: With dead ends: 141 [2019-11-28 20:20:33,253 INFO L226 Difference]: Without dead ends: 141 [2019-11-28 20:20:33,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-11-28 20:20:33,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-28 20:20:33,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2019-11-28 20:20:33,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 20:20:33,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2019-11-28 20:20:33,258 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 24 [2019-11-28 20:20:33,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:33,259 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2019-11-28 20:20:33,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 20:20:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2019-11-28 20:20:33,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:20:33,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:33,260 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] [2019-11-28 20:20:33,260 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:33,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:33,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1598203218, now seen corresponding path program 1 times [2019-11-28 20:20:33,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:33,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087228061] [2019-11-28 20:20:33,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:33,300 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,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087228061] [2019-11-28 20:20:33,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:33,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 20:20:33,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549276018] [2019-11-28 20:20:33,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 20:20:33,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:33,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 20:20:33,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 20:20:33,302 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand 4 states. [2019-11-28 20:20:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:33,409 INFO L93 Difference]: Finished difference Result 185 states and 216 transitions. [2019-11-28 20:20:33,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 20:20:33,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-28 20:20:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:33,413 INFO L225 Difference]: With dead ends: 185 [2019-11-28 20:20:33,413 INFO L226 Difference]: Without dead ends: 185 [2019-11-28 20:20:33,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:33,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-28 20:20:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 130. [2019-11-28 20:20:33,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 20:20:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2019-11-28 20:20:33,420 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 24 [2019-11-28 20:20:33,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:33,420 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2019-11-28 20:20:33,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 20:20:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2019-11-28 20:20:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:20:33,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:33,421 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:33,422 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:33,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:33,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1315071323, now seen corresponding path program 1 times [2019-11-28 20:20:33,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:33,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792861136] [2019-11-28 20:20:33,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:33,533 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,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792861136] [2019-11-28 20:20:33,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:33,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:20:33,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431581737] [2019-11-28 20:20:33,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:20:33,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:33,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:20:33,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:20:33,535 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand 9 states. [2019-11-28 20:20:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:33,866 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2019-11-28 20:20:33,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:20:33,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-28 20:20:33,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:33,868 INFO L225 Difference]: With dead ends: 150 [2019-11-28 20:20:33,868 INFO L226 Difference]: Without dead ends: 150 [2019-11-28 20:20:33,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:20:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-28 20:20:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2019-11-28 20:20:33,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 20:20:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2019-11-28 20:20:33,872 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 25 [2019-11-28 20:20:33,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:33,873 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2019-11-28 20:20:33,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:20:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2019-11-28 20:20:33,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:20:33,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:33,875 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:33,875 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:33,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2110522547, now seen corresponding path program 1 times [2019-11-28 20:20:33,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:33,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023994494] [2019-11-28 20:20:33,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:33,924 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,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023994494] [2019-11-28 20:20:33,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:33,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:20:33,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962810539] [2019-11-28 20:20:33,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:20:33,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:33,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:20:33,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:20:33,927 INFO L87 Difference]: Start difference. First operand 132 states and 160 transitions. Second operand 6 states. [2019-11-28 20:20:34,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:34,114 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2019-11-28 20:20:34,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:20:34,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 20:20:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:34,116 INFO L225 Difference]: With dead ends: 133 [2019-11-28 20:20:34,116 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 20:20:34,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:20:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 20:20:34,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-11-28 20:20:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 20:20:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 157 transitions. [2019-11-28 20:20:34,121 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 157 transitions. Word has length 25 [2019-11-28 20:20:34,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:34,121 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 157 transitions. [2019-11-28 20:20:34,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:20:34,122 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 157 transitions. [2019-11-28 20:20:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:20:34,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:34,123 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:34,123 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:34,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:34,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2110522546, now seen corresponding path program 1 times [2019-11-28 20:20:34,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:34,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041673751] [2019-11-28 20:20:34,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:34,295 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,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041673751] [2019-11-28 20:20:34,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:34,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 20:20:34,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220569765] [2019-11-28 20:20:34,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:20:34,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:34,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:20:34,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:20:34,300 INFO L87 Difference]: Start difference. First operand 131 states and 157 transitions. Second operand 11 states. [2019-11-28 20:20:34,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:34,878 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2019-11-28 20:20:34,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:20:34,879 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-28 20:20:34,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:34,881 INFO L225 Difference]: With dead ends: 151 [2019-11-28 20:20:34,881 INFO L226 Difference]: Without dead ends: 151 [2019-11-28 20:20:34,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:20:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-28 20:20:34,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2019-11-28 20:20:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 20:20:34,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2019-11-28 20:20:34,886 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 25 [2019-11-28 20:20:34,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:34,886 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2019-11-28 20:20:34,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:20:34,886 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2019-11-28 20:20:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:20:34,887 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:34,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:34,888 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:34,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:34,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2111088500, now seen corresponding path program 1 times [2019-11-28 20:20:34,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:34,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159288710] [2019-11-28 20:20:34,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:35,161 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,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159288710] [2019-11-28 20:20:35,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:20:35,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 20:20:35,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869329893] [2019-11-28 20:20:35,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 20:20:35,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:35,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 20:20:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:20:35,164 INFO L87 Difference]: Start difference. First operand 131 states and 156 transitions. Second operand 10 states. [2019-11-28 20:20:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:35,744 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2019-11-28 20:20:35,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:20:35,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-28 20:20:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:35,749 INFO L225 Difference]: With dead ends: 149 [2019-11-28 20:20:35,749 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 20:20:35,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:20:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 20:20:35,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2019-11-28 20:20:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 20:20:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2019-11-28 20:20:35,754 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 26 [2019-11-28 20:20:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:35,754 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2019-11-28 20:20:35,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 20:20:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2019-11-28 20:20:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 20:20:35,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:35,755 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:35,756 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:35,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:35,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1023526327, now seen corresponding path program 1 times [2019-11-28 20:20:35,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:35,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53816951] [2019-11-28 20:20:35,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:35,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53816951] [2019-11-28 20:20:35,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96649872] [2019-11-28 20:20:35,946 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:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:20:36,064 INFO L264 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 20:20:36,072 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:20:36,163 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:36,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 20:20:36,165 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:36,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:36,172 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:36,173 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2019-11-28 20:20:36,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:36,223 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:36,232 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:36,234 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:36,235 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-11-28 20:20:36,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:36,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 50 [2019-11-28 20:20:36,349 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:36,380 INFO L614 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2019-11-28 20:20:36,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:36,381 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:23 [2019-11-28 20:20:36,457 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-28 20:20:36,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-28 20:20:36,458 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:36,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:36,468 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:36,468 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-11-28 20:20:36,524 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-28 20:20:36,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-11-28 20:20:36,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:20:36,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:20:36,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:20:36,534 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-28 20:20:36,554 INFO L614 ElimStorePlain]: treesize reduction 80, result has 25.9 percent of original size [2019-11-28 20:20:36,555 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:20:36,555 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-11-28 20:20:36,625 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:36,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-11-28 20:20:36,627 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:20:36,631 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:20:36,632 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:20:36,632 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-11-28 20:20:36,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 20:20:36,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 20:20:36,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2019-11-28 20:20:36,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950920207] [2019-11-28 20:20:36,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 20:20:36,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:20:36,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 20:20:36,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:20:36,640 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand 19 states. [2019-11-28 20:20:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:20:37,695 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2019-11-28 20:20:37,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 20:20:37,695 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 27 [2019-11-28 20:20:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:20:37,697 INFO L225 Difference]: With dead ends: 232 [2019-11-28 20:20:37,697 INFO L226 Difference]: Without dead ends: 232 [2019-11-28 20:20:37,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2019-11-28 20:20:37,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-28 20:20:37,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 152. [2019-11-28 20:20:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 20:20:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2019-11-28 20:20:37,703 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 27 [2019-11-28 20:20:37,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:20:37,703 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2019-11-28 20:20:37,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 20:20:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2019-11-28 20:20:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 20:20:37,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:20:37,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:20:37,907 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 20:20:37,908 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr45ENSURES_VIOLATIONMEMORY_LEAK, mainErr28REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_LEAK, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr41ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_LEAK, mainErr33REQUIRES_VIOLATION]=== [2019-11-28 20:20:37,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:20:37,909 INFO L82 PathProgramCache]: Analyzing trace with hash -550852041, now seen corresponding path program 1 times [2019-11-28 20:20:37,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:20:37,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465863318] [2019-11-28 20:20:37,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:20:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:20:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:20:37,968 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:20:37,968 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:20:38,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:20:38 BoogieIcfgContainer [2019-11-28 20:20:38,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:20:38,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:20:38,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:20:38,013 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:20:38,014 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:21" (3/4) ... [2019-11-28 20:20:38,017 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 20:20:38,071 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 20:20:38,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:20:38,073 INFO L168 Benchmark]: Toolchain (without parser) took 17622.26 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.1 MB). Free memory was 952.3 MB in the beginning and 985.4 MB in the end (delta: -33.0 MB). Peak memory consumption was 314.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:38,074 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:20:38,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 638.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:38,075 INFO L168 Benchmark]: Boogie Preprocessor took 76.00 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:38,075 INFO L168 Benchmark]: RCFGBuilder took 763.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:38,076 INFO L168 Benchmark]: TraceAbstraction took 16080.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.2 MB). Free memory was 1.0 GB in the beginning and 996.2 MB in the end (delta: 45.9 MB). Peak memory consumption was 267.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:38,079 INFO L168 Benchmark]: Witness Printer took 59.20 ms. Allocated memory is still 1.4 GB. Free memory was 996.2 MB in the beginning and 985.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:20:38,082 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 638.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.00 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 763.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.5 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16080.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.2 MB). Free memory was 1.0 GB in the beginning and 996.2 MB in the end (delta: 45.9 MB). Peak memory consumption was 267.1 MB. Max. memory is 11.5 GB. * Witness Printer took 59.20 ms. Allocated memory is still 1.4 GB. Free memory was 996.2 MB in the beginning and 985.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1021]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L985] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L986] head->next = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L987] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L989] SLL* x = head; [L990] int state = 1; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x->data = state VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1016] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1016] x = head->next [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] [L1019] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1] [L1019] COND TRUE x->data != 0 [L1021] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1021] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1] [L1021] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1021] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1021] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1021] EXPR x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1021] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1021] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1021] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, state=1, x={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 106 locations, 46 error locations. Result: UNSAFE, OverallTime: 15.9s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1551 SDtfs, 4075 SDslu, 5122 SDs, 0 SdLazy, 7208 SolverSat, 357 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 91 SyntacticMatches, 9 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=23, 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, 23 MinimizatonAttempts, 841 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 446 ConstructedInterpolants, 1 QuantifiedInterpolants, 83109 SizeOfPredicates, 9 NumberOfNonLiveVariables, 142 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 0/4 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...