./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/dll-circular-1.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 e585ced56eb20cb86f32939eb5fca0773c487edc ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.1-dev-20ed64e [2021-08-27 04:26:11,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 04:26:11,128 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 04:26:11,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 04:26:11,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 04:26:11,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 04:26:11,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 04:26:11,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 04:26:11,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 04:26:11,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 04:26:11,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 04:26:11,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 04:26:11,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 04:26:11,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 04:26:11,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 04:26:11,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 04:26:11,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 04:26:11,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 04:26:11,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 04:26:11,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 04:26:11,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 04:26:11,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 04:26:11,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 04:26:11,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 04:26:11,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 04:26:11,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 04:26:11,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 04:26:11,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 04:26:11,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 04:26:11,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 04:26:11,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 04:26:11,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 04:26:11,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 04:26:11,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 04:26:11,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 04:26:11,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 04:26:11,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 04:26:11,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 04:26:11,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 04:26:11,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 04:26:11,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 04:26:11,233 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-08-27 04:26:11,268 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 04:26:11,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 04:26:11,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 04:26:11,270 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 04:26:11,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 04:26:11,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 04:26:11,272 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 04:26:11,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 04:26:11,272 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 04:26:11,272 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 04:26:11,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 04:26:11,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 04:26:11,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 04:26:11,274 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 04:26:11,274 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 04:26:11,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 04:26:11,274 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 04:26:11,274 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 04:26:11,274 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 04:26:11,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 04:26:11,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 04:26:11,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 04:26:11,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:11,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 04:26:11,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 04:26:11,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 04:26:11,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 04:26:11,276 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 04:26:11,276 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e585ced56eb20cb86f32939eb5fca0773c487edc [2021-08-27 04:26:11,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 04:26:11,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 04:26:11,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 04:26:11,637 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 04:26:11,638 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 04:26:11,639 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-1.i [2021-08-27 04:26:11,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d30d8e35/338c9ff4e8cc4557b64533970fc3bfb7/FLAGaf5525b75 [2021-08-27 04:26:12,173 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 04:26:12,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i [2021-08-27 04:26:12,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d30d8e35/338c9ff4e8cc4557b64533970fc3bfb7/FLAGaf5525b75 [2021-08-27 04:26:12,540 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d30d8e35/338c9ff4e8cc4557b64533970fc3bfb7 [2021-08-27 04:26:12,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 04:26:12,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 04:26:12,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:12,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 04:26:12,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 04:26:12,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39b371a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12, skipping insertion in model container [2021-08-27 04:26:12,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 04:26:12,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 04:26:12,867 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22365,22378] [2021-08-27 04:26:12,871 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22471,22484] [2021-08-27 04:26:12,873 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22595,22608] [2021-08-27 04:26:12,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:12,883 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 04:26:12,910 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22365,22378] [2021-08-27 04:26:12,925 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22471,22484] [2021-08-27 04:26:12,926 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22595,22608] [2021-08-27 04:26:12,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 04:26:12,954 INFO L208 MainTranslator]: Completed translation [2021-08-27 04:26:12,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12 WrapperNode [2021-08-27 04:26:12,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 04:26:12,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 04:26:12,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 04:26:12,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 04:26:12,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:12,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:13,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:13,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:13,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 04:26:13,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 04:26:13,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 04:26:13,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 04:26:13,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (1/1) ... [2021-08-27 04:26:13,044 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 04:26:13,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 04:26:13,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 04:26:13,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 04:26:13,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 04:26:13,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 04:26:13,095 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 04:26:13,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 04:26:13,095 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-08-27 04:26:13,095 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-08-27 04:26:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-08-27 04:26:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-08-27 04:26:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-08-27 04:26:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-08-27 04:26:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-08-27 04:26:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-08-27 04:26:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-08-27 04:26:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-08-27 04:26:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-08-27 04:26:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-08-27 04:26:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-08-27 04:26:13,097 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-08-27 04:26:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-08-27 04:26:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-08-27 04:26:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-08-27 04:26:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-08-27 04:26:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-08-27 04:26:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-08-27 04:26:13,098 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-08-27 04:26:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-08-27 04:26:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-08-27 04:26:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-08-27 04:26:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-08-27 04:26:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-08-27 04:26:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-08-27 04:26:13,099 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-08-27 04:26:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-08-27 04:26:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-08-27 04:26:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-08-27 04:26:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-08-27 04:26:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-08-27 04:26:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-08-27 04:26:13,100 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-08-27 04:26:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-08-27 04:26:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-08-27 04:26:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-08-27 04:26:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-08-27 04:26:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-08-27 04:26:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-08-27 04:26:13,101 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-08-27 04:26:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-08-27 04:26:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-08-27 04:26:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-08-27 04:26:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-08-27 04:26:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-08-27 04:26:13,102 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-08-27 04:26:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-08-27 04:26:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-08-27 04:26:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-08-27 04:26:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-08-27 04:26:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-08-27 04:26:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-08-27 04:26:13,103 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2021-08-27 04:26:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-08-27 04:26:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-08-27 04:26:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-08-27 04:26:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-08-27 04:26:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 04:26:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-08-27 04:26:13,104 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-08-27 04:26:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-08-27 04:26:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-08-27 04:26:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-08-27 04:26:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-08-27 04:26:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-08-27 04:26:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-08-27 04:26:13,105 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-08-27 04:26:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-08-27 04:26:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-08-27 04:26:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-08-27 04:26:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-08-27 04:26:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-08-27 04:26:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-08-27 04:26:13,106 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-08-27 04:26:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-08-27 04:26:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-08-27 04:26:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-08-27 04:26:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-08-27 04:26:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-08-27 04:26:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-08-27 04:26:13,107 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-08-27 04:26:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-08-27 04:26:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-08-27 04:26:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-08-27 04:26:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-08-27 04:26:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-08-27 04:26:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-08-27 04:26:13,108 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-08-27 04:26:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-08-27 04:26:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-08-27 04:26:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-08-27 04:26:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-08-27 04:26:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-08-27 04:26:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-08-27 04:26:13,109 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-08-27 04:26:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-08-27 04:26:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-08-27 04:26:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-08-27 04:26:13,110 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-08-27 04:26:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-08-27 04:26:13,116 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-08-27 04:26:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 04:26:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 04:26:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-08-27 04:26:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-08-27 04:26:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 04:26:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 04:26:13,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 04:26:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-08-27 04:26:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-08-27 04:26:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 04:26:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-08-27 04:26:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 04:26:13,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 04:26:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 04:26:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 04:26:13,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 04:26:13,662 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 04:26:13,663 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-08-27 04:26:13,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:13 BoogieIcfgContainer [2021-08-27 04:26:13,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 04:26:13,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 04:26:13,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 04:26:13,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 04:26:13,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 04:26:12" (1/3) ... [2021-08-27 04:26:13,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dce936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:13, skipping insertion in model container [2021-08-27 04:26:13,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 04:26:12" (2/3) ... [2021-08-27 04:26:13,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38dce936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 04:26:13, skipping insertion in model container [2021-08-27 04:26:13,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:13" (3/3) ... [2021-08-27 04:26:13,685 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2021-08-27 04:26:13,691 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 04:26:13,691 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2021-08-27 04:26:13,738 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 04:26:13,746 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 04:26:13,747 INFO L340 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2021-08-27 04:26:13,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 59 states have (on average 2.169491525423729) internal successors, (128), 109 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 04:26:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 04:26:13,771 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:13,771 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:13,772 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:13,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:13,781 INFO L82 PathProgramCache]: Analyzing trace with hash 241838902, now seen corresponding path program 1 times [2021-08-27 04:26:13,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:13,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451131669] [2021-08-27 04:26:13,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:13,789 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:13,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:14,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451131669] [2021-08-27 04:26:14,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451131669] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,018 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:14,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910317518] [2021-08-27 04:26:14,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:14,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:14,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,053 INFO L87 Difference]: Start difference. First operand has 114 states, 59 states have (on average 2.169491525423729) internal successors, (128), 109 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:14,286 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2021-08-27 04:26:14,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:14,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 04:26:14,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:14,295 INFO L225 Difference]: With dead ends: 120 [2021-08-27 04:26:14,295 INFO L226 Difference]: Without dead ends: 117 [2021-08-27 04:26:14,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.9ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-08-27 04:26:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 107. [2021-08-27 04:26:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 58 states have (on average 1.896551724137931) internal successors, (110), 103 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2021-08-27 04:26:14,327 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 7 [2021-08-27 04:26:14,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:14,327 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2021-08-27 04:26:14,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2021-08-27 04:26:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 04:26:14,328 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:14,328 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:14,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 04:26:14,328 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:14,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:14,329 INFO L82 PathProgramCache]: Analyzing trace with hash 241838903, now seen corresponding path program 1 times [2021-08-27 04:26:14,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:14,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878718369] [2021-08-27 04:26:14,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:14,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:14,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878718369] [2021-08-27 04:26:14,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878718369] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 04:26:14,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448652551] [2021-08-27 04:26:14,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 04:26:14,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 04:26:14,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,396 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:14,565 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2021-08-27 04:26:14,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 04:26:14,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2021-08-27 04:26:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:14,570 INFO L225 Difference]: With dead ends: 115 [2021-08-27 04:26:14,570 INFO L226 Difference]: Without dead ends: 115 [2021-08-27 04:26:14,570 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.8ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 04:26:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-08-27 04:26:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 103. [2021-08-27 04:26:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2021-08-27 04:26:14,585 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 7 [2021-08-27 04:26:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:14,585 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2021-08-27 04:26:14,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2021-08-27 04:26:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 04:26:14,586 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:14,586 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:14,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 04:26:14,587 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr17REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:14,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash 526931837, now seen corresponding path program 1 times [2021-08-27 04:26:14,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:14,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260393855] [2021-08-27 04:26:14,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:14,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:14,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:14,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260393855] [2021-08-27 04:26:14,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260393855] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:14,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:14,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:14,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704376899] [2021-08-27 04:26:14,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:14,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:14,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:14,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:14,701 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:14,892 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2021-08-27 04:26:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 04:26:14,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 04:26:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:14,893 INFO L225 Difference]: With dead ends: 100 [2021-08-27 04:26:14,894 INFO L226 Difference]: Without dead ends: 100 [2021-08-27 04:26:14,894 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:14,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-08-27 04:26:14,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2021-08-27 04:26:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-08-27 04:26:14,898 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 12 [2021-08-27 04:26:14,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:14,899 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-08-27 04:26:14,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-08-27 04:26:14,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-27 04:26:14,900 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:14,900 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:14,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 04:26:14,900 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr18REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:14,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:14,901 INFO L82 PathProgramCache]: Analyzing trace with hash 526931838, now seen corresponding path program 1 times [2021-08-27 04:26:14,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:14,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419040369] [2021-08-27 04:26:14,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:14,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:14,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:15,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419040369] [2021-08-27 04:26:15,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419040369] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 04:26:15,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915504798] [2021-08-27 04:26:15,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 04:26:15,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 04:26:15,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 04:26:15,014 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,234 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2021-08-27 04:26:15,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 04:26:15,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-08-27 04:26:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,236 INFO L225 Difference]: With dead ends: 116 [2021-08-27 04:26:15,236 INFO L226 Difference]: Without dead ends: 116 [2021-08-27 04:26:15,237 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-27 04:26:15,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2021-08-27 04:26:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2021-08-27 04:26:15,256 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 12 [2021-08-27 04:26:15,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,257 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2021-08-27 04:26:15,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2021-08-27 04:26:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 04:26:15,258 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,258 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 04:26:15,258 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr8REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:15,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,259 INFO L82 PathProgramCache]: Analyzing trace with hash -279051196, now seen corresponding path program 1 times [2021-08-27 04:26:15,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680352661] [2021-08-27 04:26:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,260 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:15,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680352661] [2021-08-27 04:26:15,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680352661] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:15,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349557792] [2021-08-27 04:26:15,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:15,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:15,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:15,360 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,534 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2021-08-27 04:26:15,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:15,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 04:26:15,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,536 INFO L225 Difference]: With dead ends: 99 [2021-08-27 04:26:15,536 INFO L226 Difference]: Without dead ends: 99 [2021-08-27 04:26:15,537 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 49.3ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-08-27 04:26:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2021-08-27 04:26:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2021-08-27 04:26:15,544 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 15 [2021-08-27 04:26:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,545 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2021-08-27 04:26:15,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2021-08-27 04:26:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 04:26:15,546 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,546 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 04:26:15,546 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr9REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,547 INFO L82 PathProgramCache]: Analyzing trace with hash -279051195, now seen corresponding path program 1 times [2021-08-27 04:26:15,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233574099] [2021-08-27 04:26:15,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:15,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:15,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:15,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233574099] [2021-08-27 04:26:15,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233574099] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:15,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:15,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:15,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049923156] [2021-08-27 04:26:15,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:15,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:15,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:15,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:15,688 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:15,890 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2021-08-27 04:26:15,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 04:26:15,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-08-27 04:26:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:15,891 INFO L225 Difference]: With dead ends: 98 [2021-08-27 04:26:15,891 INFO L226 Difference]: Without dead ends: 98 [2021-08-27 04:26:15,891 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 68.7ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-08-27 04:26:15,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-08-27 04:26:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2021-08-27 04:26:15,894 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 15 [2021-08-27 04:26:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:15,894 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2021-08-27 04:26:15,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2021-08-27 04:26:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 04:26:15,895 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:15,895 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:15,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 04:26:15,896 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr21ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:15,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:15,896 INFO L82 PathProgramCache]: Analyzing trace with hash -60650400, now seen corresponding path program 1 times [2021-08-27 04:26:15,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:15,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006812479] [2021-08-27 04:26:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:15,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:16,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:16,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006812479] [2021-08-27 04:26:16,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006812479] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:16,050 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:16,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:16,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782305239] [2021-08-27 04:26:16,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:16,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:16,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:16,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:16,052 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:16,348 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2021-08-27 04:26:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:16,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-08-27 04:26:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:16,352 INFO L225 Difference]: With dead ends: 181 [2021-08-27 04:26:16,352 INFO L226 Difference]: Without dead ends: 181 [2021-08-27 04:26:16,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 120.8ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-08-27 04:26:16,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 101. [2021-08-27 04:26:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2021-08-27 04:26:16,355 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 16 [2021-08-27 04:26:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:16,356 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2021-08-27 04:26:16,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2021-08-27 04:26:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 04:26:16,356 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:16,357 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:16,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 04:26:16,357 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr22REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:16,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1880158223, now seen corresponding path program 1 times [2021-08-27 04:26:16,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:16,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285566402] [2021-08-27 04:26:16,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:16,358 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:16,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:16,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285566402] [2021-08-27 04:26:16,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285566402] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:16,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:16,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:16,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680735928] [2021-08-27 04:26:16,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:16,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:16,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:16,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:16,476 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:16,826 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2021-08-27 04:26:16,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:16,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 04:26:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:16,827 INFO L225 Difference]: With dead ends: 143 [2021-08-27 04:26:16,827 INFO L226 Difference]: Without dead ends: 143 [2021-08-27 04:26:16,828 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 114.7ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-08-27 04:26:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-08-27 04:26:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 103. [2021-08-27 04:26:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2021-08-27 04:26:16,831 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 17 [2021-08-27 04:26:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:16,831 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2021-08-27 04:26:16,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2021-08-27 04:26:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 04:26:16,832 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:16,832 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:16,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 04:26:16,832 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr23REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:16,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:16,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1880158222, now seen corresponding path program 1 times [2021-08-27 04:26:16,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:16,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544666597] [2021-08-27 04:26:16,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:16,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:17,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:17,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544666597] [2021-08-27 04:26:17,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544666597] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:17,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:17,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:17,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748719296] [2021-08-27 04:26:17,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:17,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:17,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:17,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:17,033 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:17,385 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2021-08-27 04:26:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:17,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-08-27 04:26:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:17,387 INFO L225 Difference]: With dead ends: 175 [2021-08-27 04:26:17,387 INFO L226 Difference]: Without dead ends: 175 [2021-08-27 04:26:17,387 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 132.0ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-08-27 04:26:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 115. [2021-08-27 04:26:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2021-08-27 04:26:17,391 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 17 [2021-08-27 04:26:17,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:17,391 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2021-08-27 04:26:17,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2021-08-27 04:26:17,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 04:26:17,392 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:17,392 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:17,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 04:26:17,392 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr12REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:17,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:17,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1283297350, now seen corresponding path program 1 times [2021-08-27 04:26:17,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:17,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26218383] [2021-08-27 04:26:17,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:17,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:17,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:17,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:17,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26218383] [2021-08-27 04:26:17,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26218383] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:17,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:17,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:17,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120222963] [2021-08-27 04:26:17,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 04:26:17,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 04:26:17,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:17,511 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:17,875 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2021-08-27 04:26:17,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 04:26:17,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 04:26:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:17,876 INFO L225 Difference]: With dead ends: 123 [2021-08-27 04:26:17,876 INFO L226 Difference]: Without dead ends: 123 [2021-08-27 04:26:17,876 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 140.5ms TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2021-08-27 04:26:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-08-27 04:26:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2021-08-27 04:26:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2021-08-27 04:26:17,879 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 19 [2021-08-27 04:26:17,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:17,879 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2021-08-27 04:26:17,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2021-08-27 04:26:17,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 04:26:17,880 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:17,880 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:17,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 04:26:17,881 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr13REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:17,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:17,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1283297351, now seen corresponding path program 1 times [2021-08-27 04:26:17,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:17,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286909519] [2021-08-27 04:26:17,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:17,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:18,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:18,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286909519] [2021-08-27 04:26:18,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286909519] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:18,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:18,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 04:26:18,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571076808] [2021-08-27 04:26:18,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:18,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:18,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:18,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:18,053 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:18,662 INFO L93 Difference]: Finished difference Result 118 states and 133 transitions. [2021-08-27 04:26:18,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 04:26:18,663 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2021-08-27 04:26:18,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:18,663 INFO L225 Difference]: With dead ends: 118 [2021-08-27 04:26:18,663 INFO L226 Difference]: Without dead ends: 118 [2021-08-27 04:26:18,664 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 348.0ms TimeCoverageRelationStatistics Valid=142, Invalid=410, Unknown=0, NotChecked=0, Total=552 [2021-08-27 04:26:18,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-08-27 04:26:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2021-08-27 04:26:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2021-08-27 04:26:18,666 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 19 [2021-08-27 04:26:18,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:18,667 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2021-08-27 04:26:18,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2021-08-27 04:26:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 04:26:18,668 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:18,668 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:18,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 04:26:18,668 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr26REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:18,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:18,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1125022770, now seen corresponding path program 1 times [2021-08-27 04:26:18,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:18,669 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337270306] [2021-08-27 04:26:18,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:18,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:18,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:18,862 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337270306] [2021-08-27 04:26:18,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337270306] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:18,862 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:18,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 04:26:18,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284005176] [2021-08-27 04:26:18,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 04:26:18,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:18,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 04:26:18,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:18,864 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:19,251 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2021-08-27 04:26:19,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 04:26:19,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 04:26:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:19,253 INFO L225 Difference]: With dead ends: 150 [2021-08-27 04:26:19,253 INFO L226 Difference]: Without dead ends: 150 [2021-08-27 04:26:19,253 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 201.1ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-08-27 04:26:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-08-27 04:26:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 102. [2021-08-27 04:26:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2021-08-27 04:26:19,256 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 20 [2021-08-27 04:26:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:19,256 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2021-08-27 04:26:19,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2021-08-27 04:26:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 04:26:19,257 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:19,257 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:19,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 04:26:19,257 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr27REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:19,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:19,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1125022769, now seen corresponding path program 1 times [2021-08-27 04:26:19,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:19,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393739322] [2021-08-27 04:26:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:19,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:19,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:19,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393739322] [2021-08-27 04:26:19,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393739322] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:19,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:19,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:19,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748106565] [2021-08-27 04:26:19,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:19,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:19,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:19,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:19,450 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:19,795 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2021-08-27 04:26:19,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 04:26:19,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-08-27 04:26:19,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:19,797 INFO L225 Difference]: With dead ends: 160 [2021-08-27 04:26:19,797 INFO L226 Difference]: Without dead ends: 160 [2021-08-27 04:26:19,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 139.9ms TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2021-08-27 04:26:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-08-27 04:26:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 102. [2021-08-27 04:26:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2021-08-27 04:26:19,800 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 20 [2021-08-27 04:26:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:19,800 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2021-08-27 04:26:19,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:19,801 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2021-08-27 04:26:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 04:26:19,801 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:19,801 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:19,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 04:26:19,802 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr39REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:19,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:19,802 INFO L82 PathProgramCache]: Analyzing trace with hash -515982295, now seen corresponding path program 1 times [2021-08-27 04:26:19,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:19,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511976690] [2021-08-27 04:26:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:19,803 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:19,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:19,875 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511976690] [2021-08-27 04:26:19,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511976690] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:19,875 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:19,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 04:26:19,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519606065] [2021-08-27 04:26:19,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 04:26:19,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:19,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 04:26:19,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:19,877 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:20,164 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2021-08-27 04:26:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:20,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 04:26:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:20,165 INFO L225 Difference]: With dead ends: 139 [2021-08-27 04:26:20,165 INFO L226 Difference]: Without dead ends: 139 [2021-08-27 04:26:20,166 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 91.4ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-08-27 04:26:20,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 103. [2021-08-27 04:26:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 99 states have internal predecessors, (113), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2021-08-27 04:26:20,168 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 21 [2021-08-27 04:26:20,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:20,169 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2021-08-27 04:26:20,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2021-08-27 04:26:20,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-27 04:26:20,169 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:20,170 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 04:26:20,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 04:26:20,170 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr40REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:20,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:20,170 INFO L82 PathProgramCache]: Analyzing trace with hash -515982294, now seen corresponding path program 1 times [2021-08-27 04:26:20,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:20,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811389413] [2021-08-27 04:26:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:20,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:20,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:20,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811389413] [2021-08-27 04:26:20,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811389413] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:20,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:20,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 04:26:20,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725570854] [2021-08-27 04:26:20,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 04:26:20,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:20,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 04:26:20,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-08-27 04:26:20,342 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:20,843 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2021-08-27 04:26:20,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 04:26:20,844 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-08-27 04:26:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:20,844 INFO L225 Difference]: With dead ends: 150 [2021-08-27 04:26:20,844 INFO L226 Difference]: Without dead ends: 150 [2021-08-27 04:26:20,845 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 267.8ms TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2021-08-27 04:26:20,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-08-27 04:26:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 122. [2021-08-27 04:26:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 98 states have (on average 1.489795918367347) internal successors, (146), 118 states have internal predecessors, (146), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 149 transitions. [2021-08-27 04:26:20,850 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 149 transitions. Word has length 21 [2021-08-27 04:26:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:20,851 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 149 transitions. [2021-08-27 04:26:20,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:20,851 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 149 transitions. [2021-08-27 04:26:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 04:26:20,851 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:20,852 INFO L512 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] [2021-08-27 04:26:20,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 04:26:20,852 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr46ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:20,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:20,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1937741512, now seen corresponding path program 1 times [2021-08-27 04:26:20,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:20,853 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36502933] [2021-08-27 04:26:20,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:20,853 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:21,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:21,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36502933] [2021-08-27 04:26:21,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36502933] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:21,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:21,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 04:26:21,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520034692] [2021-08-27 04:26:21,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 04:26:21,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:21,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 04:26:21,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:21,098 INFO L87 Difference]: Start difference. First operand 122 states and 149 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:21,559 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2021-08-27 04:26:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 04:26:21,560 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 04:26:21,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:21,560 INFO L225 Difference]: With dead ends: 164 [2021-08-27 04:26:21,561 INFO L226 Difference]: Without dead ends: 164 [2021-08-27 04:26:21,561 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 255.9ms TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-08-27 04:26:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-08-27 04:26:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 123. [2021-08-27 04:26:21,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 99 states have (on average 1.4848484848484849) internal successors, (147), 119 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 150 transitions. [2021-08-27 04:26:21,566 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 150 transitions. Word has length 23 [2021-08-27 04:26:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:21,567 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 150 transitions. [2021-08-27 04:26:21,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 150 transitions. [2021-08-27 04:26:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 04:26:21,567 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:21,568 INFO L512 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] [2021-08-27 04:26:21,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 04:26:21,568 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr47ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:21,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:21,569 INFO L82 PathProgramCache]: Analyzing trace with hash 59555505, now seen corresponding path program 1 times [2021-08-27 04:26:21,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:21,569 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599042183] [2021-08-27 04:26:21,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:21,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:21,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:21,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:21,714 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599042183] [2021-08-27 04:26:21,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599042183] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:21,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:21,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:21,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167759739] [2021-08-27 04:26:21,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:21,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:21,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:21,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:21,716 INFO L87 Difference]: Start difference. First operand 123 states and 150 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:21,972 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2021-08-27 04:26:21,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 04:26:21,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 04:26:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:21,974 INFO L225 Difference]: With dead ends: 156 [2021-08-27 04:26:21,974 INFO L226 Difference]: Without dead ends: 156 [2021-08-27 04:26:21,974 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 99.7ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-27 04:26:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 124. [2021-08-27 04:26:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.48) internal successors, (148), 120 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 151 transitions. [2021-08-27 04:26:21,978 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 151 transitions. Word has length 24 [2021-08-27 04:26:21,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:21,978 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 151 transitions. [2021-08-27 04:26:21,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 151 transitions. [2021-08-27 04:26:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 04:26:21,979 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:21,979 INFO L512 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] [2021-08-27 04:26:21,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 04:26:21,979 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr34ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:21,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:21,980 INFO L82 PathProgramCache]: Analyzing trace with hash 503255293, now seen corresponding path program 1 times [2021-08-27 04:26:21,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:21,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540749495] [2021-08-27 04:26:21,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:21,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:22,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:22,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540749495] [2021-08-27 04:26:22,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540749495] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:22,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:22,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 04:26:22,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209591308] [2021-08-27 04:26:22,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 04:26:22,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:22,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 04:26:22,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:22,217 INFO L87 Difference]: Start difference. First operand 124 states and 151 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:22,702 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2021-08-27 04:26:22,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 04:26:22,703 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 04:26:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:22,704 INFO L225 Difference]: With dead ends: 147 [2021-08-27 04:26:22,704 INFO L226 Difference]: Without dead ends: 147 [2021-08-27 04:26:22,704 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 299.1ms TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2021-08-27 04:26:22,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-08-27 04:26:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2021-08-27 04:26:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2021-08-27 04:26:22,707 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 24 [2021-08-27 04:26:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:22,707 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2021-08-27 04:26:22,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2021-08-27 04:26:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 04:26:22,708 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:22,708 INFO L512 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] [2021-08-27 04:26:22,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 04:26:22,709 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr16ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:22,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:22,709 INFO L82 PathProgramCache]: Analyzing trace with hash 735159435, now seen corresponding path program 1 times [2021-08-27 04:26:22,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:22,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530044844] [2021-08-27 04:26:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:22,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:22,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:22,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530044844] [2021-08-27 04:26:22,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530044844] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:22,829 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:22,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 04:26:22,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748098358] [2021-08-27 04:26:22,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:22,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:22,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:22,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:22,831 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:23,203 INFO L93 Difference]: Finished difference Result 158 states and 188 transitions. [2021-08-27 04:26:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:23,203 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 04:26:23,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:23,204 INFO L225 Difference]: With dead ends: 158 [2021-08-27 04:26:23,204 INFO L226 Difference]: Without dead ends: 158 [2021-08-27 04:26:23,204 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 127.2ms TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2021-08-27 04:26:23,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-27 04:26:23,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2021-08-27 04:26:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.4385964912280702) internal successors, (164), 134 states have internal predecessors, (164), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 167 transitions. [2021-08-27 04:26:23,209 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 167 transitions. Word has length 24 [2021-08-27 04:26:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:23,209 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 167 transitions. [2021-08-27 04:26:23,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 167 transitions. [2021-08-27 04:26:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 04:26:23,210 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:23,210 INFO L512 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] [2021-08-27 04:26:23,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 04:26:23,210 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr43ASSERT_VIOLATIONMEMORY_FREE === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:23,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:23,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1846266602, now seen corresponding path program 1 times [2021-08-27 04:26:23,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:23,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352449902] [2021-08-27 04:26:23,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:23,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:23,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:23,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352449902] [2021-08-27 04:26:23,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352449902] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:23,310 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:23,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 04:26:23,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951952042] [2021-08-27 04:26:23,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 04:26:23,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:23,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 04:26:23,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-27 04:26:23,312 INFO L87 Difference]: Start difference. First operand 138 states and 167 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:23,543 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2021-08-27 04:26:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 04:26:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 04:26:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:23,547 INFO L225 Difference]: With dead ends: 155 [2021-08-27 04:26:23,547 INFO L226 Difference]: Without dead ends: 155 [2021-08-27 04:26:23,547 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 86.4ms TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-27 04:26:23,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-08-27 04:26:23,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 140. [2021-08-27 04:26:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 116 states have (on average 1.4310344827586208) internal successors, (166), 136 states have internal predecessors, (166), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 169 transitions. [2021-08-27 04:26:23,550 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 169 transitions. Word has length 25 [2021-08-27 04:26:23,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:23,550 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 169 transitions. [2021-08-27 04:26:23,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:23,551 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 169 transitions. [2021-08-27 04:26:23,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 04:26:23,551 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:23,551 INFO L512 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] [2021-08-27 04:26:23,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 04:26:23,552 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr33REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:23,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:23,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1579327267, now seen corresponding path program 1 times [2021-08-27 04:26:23,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:23,552 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697712114] [2021-08-27 04:26:23,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:23,553 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:23,719 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:23,719 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697712114] [2021-08-27 04:26:23,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697712114] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:23,720 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:23,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 04:26:23,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787458990] [2021-08-27 04:26:23,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 04:26:23,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:23,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 04:26:23,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-08-27 04:26:23,721 INFO L87 Difference]: Start difference. First operand 140 states and 169 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,105 INFO L93 Difference]: Finished difference Result 161 states and 175 transitions. [2021-08-27 04:26:24,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 04:26:24,105 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 04:26:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,106 INFO L225 Difference]: With dead ends: 161 [2021-08-27 04:26:24,106 INFO L226 Difference]: Without dead ends: 161 [2021-08-27 04:26:24,107 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 209.0ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-08-27 04:26:24,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-08-27 04:26:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 140. [2021-08-27 04:26:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 116 states have (on average 1.4224137931034482) internal successors, (165), 136 states have internal predecessors, (165), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 168 transitions. [2021-08-27 04:26:24,110 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 168 transitions. Word has length 25 [2021-08-27 04:26:24,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,111 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 168 transitions. [2021-08-27 04:26:24,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,111 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 168 transitions. [2021-08-27 04:26:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 04:26:24,112 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,112 INFO L512 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] [2021-08-27 04:26:24,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 04:26:24,112 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr32REQUIRES_VIOLATION === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:24,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:24,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1579327268, now seen corresponding path program 1 times [2021-08-27 04:26:24,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:24,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816377328] [2021-08-27 04:26:24,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:24,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:24,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:24,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816377328] [2021-08-27 04:26:24,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816377328] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:24,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:24,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 04:26:24,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6250374] [2021-08-27 04:26:24,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 04:26:24,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:24,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 04:26:24,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-27 04:26:24,165 INFO L87 Difference]: Start difference. First operand 140 states and 168 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,326 INFO L93 Difference]: Finished difference Result 141 states and 169 transitions. [2021-08-27 04:26:24,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 04:26:24,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 04:26:24,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,329 INFO L225 Difference]: With dead ends: 141 [2021-08-27 04:26:24,329 INFO L226 Difference]: Without dead ends: 141 [2021-08-27 04:26:24,330 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.9ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 04:26:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-08-27 04:26:24,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2021-08-27 04:26:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 116 states have (on average 1.396551724137931) internal successors, (162), 135 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 165 transitions. [2021-08-27 04:26:24,334 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 165 transitions. Word has length 25 [2021-08-27 04:26:24,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,334 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 165 transitions. [2021-08-27 04:26:24,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,334 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 165 transitions. [2021-08-27 04:26:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 04:26:24,335 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,335 INFO L512 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] [2021-08-27 04:26:24,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 04:26:24,336 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr49ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:24,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:24,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1398272980, now seen corresponding path program 1 times [2021-08-27 04:26:24,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:24,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276171048] [2021-08-27 04:26:24,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:24,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 04:26:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 04:26:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 04:26:24,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 04:26:24,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276171048] [2021-08-27 04:26:24,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276171048] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 04:26:24,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 04:26:24,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 04:26:24,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912642612] [2021-08-27 04:26:24,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 04:26:24,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 04:26:24,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 04:26:24,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-27 04:26:24,538 INFO L87 Difference]: Start difference. First operand 139 states and 165 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 04:26:24,848 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2021-08-27 04:26:24,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 04:26:24,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 04:26:24,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 04:26:24,849 INFO L225 Difference]: With dead ends: 156 [2021-08-27 04:26:24,849 INFO L226 Difference]: Without dead ends: 156 [2021-08-27 04:26:24,849 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 176.1ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 04:26:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-08-27 04:26:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139. [2021-08-27 04:26:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 135 states have internal predecessors, (161), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 164 transitions. [2021-08-27 04:26:24,852 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 164 transitions. Word has length 26 [2021-08-27 04:26:24,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 04:26:24,853 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 164 transitions. [2021-08-27 04:26:24,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 04:26:24,853 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 164 transitions. [2021-08-27 04:26:24,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 04:26:24,853 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 04:26:24,853 INFO L512 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] [2021-08-27 04:26:24,854 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 04:26:24,854 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr34ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION (and 45 more)] === [2021-08-27 04:26:24,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 04:26:24,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1628201079, now seen corresponding path program 1 times [2021-08-27 04:26:24,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 04:26:24,855 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052230878] [2021-08-27 04:26:24,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 04:26:24,855 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 04:26:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:26:24,865 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 04:26:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 04:26:24,895 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 04:26:24,895 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 04:26:24,896 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr34ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:24,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr0REQUIRES_VIOLATION [2021-08-27 04:26:24,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr1REQUIRES_VIOLATION [2021-08-27 04:26:24,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr2REQUIRES_VIOLATION [2021-08-27 04:26:24,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr3REQUIRES_VIOLATION [2021-08-27 04:26:24,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr4REQUIRES_VIOLATION [2021-08-27 04:26:24,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr5REQUIRES_VIOLATION [2021-08-27 04:26:24,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr6REQUIRES_VIOLATION [2021-08-27 04:26:24,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr7REQUIRES_VIOLATION [2021-08-27 04:26:24,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr8REQUIRES_VIOLATION [2021-08-27 04:26:24,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr9REQUIRES_VIOLATION [2021-08-27 04:26:24,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr10REQUIRES_VIOLATION [2021-08-27 04:26:24,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr11REQUIRES_VIOLATION [2021-08-27 04:26:24,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr12REQUIRES_VIOLATION [2021-08-27 04:26:24,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr13REQUIRES_VIOLATION [2021-08-27 04:26:24,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr14REQUIRES_VIOLATION [2021-08-27 04:26:24,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr15REQUIRES_VIOLATION [2021-08-27 04:26:24,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr16ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:24,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr17REQUIRES_VIOLATION [2021-08-27 04:26:24,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr18REQUIRES_VIOLATION [2021-08-27 04:26:24,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr19REQUIRES_VIOLATION [2021-08-27 04:26:24,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr20REQUIRES_VIOLATION [2021-08-27 04:26:24,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr21ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:24,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr22REQUIRES_VIOLATION [2021-08-27 04:26:24,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr23REQUIRES_VIOLATION [2021-08-27 04:26:24,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr24REQUIRES_VIOLATION [2021-08-27 04:26:24,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr25REQUIRES_VIOLATION [2021-08-27 04:26:24,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr26REQUIRES_VIOLATION [2021-08-27 04:26:24,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr27REQUIRES_VIOLATION [2021-08-27 04:26:24,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr28REQUIRES_VIOLATION [2021-08-27 04:26:24,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr29REQUIRES_VIOLATION [2021-08-27 04:26:24,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr30REQUIRES_VIOLATION [2021-08-27 04:26:24,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr31REQUIRES_VIOLATION [2021-08-27 04:26:24,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr32REQUIRES_VIOLATION [2021-08-27 04:26:24,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr33REQUIRES_VIOLATION [2021-08-27 04:26:24,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr35REQUIRES_VIOLATION [2021-08-27 04:26:24,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr36REQUIRES_VIOLATION [2021-08-27 04:26:24,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr37REQUIRES_VIOLATION [2021-08-27 04:26:24,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr38REQUIRES_VIOLATION [2021-08-27 04:26:24,904 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr39REQUIRES_VIOLATION [2021-08-27 04:26:24,904 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr40REQUIRES_VIOLATION [2021-08-27 04:26:24,904 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr41REQUIRES_VIOLATION [2021-08-27 04:26:24,904 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr42REQUIRES_VIOLATION [2021-08-27 04:26:24,904 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr43ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:24,904 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr44ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:24,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr45ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:24,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr46ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:24,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr47ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:24,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr48ASSERT_VIOLATIONMEMORY_FREE [2021-08-27 04:26:24,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location mainErr49ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 04:26:24,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 04:26:24,911 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 04:26:24,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 04:26:24 BoogieIcfgContainer [2021-08-27 04:26:24,934 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 04:26:24,935 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 04:26:24,935 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 04:26:24,935 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 04:26:24,935 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 04:26:13" (3/4) ... [2021-08-27 04:26:24,937 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-27 04:26:24,964 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 04:26:24,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 04:26:24,965 INFO L168 Benchmark]: Toolchain (without parser) took 12421.43 ms. Allocated memory was 54.5 MB in the beginning and 176.2 MB in the end (delta: 121.6 MB). Free memory was 30.7 MB in the beginning and 65.3 MB in the end (delta: -34.6 MB). Peak memory consumption was 88.0 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:24,965 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.7 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 04:26:24,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.68 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.5 MB in the beginning and 44.4 MB in the end (delta: -13.9 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:24,967 INFO L168 Benchmark]: Boogie Preprocessor took 76.42 ms. Allocated memory is still 67.1 MB. Free memory was 44.4 MB in the beginning and 41.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:24,967 INFO L168 Benchmark]: RCFGBuilder took 638.87 ms. Allocated memory is still 67.1 MB. Free memory was 41.6 MB in the beginning and 34.5 MB in the end (delta: 7.2 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:24,967 INFO L168 Benchmark]: TraceAbstraction took 11260.92 ms. Allocated memory was 67.1 MB in the beginning and 176.2 MB in the end (delta: 109.1 MB). Free memory was 33.8 MB in the beginning and 67.4 MB in the end (delta: -33.6 MB). Peak memory consumption was 75.7 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:24,968 INFO L168 Benchmark]: Witness Printer took 29.50 ms. Allocated memory is still 176.2 MB. Free memory was 67.4 MB in the beginning and 65.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 04:26:24,969 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.7 MB in the end (delta: 36.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 408.68 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.5 MB in the beginning and 44.4 MB in the end (delta: -13.9 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 76.42 ms. Allocated memory is still 67.1 MB. Free memory was 44.4 MB in the beginning and 41.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 638.87 ms. Allocated memory is still 67.1 MB. Free memory was 41.6 MB in the beginning and 34.5 MB in the end (delta: 7.2 MB). Peak memory consumption was 16.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 11260.92 ms. Allocated memory was 67.1 MB in the beginning and 176.2 MB in the end (delta: 109.1 MB). Free memory was 33.8 MB in the beginning and 67.4 MB in the end (delta: -33.6 MB). Peak memory consumption was 75.7 MB. Max. memory is 16.1 GB. * Witness Printer took 29.50 ms. Allocated memory is still 176.2 MB. Free memory was 67.4 MB in the beginning and 65.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1034]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = head VAL [head={-1:0}] [L999] head->data = 0 VAL [head={-1:0}] [L1001] SLL* x = head; [L1002] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1027] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1029] EXPR head->next VAL [head={-1:0}, head->next={-1:0}, state=1, x={-1:0}] [L1029] x = head->next [L1030] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1032] COND TRUE x->data != 0 [L1034] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1034] EXPR x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1] [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-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] [L1034] EXPR x->data VAL [head={-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] [L1034] EXPR x->next VAL [head={-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] [L1034] EXPR x->next->data VAL [head={-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] [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-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] [L1034] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1034] reach_error() VAL [head={-1:0}, state=1, x={-1:0}] - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1011]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1025]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 117 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 11172.4ms, OverallIterations: 24, TraceHistogramMax: 1, EmptinessCheckTime: 24.3ms, AutomataDifference: 7433.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1484 SDtfs, 4003 SDslu, 4801 SDs, 0 SdLazy, 7176 SolverSat, 354 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4083.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 3082.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=20, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 123.5ms AutomataMinimizationTime, 23 MinimizatonAttempts, 593 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 41.7ms SsaConstructionTime, 218.3ms SatisfiabilityAnalysisTime, 2974.1ms InterpolantComputationTime, 462 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 411 ConstructedInterpolants, 0 QuantifiedInterpolants, 4075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-27 04:26:25,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...