./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:53:44,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:53:44,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:53:44,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:53:44,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:53:44,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:53:44,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:53:44,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:53:44,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:53:44,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:53:44,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:53:44,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:53:44,175 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:53:44,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:53:44,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:53:44,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:53:44,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:53:44,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:53:44,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:53:44,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:53:44,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:53:44,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:53:44,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:53:44,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:53:44,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:53:44,223 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:53:44,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:53:44,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:53:44,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:53:44,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:53:44,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:53:44,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:53:44,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:53:44,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:53:44,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:53:44,235 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:53:44,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:53:44,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:53:44,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:53:44,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:53:44,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:53:44,244 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-10-21 19:53:44,291 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:53:44,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:53:44,292 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:53:44,292 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:53:44,293 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:53:44,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:53:44,294 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:53:44,294 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:53:44,294 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:53:44,295 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:53:44,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:53:44,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:53:44,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:53:44,296 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-21 19:53:44,296 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-21 19:53:44,296 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-21 19:53:44,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:53:44,296 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-21 19:53:44,297 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:53:44,297 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:53:44,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:53:44,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:53:44,298 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:53:44,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:53:44,298 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:53:44,298 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:53:44,299 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:53:44,299 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:53:44,299 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:53:44,299 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad [2021-10-21 19:53:44,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:53:44,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:53:44,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:53:44,576 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:53:44,578 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:53:44,579 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-21 19:53:44,652 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/data/c09ed3abf/31f1709e9def46ab9381f0266988da04/FLAGc7e9b8fe6 [2021-10-21 19:53:45,186 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:53:45,187 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-21 19:53:45,210 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/data/c09ed3abf/31f1709e9def46ab9381f0266988da04/FLAGc7e9b8fe6 [2021-10-21 19:53:45,476 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/data/c09ed3abf/31f1709e9def46ab9381f0266988da04 [2021-10-21 19:53:45,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:53:45,490 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-21 19:53:45,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:53:45,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:53:45,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:53:45,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:53:45" (1/1) ... [2021-10-21 19:53:45,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f77cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:53:45, skipping insertion in model container [2021-10-21 19:53:45,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:53:45" (1/1) ... [2021-10-21 19:53:45,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:53:45,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:53:45,996 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-21 19:53:46,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:53:46,012 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:53:46,134 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-21 19:53:46,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:53:46,156 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:53:46,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:53:46 WrapperNode [2021-10-21 19:53:46,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:53:46,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:53:46,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:53:46,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:53:46,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:53:46" (1/1) ... [2021-10-21 19:53:46,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:53:46" (1/1) ... [2021-10-21 19:53:46,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:53:46" (1/1) ... [2021-10-21 19:53:46,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:53:46" (1/1) ... [2021-10-21 19:53:46,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:53:46" (1/1) ... [2021-10-21 19:53:46,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:53:46" (1/1) ... [2021-10-21 19:53:46,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:53:46" (1/1) ... [2021-10-21 19:53:46,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:53:46,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:53:46,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:53:46,280 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:53:46,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:53:46" (1/1) ... [2021-10-21 19:53:46,304 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:53:46,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:53:46,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:53:46,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:53:46,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-21 19:53:46,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:53:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-21 19:53:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-10-21 19:53:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2021-10-21 19:53:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2021-10-21 19:53:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2021-10-21 19:53:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2021-10-21 19:53:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2021-10-21 19:53:46,378 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2021-10-21 19:53:46,379 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2021-10-21 19:53:46,379 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-10-21 19:53:46,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-21 19:53:46,379 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-10-21 19:53:46,379 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2021-10-21 19:53:46,379 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2021-10-21 19:53:46,379 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2021-10-21 19:53:46,380 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2021-10-21 19:53:46,380 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-10-21 19:53:46,380 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-10-21 19:53:46,380 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-10-21 19:53:46,380 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-10-21 19:53:46,380 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-10-21 19:53:46,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2021-10-21 19:53:46,380 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2021-10-21 19:53:46,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2021-10-21 19:53:46,381 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2021-10-21 19:53:46,381 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2021-10-21 19:53:46,381 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2021-10-21 19:53:46,381 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2021-10-21 19:53:46,381 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-10-21 19:53:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-21 19:53:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-21 19:53:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-21 19:53:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:53:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-10-21 19:53:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-21 19:53:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-10-21 19:53:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2021-10-21 19:53:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2021-10-21 19:53:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2021-10-21 19:53:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2021-10-21 19:53:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2021-10-21 19:53:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2021-10-21 19:53:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-10-21 19:53:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2021-10-21 19:53:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2021-10-21 19:53:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2021-10-21 19:53:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2021-10-21 19:53:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-10-21 19:53:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-10-21 19:53:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-10-21 19:53:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2021-10-21 19:53:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2021-10-21 19:53:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2021-10-21 19:53:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2021-10-21 19:53:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2021-10-21 19:53:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2021-10-21 19:53:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2021-10-21 19:53:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-10-21 19:53:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-10-21 19:53:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-10-21 19:53:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2021-10-21 19:53:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-10-21 19:53:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-21 19:53:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-10-21 19:53:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-21 19:53:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:53:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:53:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 19:53:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-21 19:53:46,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 19:53:46,760 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:46,803 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:53:46,803 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:53:46,811 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:46,819 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:53:46,820 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:53:46,825 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:47,067 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-10-21 19:53:47,067 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-10-21 19:53:47,070 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:47,125 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-10-21 19:53:47,125 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-10-21 19:53:47,135 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:47,148 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-10-21 19:53:47,148 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-10-21 19:53:47,218 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:47,231 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:53:47,231 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:53:47,232 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:47,238 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:53:47,239 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:53:47,240 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:47,250 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:53:47,250 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:53:47,296 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:47,326 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2021-10-21 19:53:47,326 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2021-10-21 19:53:47,330 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:47,465 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2021-10-21 19:53:47,465 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2021-10-21 19:53:47,520 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:47,527 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:53:47,528 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:53:47,528 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:47,542 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:53:47,542 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:53:47,542 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-21 19:53:47,547 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-21 19:53:47,548 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-21 19:53:47,568 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:53:47,568 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-10-21 19:53:47,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:53:47 BoogieIcfgContainer [2021-10-21 19:53:47,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:53:47,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:53:47,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:53:47,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:53:47,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:53:45" (1/3) ... [2021-10-21 19:53:47,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3bb621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:53:47, skipping insertion in model container [2021-10-21 19:53:47,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:53:46" (2/3) ... [2021-10-21 19:53:47,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e3bb621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:53:47, skipping insertion in model container [2021-10-21 19:53:47,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:53:47" (3/3) ... [2021-10-21 19:53:47,603 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2021-10-21 19:53:47,608 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:53:47,608 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-21 19:53:47,664 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:53:47,674 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, mAutomataTypeConcurrency=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-10-21 19:53:47,676 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-21 19:53:47,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 390 states, 288 states have (on average 1.4722222222222223) internal successors, (424), 315 states have internal predecessors, (424), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) [2021-10-21 19:53:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-21 19:53:47,725 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:53:47,727 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:53:47,727 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:53:47,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:53:47,733 INFO L82 PathProgramCache]: Analyzing trace with hash 495257184, now seen corresponding path program 1 times [2021-10-21 19:53:47,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:53:47,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116002441] [2021-10-21 19:53:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:53:47,752 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:53:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:48,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:53:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:48,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:53:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:53:48,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:53:48,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116002441] [2021-10-21 19:53:48,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116002441] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:53:48,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:53:48,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 19:53:48,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282098657] [2021-10-21 19:53:48,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 19:53:48,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:53:48,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 19:53:48,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:53:48,214 INFO L87 Difference]: Start difference. First operand has 390 states, 288 states have (on average 1.4722222222222223) internal successors, (424), 315 states have internal predecessors, (424), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-10-21 19:53:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:53:49,357 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions. [2021-10-21 19:53:49,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 19:53:49,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-10-21 19:53:49,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:53:49,377 INFO L225 Difference]: With dead ends: 429 [2021-10-21 19:53:49,377 INFO L226 Difference]: Without dead ends: 422 [2021-10-21 19:53:49,379 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 147.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-21 19:53:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-21 19:53:49,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2021-10-21 19:53:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.4326241134751774) internal successors, (404), 306 states have internal predecessors, (404), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2021-10-21 19:53:49,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 524 transitions. [2021-10-21 19:53:49,461 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 524 transitions. Word has length 15 [2021-10-21 19:53:49,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:53:49,461 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 524 transitions. [2021-10-21 19:53:49,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-10-21 19:53:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 524 transitions. [2021-10-21 19:53:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-21 19:53:49,463 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:53:49,463 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-10-21 19:53:49,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:53:49,464 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:53:49,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:53:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1971419500, now seen corresponding path program 1 times [2021-10-21 19:53:49,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:53:49,465 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685508319] [2021-10-21 19:53:49,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:53:49,466 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:53:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:49,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:53:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:53:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:53:49,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:53:49,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685508319] [2021-10-21 19:53:49,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685508319] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:53:49,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:53:49,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:53:49,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965386146] [2021-10-21 19:53:49,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:53:49,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:53:49,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:53:49,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:53:49,701 INFO L87 Difference]: Start difference. First operand 380 states and 524 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-21 19:53:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:53:50,967 INFO L93 Difference]: Finished difference Result 422 states and 586 transitions. [2021-10-21 19:53:50,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:53:50,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-10-21 19:53:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:53:50,976 INFO L225 Difference]: With dead ends: 422 [2021-10-21 19:53:50,977 INFO L226 Difference]: Without dead ends: 422 [2021-10-21 19:53:50,977 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 105.1ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:53:50,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-21 19:53:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2021-10-21 19:53:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.429078014184397) internal successors, (403), 306 states have internal predecessors, (403), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2021-10-21 19:53:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2021-10-21 19:53:51,034 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2021-10-21 19:53:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:53:51,034 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2021-10-21 19:53:51,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-21 19:53:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2021-10-21 19:53:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-21 19:53:51,036 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:53:51,036 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-10-21 19:53:51,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:53:51,037 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:53:51,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:53:51,037 INFO L82 PathProgramCache]: Analyzing trace with hash 809317868, now seen corresponding path program 1 times [2021-10-21 19:53:51,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:53:51,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650495203] [2021-10-21 19:53:51,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:53:51,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:53:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:51,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:53:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:51,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:53:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:51,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:53:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:53:51,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:53:51,306 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650495203] [2021-10-21 19:53:51,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650495203] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:53:51,307 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:53:51,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:53:51,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822613390] [2021-10-21 19:53:51,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:53:51,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:53:51,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:53:51,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:53:51,309 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-21 19:53:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:53:52,964 INFO L93 Difference]: Finished difference Result 585 states and 798 transitions. [2021-10-21 19:53:52,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:53:52,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2021-10-21 19:53:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:53:52,981 INFO L225 Difference]: With dead ends: 585 [2021-10-21 19:53:52,986 INFO L226 Difference]: Without dead ends: 584 [2021-10-21 19:53:52,986 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 240.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:53:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-10-21 19:53:53,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2021-10-21 19:53:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 405 states have (on average 1.3530864197530865) internal successors, (548), 410 states have internal predecessors, (548), 78 states have call successors, (78), 41 states have call predecessors, (78), 41 states have return successors, (90), 75 states have call predecessors, (90), 66 states have call successors, (90) [2021-10-21 19:53:53,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2021-10-21 19:53:53,043 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2021-10-21 19:53:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:53:53,044 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2021-10-21 19:53:53,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-21 19:53:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2021-10-21 19:53:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-21 19:53:53,046 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:53:53,046 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, 1, 1, 1] [2021-10-21 19:53:53,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 19:53:53,047 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:53:53,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:53:53,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1577074200, now seen corresponding path program 1 times [2021-10-21 19:53:53,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:53:53,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330409991] [2021-10-21 19:53:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:53:53,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:53:53,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:53,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:53:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:53,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:53:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:53,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:53:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:53:53,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:53:53,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330409991] [2021-10-21 19:53:53,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330409991] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:53:53,345 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:53:53,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:53:53,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306580061] [2021-10-21 19:53:53,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:53:53,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:53:53,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:53:53,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:53:53,349 INFO L87 Difference]: Start difference. First operand 525 states and 716 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-21 19:53:54,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:53:54,626 INFO L93 Difference]: Finished difference Result 676 states and 906 transitions. [2021-10-21 19:53:54,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:53:54,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2021-10-21 19:53:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:53:54,638 INFO L225 Difference]: With dead ends: 676 [2021-10-21 19:53:54,638 INFO L226 Difference]: Without dead ends: 676 [2021-10-21 19:53:54,640 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 276.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:53:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-10-21 19:53:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2021-10-21 19:53:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 450 states have (on average 1.3488888888888888) internal successors, (607), 463 states have internal predecessors, (607), 82 states have call successors, (82), 46 states have call predecessors, (82), 50 states have return successors, (101), 78 states have call predecessors, (101), 72 states have call successors, (101) [2021-10-21 19:53:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2021-10-21 19:53:54,693 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2021-10-21 19:53:54,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:53:54,694 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2021-10-21 19:53:54,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-21 19:53:54,694 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2021-10-21 19:53:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-21 19:53:54,704 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:53:54,704 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, 1, 1, 1, 1, 1] [2021-10-21 19:53:54,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 19:53:54,705 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:53:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:53:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1576156776, now seen corresponding path program 1 times [2021-10-21 19:53:54,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:53:54,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125812428] [2021-10-21 19:53:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:53:54,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:53:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:54,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:53:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:53:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:55,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:53:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:53:55,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:53:55,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125812428] [2021-10-21 19:53:55,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125812428] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:53:55,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:53:55,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:53:55,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103880278] [2021-10-21 19:53:55,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:53:55,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:53:55,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:53:55,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:53:55,032 INFO L87 Difference]: Start difference. First operand 583 states and 790 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-21 19:53:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:53:56,996 INFO L93 Difference]: Finished difference Result 819 states and 1102 transitions. [2021-10-21 19:53:56,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:53:56,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2021-10-21 19:53:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:53:57,002 INFO L225 Difference]: With dead ends: 819 [2021-10-21 19:53:57,003 INFO L226 Difference]: Without dead ends: 819 [2021-10-21 19:53:57,003 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 266.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:53:57,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-10-21 19:53:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2021-10-21 19:53:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 606 states have (on average 1.33993399339934) internal successors, (812), 616 states have internal predecessors, (812), 99 states have call successors, (99), 61 states have call predecessors, (99), 65 states have return successors, (136), 97 states have call predecessors, (136), 91 states have call successors, (136) [2021-10-21 19:53:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2021-10-21 19:53:57,041 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2021-10-21 19:53:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:53:57,041 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2021-10-21 19:53:57,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-21 19:53:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2021-10-21 19:53:57,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-21 19:53:57,044 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:53:57,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:53:57,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 19:53:57,045 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:53:57,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:53:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1228281964, now seen corresponding path program 1 times [2021-10-21 19:53:57,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:53:57,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445243577] [2021-10-21 19:53:57,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:53:57,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:53:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:57,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:53:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:57,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:53:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:57,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:53:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:53:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:53:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:53:57,275 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:53:57,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445243577] [2021-10-21 19:53:57,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445243577] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:53:57,276 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:53:57,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:53:57,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631886571] [2021-10-21 19:53:57,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:53:57,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:53:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:53:57,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:53:57,278 INFO L87 Difference]: Start difference. First operand 771 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:53:58,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:53:58,611 INFO L93 Difference]: Finished difference Result 860 states and 1157 transitions. [2021-10-21 19:53:58,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:53:58,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2021-10-21 19:53:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:53:58,626 INFO L225 Difference]: With dead ends: 860 [2021-10-21 19:53:58,626 INFO L226 Difference]: Without dead ends: 860 [2021-10-21 19:53:58,626 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 238.2ms TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:53:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2021-10-21 19:53:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2021-10-21 19:53:58,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 636 states have (on average 1.3333333333333333) internal successors, (848), 648 states have internal predecessors, (848), 99 states have call successors, (99), 61 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-10-21 19:53:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2021-10-21 19:53:58,668 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38 [2021-10-21 19:53:58,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:53:58,669 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2021-10-21 19:53:58,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:53:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2021-10-21 19:53:58,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-21 19:53:58,671 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:53:58,671 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:53:58,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 19:53:58,672 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:53:58,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:53:58,672 INFO L82 PathProgramCache]: Analyzing trace with hash 452689020, now seen corresponding path program 1 times [2021-10-21 19:53:58,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:53:58,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023204515] [2021-10-21 19:53:58,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:53:58,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:53:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:58,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:53:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:58,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:53:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:53:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:53:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:53:58,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:53:58,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023204515] [2021-10-21 19:53:58,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023204515] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:53:58,953 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:53:58,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-21 19:53:58,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967078607] [2021-10-21 19:53:58,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-21 19:53:58,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:53:58,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-21 19:53:58,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:53:58,955 INFO L87 Difference]: Start difference. First operand 808 states and 1090 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-21 19:54:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:00,213 INFO L93 Difference]: Finished difference Result 839 states and 1128 transitions. [2021-10-21 19:54:00,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 19:54:00,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2021-10-21 19:54:00,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:00,220 INFO L225 Difference]: With dead ends: 839 [2021-10-21 19:54:00,220 INFO L226 Difference]: Without dead ends: 839 [2021-10-21 19:54:00,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 210.7ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:54:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-10-21 19:54:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2021-10-21 19:54:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3323029366306027) internal successors, (862), 658 states have internal predecessors, (862), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-10-21 19:54:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2021-10-21 19:54:00,256 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2021-10-21 19:54:00,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:00,257 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2021-10-21 19:54:00,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-21 19:54:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2021-10-21 19:54:00,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-21 19:54:00,258 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:00,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:00,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 19:54:00,259 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:00,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:00,260 INFO L82 PathProgramCache]: Analyzing trace with hash -126316899, now seen corresponding path program 1 times [2021-10-21 19:54:00,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:00,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68336303] [2021-10-21 19:54:00,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:00,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:00,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:00,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:00,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:54:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:00,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:54:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:00,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:00,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68336303] [2021-10-21 19:54:00,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68336303] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:00,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:00,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:54:00,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737255103] [2021-10-21 19:54:00,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:54:00,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:00,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:54:00,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:00,615 INFO L87 Difference]: Start difference. First operand 819 states and 1104 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:54:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:02,908 INFO L93 Difference]: Finished difference Result 871 states and 1170 transitions. [2021-10-21 19:54:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:54:02,909 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2021-10-21 19:54:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:02,914 INFO L225 Difference]: With dead ends: 871 [2021-10-21 19:54:02,915 INFO L226 Difference]: Without dead ends: 871 [2021-10-21 19:54:02,915 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 702.3ms TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-10-21 19:54:02,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-10-21 19:54:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2021-10-21 19:54:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.330757341576507) internal successors, (861), 658 states have internal predecessors, (861), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-10-21 19:54:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2021-10-21 19:54:02,948 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 39 [2021-10-21 19:54:02,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:02,950 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2021-10-21 19:54:02,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:54:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2021-10-21 19:54:02,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-21 19:54:02,952 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:02,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:02,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 19:54:02,953 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:02,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:02,954 INFO L82 PathProgramCache]: Analyzing trace with hash -481477895, now seen corresponding path program 1 times [2021-10-21 19:54:02,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:02,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778851143] [2021-10-21 19:54:02,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:02,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:03,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:03,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:03,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:03,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:54:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:03,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:54:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:03,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:03,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:03,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778851143] [2021-10-21 19:54:03,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778851143] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:03,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:03,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:54:03,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832067342] [2021-10-21 19:54:03,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:54:03,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:03,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:54:03,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:03,286 INFO L87 Difference]: Start difference. First operand 819 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:54:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:05,305 INFO L93 Difference]: Finished difference Result 871 states and 1169 transitions. [2021-10-21 19:54:05,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:54:05,305 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2021-10-21 19:54:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:05,314 INFO L225 Difference]: With dead ends: 871 [2021-10-21 19:54:05,314 INFO L226 Difference]: Without dead ends: 871 [2021-10-21 19:54:05,315 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 638.8ms TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-10-21 19:54:05,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-10-21 19:54:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2021-10-21 19:54:05,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3292117465224111) internal successors, (860), 658 states have internal predecessors, (860), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-10-21 19:54:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2021-10-21 19:54:05,353 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 40 [2021-10-21 19:54:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:05,354 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2021-10-21 19:54:05,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:54:05,354 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2021-10-21 19:54:05,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-21 19:54:05,357 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:05,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:05,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 19:54:05,357 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:05,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:05,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1957366842, now seen corresponding path program 1 times [2021-10-21 19:54:05,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:05,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572958795] [2021-10-21 19:54:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:05,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:05,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:05,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:05,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:05,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-21 19:54:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:05,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:54:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:05,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:05,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572958795] [2021-10-21 19:54:05,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572958795] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:05,645 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:05,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:54:05,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997108975] [2021-10-21 19:54:05,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:54:05,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:05,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:54:05,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:05,647 INFO L87 Difference]: Start difference. First operand 819 states and 1102 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:07,346 INFO L93 Difference]: Finished difference Result 879 states and 1177 transitions. [2021-10-21 19:54:07,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:54:07,346 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2021-10-21 19:54:07,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:07,352 INFO L225 Difference]: With dead ends: 879 [2021-10-21 19:54:07,352 INFO L226 Difference]: Without dead ends: 867 [2021-10-21 19:54:07,353 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 197.8ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:07,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2021-10-21 19:54:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2021-10-21 19:54:07,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 646 states have (on average 1.328173374613003) internal successors, (858), 657 states have internal predecessors, (858), 98 states have call successors, (98), 62 states have call predecessors, (98), 72 states have return successors, (142), 99 states have call predecessors, (142), 90 states have call successors, (142) [2021-10-21 19:54:07,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2021-10-21 19:54:07,384 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 41 [2021-10-21 19:54:07,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:07,385 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2021-10-21 19:54:07,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2021-10-21 19:54:07,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-21 19:54:07,387 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:07,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:07,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:54:07,387 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash -884481493, now seen corresponding path program 1 times [2021-10-21 19:54:07,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:07,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568761468] [2021-10-21 19:54:07,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:07,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:07,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:07,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:07,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:07,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-21 19:54:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:07,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:54:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:07,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:07,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:07,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568761468] [2021-10-21 19:54:07,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568761468] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:07,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:07,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:54:07,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182788043] [2021-10-21 19:54:07,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:54:07,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:07,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:54:07,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:07,679 INFO L87 Difference]: Start difference. First operand 817 states and 1098 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:09,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:09,379 INFO L93 Difference]: Finished difference Result 877 states and 1173 transitions. [2021-10-21 19:54:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:54:09,383 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2021-10-21 19:54:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:09,389 INFO L225 Difference]: With dead ends: 877 [2021-10-21 19:54:09,389 INFO L226 Difference]: Without dead ends: 860 [2021-10-21 19:54:09,390 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 218.7ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:09,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2021-10-21 19:54:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2021-10-21 19:54:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 642 states have (on average 1.3286604361370717) internal successors, (853), 653 states have internal predecessors, (853), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2021-10-21 19:54:09,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2021-10-21 19:54:09,422 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 42 [2021-10-21 19:54:09,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:09,423 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2021-10-21 19:54:09,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2021-10-21 19:54:09,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-21 19:54:09,425 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:09,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:09,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 19:54:09,425 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:09,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:09,426 INFO L82 PathProgramCache]: Analyzing trace with hash -586304541, now seen corresponding path program 1 times [2021-10-21 19:54:09,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:09,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510430930] [2021-10-21 19:54:09,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:09,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:09,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:09,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:09,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:09,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:09,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:09,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:09,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510430930] [2021-10-21 19:54:09,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510430930] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:09,662 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:09,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:54:09,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468632654] [2021-10-21 19:54:09,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:54:09,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:09,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:54:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:54:09,664 INFO L87 Difference]: Start difference. First operand 810 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-21 19:54:10,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:10,958 INFO L93 Difference]: Finished difference Result 835 states and 1118 transitions. [2021-10-21 19:54:10,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:54:10,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2021-10-21 19:54:10,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:10,963 INFO L225 Difference]: With dead ends: 835 [2021-10-21 19:54:10,964 INFO L226 Difference]: Without dead ends: 835 [2021-10-21 19:54:10,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 343.2ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2021-10-21 19:54:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2021-10-21 19:54:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 644 states have (on average 1.3276397515527951) internal successors, (855), 655 states have internal predecessors, (855), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2021-10-21 19:54:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2021-10-21 19:54:10,991 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2021-10-21 19:54:10,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:10,992 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2021-10-21 19:54:10,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-21 19:54:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2021-10-21 19:54:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-21 19:54:10,993 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:10,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:10,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 19:54:10,994 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:10,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:10,995 INFO L82 PathProgramCache]: Analyzing trace with hash -211337402, now seen corresponding path program 1 times [2021-10-21 19:54:10,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:10,995 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77443219] [2021-10-21 19:54:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:10,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:11,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:11,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:11,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-21 19:54:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:11,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:11,208 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77443219] [2021-10-21 19:54:11,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77443219] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:11,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:11,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:54:11,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280161978] [2021-10-21 19:54:11,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:54:11,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:11,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:54:11,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:54:11,211 INFO L87 Difference]: Start difference. First operand 812 states and 1091 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-21 19:54:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:12,907 INFO L93 Difference]: Finished difference Result 840 states and 1124 transitions. [2021-10-21 19:54:12,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:54:12,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2021-10-21 19:54:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:12,912 INFO L225 Difference]: With dead ends: 840 [2021-10-21 19:54:12,913 INFO L226 Difference]: Without dead ends: 840 [2021-10-21 19:54:12,913 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 223.8ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2021-10-21 19:54:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2021-10-21 19:54:12,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2021-10-21 19:54:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2021-10-21 19:54:12,944 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2021-10-21 19:54:12,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:12,945 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2021-10-21 19:54:12,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-21 19:54:12,945 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2021-10-21 19:54:12,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-21 19:54:12,947 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:12,947 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:12,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 19:54:12,947 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:12,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:12,948 INFO L82 PathProgramCache]: Analyzing trace with hash 114455309, now seen corresponding path program 1 times [2021-10-21 19:54:12,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:12,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305048987] [2021-10-21 19:54:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:12,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:13,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:13,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:13,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:13,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:13,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:13,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305048987] [2021-10-21 19:54:13,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305048987] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:13,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:13,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:54:13,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529076803] [2021-10-21 19:54:13,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:54:13,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:13,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:54:13,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:54:13,173 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-21 19:54:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:14,375 INFO L93 Difference]: Finished difference Result 838 states and 1121 transitions. [2021-10-21 19:54:14,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:54:14,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-10-21 19:54:14,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:14,382 INFO L225 Difference]: With dead ends: 838 [2021-10-21 19:54:14,383 INFO L226 Difference]: Without dead ends: 838 [2021-10-21 19:54:14,384 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 335.0ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:54:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-10-21 19:54:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2021-10-21 19:54:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2021-10-21 19:54:14,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2021-10-21 19:54:14,413 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2021-10-21 19:54:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:14,414 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2021-10-21 19:54:14,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-21 19:54:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2021-10-21 19:54:14,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-21 19:54:14,417 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:14,418 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:14,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 19:54:14,418 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:14,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:14,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1730277995, now seen corresponding path program 1 times [2021-10-21 19:54:14,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:14,419 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230034902] [2021-10-21 19:54:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:14,420 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:14,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:14,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:14,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:14,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:14,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:54:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:14,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:14,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:14,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230034902] [2021-10-21 19:54:14,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230034902] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:14,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:14,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:54:14,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191325841] [2021-10-21 19:54:14,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:54:14,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:14,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:54:14,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:14,700 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:15,873 INFO L93 Difference]: Finished difference Result 858 states and 1146 transitions. [2021-10-21 19:54:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:54:15,874 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2021-10-21 19:54:15,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:15,879 INFO L225 Difference]: With dead ends: 858 [2021-10-21 19:54:15,879 INFO L226 Difference]: Without dead ends: 843 [2021-10-21 19:54:15,880 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 174.8ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-10-21 19:54:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2021-10-21 19:54:15,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 646 states have (on average 1.325077399380805) internal successors, (856), 657 states have internal predecessors, (856), 95 states have call successors, (95), 61 states have call predecessors, (95), 72 states have return successors, (141), 97 states have call predecessors, (141), 87 states have call successors, (141) [2021-10-21 19:54:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2021-10-21 19:54:15,908 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2021-10-21 19:54:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:15,908 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2021-10-21 19:54:15,908 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2021-10-21 19:54:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-21 19:54:15,910 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:15,910 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:15,910 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 19:54:15,911 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:15,911 INFO L82 PathProgramCache]: Analyzing trace with hash -645503113, now seen corresponding path program 1 times [2021-10-21 19:54:15,911 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:15,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330645212] [2021-10-21 19:54:15,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:15,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:16,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:16,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:16,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:16,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:54:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:16,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:16,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330645212] [2021-10-21 19:54:16,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330645212] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:16,143 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:16,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:54:16,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336882546] [2021-10-21 19:54:16,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:54:16,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:16,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:54:16,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:54:16,145 INFO L87 Difference]: Start difference. First operand 814 states and 1092 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:17,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:17,295 INFO L93 Difference]: Finished difference Result 855 states and 1136 transitions. [2021-10-21 19:54:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:54:17,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2021-10-21 19:54:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:17,302 INFO L225 Difference]: With dead ends: 855 [2021-10-21 19:54:17,302 INFO L226 Difference]: Without dead ends: 804 [2021-10-21 19:54:17,303 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 228.6ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:54:17,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2021-10-21 19:54:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2021-10-21 19:54:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 628 states have internal predecessors, (816), 93 states have call successors, (93), 60 states have call predecessors, (93), 65 states have return successors, (132), 88 states have call predecessors, (132), 85 states have call successors, (132) [2021-10-21 19:54:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2021-10-21 19:54:17,333 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2021-10-21 19:54:17,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:17,333 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2021-10-21 19:54:17,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2021-10-21 19:54:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-21 19:54:17,336 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:17,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:17,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 19:54:17,337 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:17,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1178138073, now seen corresponding path program 1 times [2021-10-21 19:54:17,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:17,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169842875] [2021-10-21 19:54:17,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:17,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:17,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:17,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:17,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-21 19:54:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:17,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:17,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169842875] [2021-10-21 19:54:17,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169842875] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:17,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:17,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-21 19:54:17,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581569218] [2021-10-21 19:54:17,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-21 19:54:17,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:17,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-21 19:54:17,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-21 19:54:17,529 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-21 19:54:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:19,115 INFO L93 Difference]: Finished difference Result 1131 states and 1528 transitions. [2021-10-21 19:54:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:54:19,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2021-10-21 19:54:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:19,121 INFO L225 Difference]: With dead ends: 1131 [2021-10-21 19:54:19,122 INFO L226 Difference]: Without dead ends: 1131 [2021-10-21 19:54:19,122 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 245.0ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2021-10-21 19:54:19,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2021-10-21 19:54:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 707 states have (on average 1.3295615275813295) internal successors, (940), 721 states have internal predecessors, (940), 103 states have call successors, (103), 70 states have call predecessors, (103), 77 states have return successors, (152), 98 states have call predecessors, (152), 95 states have call successors, (152) [2021-10-21 19:54:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2021-10-21 19:54:19,154 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2021-10-21 19:54:19,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:19,155 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2021-10-21 19:54:19,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-21 19:54:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2021-10-21 19:54:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-21 19:54:19,157 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:19,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:19,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 19:54:19,157 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:19,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:19,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1451715450, now seen corresponding path program 1 times [2021-10-21 19:54:19,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:19,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024463320] [2021-10-21 19:54:19,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:19,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:19,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:19,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:19,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:19,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:54:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:19,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:54:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:19,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:19,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024463320] [2021-10-21 19:54:19,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024463320] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:19,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:19,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:54:19,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193200476] [2021-10-21 19:54:19,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:54:19,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:19,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:54:19,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:19,396 INFO L87 Difference]: Start difference. First operand 888 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:20,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:20,592 INFO L93 Difference]: Finished difference Result 930 states and 1245 transitions. [2021-10-21 19:54:20,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:54:20,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2021-10-21 19:54:20,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:20,598 INFO L225 Difference]: With dead ends: 930 [2021-10-21 19:54:20,599 INFO L226 Difference]: Without dead ends: 915 [2021-10-21 19:54:20,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 161.8ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-10-21 19:54:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2021-10-21 19:54:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 706 states have (on average 1.3286118980169972) internal successors, (938), 720 states have internal predecessors, (938), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2021-10-21 19:54:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2021-10-21 19:54:20,629 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2021-10-21 19:54:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:20,629 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2021-10-21 19:54:20,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2021-10-21 19:54:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-21 19:54:20,631 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:20,631 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:20,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 19:54:20,632 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:20,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:20,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1924484230, now seen corresponding path program 1 times [2021-10-21 19:54:20,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:20,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921473012] [2021-10-21 19:54:20,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:20,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:20,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:20,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:20,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:20,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-21 19:54:20,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:20,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:20,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921473012] [2021-10-21 19:54:20,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921473012] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:20,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:20,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:54:20,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288906295] [2021-10-21 19:54:20,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:54:20,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:20,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:54:20,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:20,913 INFO L87 Difference]: Start difference. First operand 886 states and 1191 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-10-21 19:54:22,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:22,799 INFO L93 Difference]: Finished difference Result 936 states and 1237 transitions. [2021-10-21 19:54:22,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:54:22,799 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2021-10-21 19:54:22,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:22,804 INFO L225 Difference]: With dead ends: 936 [2021-10-21 19:54:22,804 INFO L226 Difference]: Without dead ends: 936 [2021-10-21 19:54:22,805 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 561.0ms TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2021-10-21 19:54:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2021-10-21 19:54:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2021-10-21 19:54:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 697 states have (on average 1.3156384505021521) internal successors, (917), 711 states have internal predecessors, (917), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2021-10-21 19:54:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2021-10-21 19:54:22,833 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2021-10-21 19:54:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:22,833 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2021-10-21 19:54:22,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-10-21 19:54:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2021-10-21 19:54:22,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-21 19:54:22,835 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:22,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:22,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-21 19:54:22,836 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash -398461437, now seen corresponding path program 1 times [2021-10-21 19:54:22,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:22,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349288640] [2021-10-21 19:54:22,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:22,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:22,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:22,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:23,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:23,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:23,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:23,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:23,136 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349288640] [2021-10-21 19:54:23,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349288640] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:23,136 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:23,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:54:23,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467789133] [2021-10-21 19:54:23,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:54:23,137 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:23,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:54:23,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:23,138 INFO L87 Difference]: Start difference. First operand 877 states and 1170 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-21 19:54:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:25,453 INFO L93 Difference]: Finished difference Result 1075 states and 1432 transitions. [2021-10-21 19:54:25,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-21 19:54:25,454 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2021-10-21 19:54:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:25,459 INFO L225 Difference]: With dead ends: 1075 [2021-10-21 19:54:25,459 INFO L226 Difference]: Without dead ends: 1075 [2021-10-21 19:54:25,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 756.5ms TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2021-10-21 19:54:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2021-10-21 19:54:25,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2021-10-21 19:54:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3090418353576248) internal successors, (970), 757 states have internal predecessors, (970), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2021-10-21 19:54:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2021-10-21 19:54:25,488 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2021-10-21 19:54:25,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:25,488 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2021-10-21 19:54:25,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-21 19:54:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2021-10-21 19:54:25,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-21 19:54:25,490 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:25,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:25,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-21 19:54:25,491 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:25,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:25,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1946804572, now seen corresponding path program 1 times [2021-10-21 19:54:25,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:25,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856939307] [2021-10-21 19:54:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:25,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:25,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:25,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:25,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:25,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:25,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-21 19:54:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:25,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:25,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:25,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856939307] [2021-10-21 19:54:25,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856939307] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:25,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:25,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 19:54:25,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919753913] [2021-10-21 19:54:25,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:54:25,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:25,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:54:25,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:54:25,723 INFO L87 Difference]: Start difference. First operand 932 states and 1243 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:54:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:26,938 INFO L93 Difference]: Finished difference Result 976 states and 1293 transitions. [2021-10-21 19:54:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:54:26,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2021-10-21 19:54:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:26,943 INFO L225 Difference]: With dead ends: 976 [2021-10-21 19:54:26,944 INFO L226 Difference]: Without dead ends: 959 [2021-10-21 19:54:26,944 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 267.6ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:54:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-10-21 19:54:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2021-10-21 19:54:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.2928475033738192) internal successors, (958), 757 states have internal predecessors, (958), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2021-10-21 19:54:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2021-10-21 19:54:26,969 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2021-10-21 19:54:26,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:26,970 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2021-10-21 19:54:26,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:54:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2021-10-21 19:54:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-21 19:54:26,972 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:26,972 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, 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-10-21 19:54:26,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-21 19:54:26,972 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:26,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:26,973 INFO L82 PathProgramCache]: Analyzing trace with hash 764937325, now seen corresponding path program 1 times [2021-10-21 19:54:26,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:26,973 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071630726] [2021-10-21 19:54:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:26,973 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:27,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:27,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:27,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:27,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-21 19:54:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:27,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:27,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:27,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071630726] [2021-10-21 19:54:27,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071630726] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:27,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:27,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:54:27,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013482209] [2021-10-21 19:54:27,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:54:27,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:27,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:54:27,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:54:27,173 INFO L87 Difference]: Start difference. First operand 932 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-10-21 19:54:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:28,217 INFO L93 Difference]: Finished difference Result 685 states and 869 transitions. [2021-10-21 19:54:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-21 19:54:28,218 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2021-10-21 19:54:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:28,220 INFO L225 Difference]: With dead ends: 685 [2021-10-21 19:54:28,220 INFO L226 Difference]: Without dead ends: 685 [2021-10-21 19:54:28,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 327.8ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:54:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-10-21 19:54:28,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2021-10-21 19:54:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 498 states have (on average 1.2751004016064258) internal successors, (635), 509 states have internal predecessors, (635), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 68 states have call predecessors, (85), 63 states have call successors, (85) [2021-10-21 19:54:28,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2021-10-21 19:54:28,238 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2021-10-21 19:54:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:28,239 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2021-10-21 19:54:28,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-10-21 19:54:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2021-10-21 19:54:28,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-21 19:54:28,240 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:28,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:28,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-21 19:54:28,241 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:28,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:28,242 INFO L82 PathProgramCache]: Analyzing trace with hash 855475542, now seen corresponding path program 1 times [2021-10-21 19:54:28,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:28,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707311516] [2021-10-21 19:54:28,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:28,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:28,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:28,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:28,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:28,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:54:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:28,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:28,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707311516] [2021-10-21 19:54:28,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707311516] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:28,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:28,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 19:54:28,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986058593] [2021-10-21 19:54:28,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:54:28,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:28,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:54:28,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:54:28,483 INFO L87 Difference]: Start difference. First operand 623 states and 791 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:30,115 INFO L93 Difference]: Finished difference Result 659 states and 834 transitions. [2021-10-21 19:54:30,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:54:30,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2021-10-21 19:54:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:30,120 INFO L225 Difference]: With dead ends: 659 [2021-10-21 19:54:30,120 INFO L226 Difference]: Without dead ends: 659 [2021-10-21 19:54:30,122 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 410.8ms TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-10-21 19:54:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-10-21 19:54:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 624. [2021-10-21 19:54:30,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 499 states have (on average 1.2745490981963927) internal successors, (636), 509 states have internal predecessors, (636), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2021-10-21 19:54:30,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 792 transitions. [2021-10-21 19:54:30,138 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 792 transitions. Word has length 51 [2021-10-21 19:54:30,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:30,139 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 792 transitions. [2021-10-21 19:54:30,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:30,139 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 792 transitions. [2021-10-21 19:54:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-21 19:54:30,141 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:30,142 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:30,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-21 19:54:30,142 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:30,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:30,142 INFO L82 PathProgramCache]: Analyzing trace with hash -69609850, now seen corresponding path program 1 times [2021-10-21 19:54:30,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:30,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083901218] [2021-10-21 19:54:30,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:30,144 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:30,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:30,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:30,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:30,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:30,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:30,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:54:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:30,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:30,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:30,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083901218] [2021-10-21 19:54:30,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083901218] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:30,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:30,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-21 19:54:30,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505266015] [2021-10-21 19:54:30,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-21 19:54:30,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:30,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-21 19:54:30,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-21 19:54:30,377 INFO L87 Difference]: Start difference. First operand 624 states and 792 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:54:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:31,447 INFO L93 Difference]: Finished difference Result 673 states and 848 transitions. [2021-10-21 19:54:31,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:54:31,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2021-10-21 19:54:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:31,450 INFO L225 Difference]: With dead ends: 673 [2021-10-21 19:54:31,450 INFO L226 Difference]: Without dead ends: 648 [2021-10-21 19:54:31,451 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 241.6ms TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:54:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2021-10-21 19:54:31,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 616. [2021-10-21 19:54:31,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 491 states have (on average 1.2688391038696538) internal successors, (623), 501 states have internal predecessors, (623), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2021-10-21 19:54:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2021-10-21 19:54:31,481 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2021-10-21 19:54:31,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:31,482 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2021-10-21 19:54:31,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:54:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2021-10-21 19:54:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-21 19:54:31,484 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:31,484 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, 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-10-21 19:54:31,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-21 19:54:31,484 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:31,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1297164280, now seen corresponding path program 1 times [2021-10-21 19:54:31,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:31,486 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512416532] [2021-10-21 19:54:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:31,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:31,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:31,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:31,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:31,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:31,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:31,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:31,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512416532] [2021-10-21 19:54:31,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512416532] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:31,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:31,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:54:31,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595336202] [2021-10-21 19:54:31,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:54:31,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:31,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:54:31,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:54:31,713 INFO L87 Difference]: Start difference. First operand 616 states and 779 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:32,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:32,965 INFO L93 Difference]: Finished difference Result 850 states and 1092 transitions. [2021-10-21 19:54:32,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:54:32,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-10-21 19:54:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:32,970 INFO L225 Difference]: With dead ends: 850 [2021-10-21 19:54:32,970 INFO L226 Difference]: Without dead ends: 832 [2021-10-21 19:54:32,971 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 239.8ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:32,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-10-21 19:54:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 659. [2021-10-21 19:54:32,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 527 states have (on average 1.2580645161290323) internal successors, (663), 530 states have internal predecessors, (663), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2021-10-21 19:54:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 833 transitions. [2021-10-21 19:54:32,990 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 833 transitions. Word has length 52 [2021-10-21 19:54:32,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:32,991 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 833 transitions. [2021-10-21 19:54:32,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 833 transitions. [2021-10-21 19:54:32,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-21 19:54:32,993 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:32,993 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, 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-10-21 19:54:32,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-21 19:54:32,993 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:32,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:32,994 INFO L82 PathProgramCache]: Analyzing trace with hash 147904264, now seen corresponding path program 1 times [2021-10-21 19:54:32,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:32,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737787423] [2021-10-21 19:54:32,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:32,995 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:33,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:33,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:33,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:33,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:33,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:33,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:33,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737787423] [2021-10-21 19:54:33,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737787423] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:33,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:33,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:54:33,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025555986] [2021-10-21 19:54:33,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:54:33,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:33,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:54:33,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:54:33,229 INFO L87 Difference]: Start difference. First operand 659 states and 833 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:34,216 INFO L93 Difference]: Finished difference Result 719 states and 923 transitions. [2021-10-21 19:54:34,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-21 19:54:34,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-10-21 19:54:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:34,220 INFO L225 Difference]: With dead ends: 719 [2021-10-21 19:54:34,220 INFO L226 Difference]: Without dead ends: 714 [2021-10-21 19:54:34,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 194.6ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:54:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2021-10-21 19:54:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 666. [2021-10-21 19:54:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 534 states have (on average 1.2602996254681649) internal successors, (673), 537 states have internal predecessors, (673), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2021-10-21 19:54:34,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 843 transitions. [2021-10-21 19:54:34,238 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 843 transitions. Word has length 52 [2021-10-21 19:54:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:34,238 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 843 transitions. [2021-10-21 19:54:34,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:34,239 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 843 transitions. [2021-10-21 19:54:34,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-21 19:54:34,240 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:34,240 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, 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-10-21 19:54:34,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-21 19:54:34,241 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:34,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:34,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1440443638, now seen corresponding path program 1 times [2021-10-21 19:54:34,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:34,242 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703304011] [2021-10-21 19:54:34,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:34,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:34,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:34,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:34,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:34,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:34,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:34,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:34,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:34,509 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703304011] [2021-10-21 19:54:34,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703304011] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:34,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:34,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:54:34,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401954390] [2021-10-21 19:54:34,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:54:34,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:34,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:54:34,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:34,511 INFO L87 Difference]: Start difference. First operand 666 states and 843 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-21 19:54:36,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:36,162 INFO L93 Difference]: Finished difference Result 652 states and 822 transitions. [2021-10-21 19:54:36,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 19:54:36,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2021-10-21 19:54:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:36,164 INFO L225 Difference]: With dead ends: 652 [2021-10-21 19:54:36,164 INFO L226 Difference]: Without dead ends: 610 [2021-10-21 19:54:36,165 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 608.5ms TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2021-10-21 19:54:36,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-10-21 19:54:36,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 575. [2021-10-21 19:54:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 455 states have (on average 1.2747252747252746) internal successors, (580), 465 states have internal predecessors, (580), 69 states have call successors, (69), 44 states have call predecessors, (69), 50 states have return successors, (82), 66 states have call predecessors, (82), 61 states have call successors, (82) [2021-10-21 19:54:36,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2021-10-21 19:54:36,179 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2021-10-21 19:54:36,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:36,179 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2021-10-21 19:54:36,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-21 19:54:36,180 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2021-10-21 19:54:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-21 19:54:36,181 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:36,181 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, 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-10-21 19:54:36,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-21 19:54:36,182 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:36,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:36,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1105462305, now seen corresponding path program 1 times [2021-10-21 19:54:36,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:36,183 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600864478] [2021-10-21 19:54:36,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:36,183 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:36,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:36,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:36,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:36,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:36,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:36,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:36,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600864478] [2021-10-21 19:54:36,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600864478] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:36,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:36,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-21 19:54:36,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076053732] [2021-10-21 19:54:36,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 19:54:36,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:36,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 19:54:36,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:54:36,446 INFO L87 Difference]: Start difference. First operand 575 states and 731 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:38,079 INFO L93 Difference]: Finished difference Result 606 states and 767 transitions. [2021-10-21 19:54:38,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:54:38,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2021-10-21 19:54:38,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:38,082 INFO L225 Difference]: With dead ends: 606 [2021-10-21 19:54:38,082 INFO L226 Difference]: Without dead ends: 605 [2021-10-21 19:54:38,083 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 187.5ms TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:54:38,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-10-21 19:54:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 583. [2021-10-21 19:54:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 462 states have (on average 1.2705627705627707) internal successors, (587), 472 states have internal predecessors, (587), 69 states have call successors, (69), 44 states have call predecessors, (69), 51 states have return successors, (83), 67 states have call predecessors, (83), 61 states have call successors, (83) [2021-10-21 19:54:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 739 transitions. [2021-10-21 19:54:38,096 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 739 transitions. Word has length 53 [2021-10-21 19:54:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:38,097 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 739 transitions. [2021-10-21 19:54:38,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 739 transitions. [2021-10-21 19:54:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-21 19:54:38,099 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:38,099 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, 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-10-21 19:54:38,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-21 19:54:38,099 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:38,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:38,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1105739135, now seen corresponding path program 1 times [2021-10-21 19:54:38,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:38,100 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063665652] [2021-10-21 19:54:38,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:38,100 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:38,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:38,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:38,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:38,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:38,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:38,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:38,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:38,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063665652] [2021-10-21 19:54:38,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063665652] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:38,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:38,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-21 19:54:38,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297755778] [2021-10-21 19:54:38,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 19:54:38,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:38,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 19:54:38,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:54:38,386 INFO L87 Difference]: Start difference. First operand 583 states and 739 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:39,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:39,631 INFO L93 Difference]: Finished difference Result 641 states and 820 transitions. [2021-10-21 19:54:39,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:54:39,632 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2021-10-21 19:54:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:39,639 INFO L225 Difference]: With dead ends: 641 [2021-10-21 19:54:39,639 INFO L226 Difference]: Without dead ends: 629 [2021-10-21 19:54:39,641 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 295.5ms TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:54:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-10-21 19:54:39,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 589. [2021-10-21 19:54:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 467 states have (on average 1.2676659528907923) internal successors, (592), 478 states have internal predecessors, (592), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (90), 67 states have call predecessors, (90), 61 states have call successors, (90) [2021-10-21 19:54:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2021-10-21 19:54:39,673 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2021-10-21 19:54:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:39,673 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2021-10-21 19:54:39,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2021-10-21 19:54:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-21 19:54:39,676 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:39,676 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, 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-10-21 19:54:39,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-21 19:54:39,677 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:39,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1185659497, now seen corresponding path program 1 times [2021-10-21 19:54:39,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:39,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055003480] [2021-10-21 19:54:39,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:39,678 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:39,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:39,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:39,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:39,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:39,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:39,933 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055003480] [2021-10-21 19:54:39,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055003480] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:39,933 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:39,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:54:39,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381311455] [2021-10-21 19:54:39,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:54:39,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:39,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:54:39,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:39,935 INFO L87 Difference]: Start difference. First operand 589 states and 751 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:54:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:42,277 INFO L93 Difference]: Finished difference Result 754 states and 980 transitions. [2021-10-21 19:54:42,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 19:54:42,278 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2021-10-21 19:54:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:42,282 INFO L225 Difference]: With dead ends: 754 [2021-10-21 19:54:42,282 INFO L226 Difference]: Without dead ends: 740 [2021-10-21 19:54:42,282 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 671.3ms TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-10-21 19:54:42,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-10-21 19:54:42,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 573. [2021-10-21 19:54:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 454 states have (on average 1.2731277533039647) internal successors, (578), 464 states have internal predecessors, (578), 68 states have call successors, (68), 44 states have call predecessors, (68), 50 states have return successors, (81), 65 states have call predecessors, (81), 60 states have call successors, (81) [2021-10-21 19:54:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 727 transitions. [2021-10-21 19:54:42,308 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 727 transitions. Word has length 54 [2021-10-21 19:54:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:42,308 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 727 transitions. [2021-10-21 19:54:42,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-21 19:54:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 727 transitions. [2021-10-21 19:54:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-21 19:54:42,310 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:42,310 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, 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-10-21 19:54:42,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-21 19:54:42,311 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:42,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1315437004, now seen corresponding path program 1 times [2021-10-21 19:54:42,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:42,312 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432622425] [2021-10-21 19:54:42,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:42,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:42,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:42,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:42,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:42,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:42,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:54:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:42,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:54:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:42,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:42,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432622425] [2021-10-21 19:54:42,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432622425] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:42,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:42,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:54:42,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987864570] [2021-10-21 19:54:42,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:54:42,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:42,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:54:42,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:54:42,620 INFO L87 Difference]: Start difference. First operand 573 states and 727 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-21 19:54:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:43,870 INFO L93 Difference]: Finished difference Result 605 states and 763 transitions. [2021-10-21 19:54:43,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:54:43,870 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2021-10-21 19:54:43,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:43,873 INFO L225 Difference]: With dead ends: 605 [2021-10-21 19:54:43,873 INFO L226 Difference]: Without dead ends: 580 [2021-10-21 19:54:43,873 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 209.5ms TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:54:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-10-21 19:54:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 561. [2021-10-21 19:54:43,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 445 states have (on average 1.2719101123595506) internal successors, (566), 455 states have internal predecessors, (566), 66 states have call successors, (66), 43 states have call predecessors, (66), 49 states have return successors, (79), 63 states have call predecessors, (79), 58 states have call successors, (79) [2021-10-21 19:54:43,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2021-10-21 19:54:43,885 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 55 [2021-10-21 19:54:43,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:43,886 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2021-10-21 19:54:43,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-21 19:54:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2021-10-21 19:54:43,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-21 19:54:43,887 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:43,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:43,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-21 19:54:43,888 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:43,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:43,888 INFO L82 PathProgramCache]: Analyzing trace with hash -423366039, now seen corresponding path program 1 times [2021-10-21 19:54:43,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:43,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889348807] [2021-10-21 19:54:43,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:43,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:44,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:44,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:44,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:44,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-21 19:54:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:44,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:54:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:44,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-10-21 19:54:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:44,086 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:44,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889348807] [2021-10-21 19:54:44,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889348807] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:44,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:44,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-21 19:54:44,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310178123] [2021-10-21 19:54:44,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:54:44,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:44,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:54:44,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:54:44,089 INFO L87 Difference]: Start difference. First operand 561 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-21 19:54:45,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:45,062 INFO L93 Difference]: Finished difference Result 589 states and 746 transitions. [2021-10-21 19:54:45,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:54:45,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2021-10-21 19:54:45,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:45,064 INFO L225 Difference]: With dead ends: 589 [2021-10-21 19:54:45,064 INFO L226 Difference]: Without dead ends: 589 [2021-10-21 19:54:45,065 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 222.9ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-10-21 19:54:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2021-10-21 19:54:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 449 states have (on average 1.265033407572383) internal successors, (568), 460 states have internal predecessors, (568), 66 states have call successors, (66), 43 states have call predecessors, (66), 50 states have return successors, (83), 63 states have call predecessors, (83), 58 states have call successors, (83) [2021-10-21 19:54:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2021-10-21 19:54:45,075 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 58 [2021-10-21 19:54:45,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:45,076 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2021-10-21 19:54:45,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-21 19:54:45,076 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2021-10-21 19:54:45,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-21 19:54:45,078 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:45,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:45,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-21 19:54:45,079 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:45,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:45,079 INFO L82 PathProgramCache]: Analyzing trace with hash 178096204, now seen corresponding path program 1 times [2021-10-21 19:54:45,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:45,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86058888] [2021-10-21 19:54:45,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:45,080 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:45,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:45,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:45,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:45,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-21 19:54:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:45,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:54:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:45,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:54:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:45,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:45,350 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86058888] [2021-10-21 19:54:45,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86058888] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:45,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:45,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:54:45,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051353081] [2021-10-21 19:54:45,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:54:45,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:45,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:54:45,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:45,352 INFO L87 Difference]: Start difference. First operand 566 states and 717 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-21 19:54:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:46,319 INFO L93 Difference]: Finished difference Result 538 states and 675 transitions. [2021-10-21 19:54:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:54:46,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2021-10-21 19:54:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:46,322 INFO L225 Difference]: With dead ends: 538 [2021-10-21 19:54:46,322 INFO L226 Difference]: Without dead ends: 538 [2021-10-21 19:54:46,322 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 141.1ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-21 19:54:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2021-10-21 19:54:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 402 states have (on average 1.2537313432835822) internal successors, (504), 410 states have internal predecessors, (504), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (72), 59 states have call predecessors, (72), 56 states have call successors, (72) [2021-10-21 19:54:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2021-10-21 19:54:46,334 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2021-10-21 19:54:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:46,334 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2021-10-21 19:54:46,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-21 19:54:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2021-10-21 19:54:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-21 19:54:46,336 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:46,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:46,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-21 19:54:46,337 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:46,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:46,337 INFO L82 PathProgramCache]: Analyzing trace with hash -464089137, now seen corresponding path program 1 times [2021-10-21 19:54:46,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:46,338 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456790277] [2021-10-21 19:54:46,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:46,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:46,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:46,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:46,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:54:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:46,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-10-21 19:54:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:46,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:46,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456790277] [2021-10-21 19:54:46,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456790277] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:46,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:46,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:54:46,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250311739] [2021-10-21 19:54:46,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:54:46,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:46,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:54:46,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:54:46,634 INFO L87 Difference]: Start difference. First operand 511 states and 639 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-21 19:54:48,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:48,406 INFO L93 Difference]: Finished difference Result 542 states and 675 transitions. [2021-10-21 19:54:48,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 19:54:48,406 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2021-10-21 19:54:48,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:48,409 INFO L225 Difference]: With dead ends: 542 [2021-10-21 19:54:48,409 INFO L226 Difference]: Without dead ends: 524 [2021-10-21 19:54:48,409 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 300.8ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-10-21 19:54:48,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-10-21 19:54:48,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2021-10-21 19:54:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 399 states have (on average 1.255639097744361) internal successors, (501), 408 states have internal predecessors, (501), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (71), 58 states have call predecessors, (71), 56 states have call successors, (71) [2021-10-21 19:54:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2021-10-21 19:54:48,433 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2021-10-21 19:54:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:48,433 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2021-10-21 19:54:48,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-21 19:54:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2021-10-21 19:54:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-21 19:54:48,435 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:48,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:48,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-21 19:54:48,436 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:48,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:48,437 INFO L82 PathProgramCache]: Analyzing trace with hash 462485744, now seen corresponding path program 1 times [2021-10-21 19:54:48,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:48,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715799016] [2021-10-21 19:54:48,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:48,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:48,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:48,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:48,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:54:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:48,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:54:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:48,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:48,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715799016] [2021-10-21 19:54:48,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715799016] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:48,708 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:48,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-21 19:54:48,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522284039] [2021-10-21 19:54:48,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 19:54:48,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:48,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 19:54:48,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:54:48,710 INFO L87 Difference]: Start difference. First operand 508 states and 635 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:49,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:49,826 INFO L93 Difference]: Finished difference Result 535 states and 666 transitions. [2021-10-21 19:54:49,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:54:49,826 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2021-10-21 19:54:49,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:49,828 INFO L225 Difference]: With dead ends: 535 [2021-10-21 19:54:49,829 INFO L226 Difference]: Without dead ends: 520 [2021-10-21 19:54:49,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 204.3ms TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:54:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-10-21 19:54:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2021-10-21 19:54:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 396 states have (on average 1.255050505050505) internal successors, (497), 405 states have internal predecessors, (497), 62 states have call successors, (62), 42 states have call predecessors, (62), 45 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2021-10-21 19:54:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2021-10-21 19:54:49,840 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2021-10-21 19:54:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:49,840 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2021-10-21 19:54:49,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2021-10-21 19:54:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-21 19:54:49,842 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:49,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:49,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-21 19:54:49,843 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:49,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:49,843 INFO L82 PathProgramCache]: Analyzing trace with hash -238724580, now seen corresponding path program 1 times [2021-10-21 19:54:49,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:49,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454584616] [2021-10-21 19:54:49,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:49,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:49,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:50,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:50,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:54:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:50,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-21 19:54:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:50,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-21 19:54:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:50,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:50,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454584616] [2021-10-21 19:54:50,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454584616] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:50,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:50,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:54:50,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377174639] [2021-10-21 19:54:50,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:54:50,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:50,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:54:50,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:50,086 INFO L87 Difference]: Start difference. First operand 504 states and 629 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-21 19:54:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:51,272 INFO L93 Difference]: Finished difference Result 536 states and 666 transitions. [2021-10-21 19:54:51,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:54:51,274 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2021-10-21 19:54:51,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:51,276 INFO L225 Difference]: With dead ends: 536 [2021-10-21 19:54:51,276 INFO L226 Difference]: Without dead ends: 515 [2021-10-21 19:54:51,277 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 201.4ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:54:51,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-10-21 19:54:51,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2021-10-21 19:54:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.251908396946565) internal successors, (492), 401 states have internal predecessors, (492), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2021-10-21 19:54:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2021-10-21 19:54:51,288 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2021-10-21 19:54:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:51,288 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2021-10-21 19:54:51,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-21 19:54:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2021-10-21 19:54:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-21 19:54:51,290 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:51,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:51,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-21 19:54:51,291 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:51,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:51,291 INFO L82 PathProgramCache]: Analyzing trace with hash -858312845, now seen corresponding path program 1 times [2021-10-21 19:54:51,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:51,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082263026] [2021-10-21 19:54:51,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:51,292 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:51,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:51,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:51,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-21 19:54:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:51,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:54:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:51,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:54:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:54:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:51,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:51,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082263026] [2021-10-21 19:54:51,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082263026] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:51,534 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:51,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:54:51,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218852450] [2021-10-21 19:54:51,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:54:51,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:51,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:54:51,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:51,536 INFO L87 Difference]: Start difference. First operand 499 states and 621 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-21 19:54:52,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:52,931 INFO L93 Difference]: Finished difference Result 521 states and 649 transitions. [2021-10-21 19:54:52,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:54:52,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2021-10-21 19:54:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:52,934 INFO L225 Difference]: With dead ends: 521 [2021-10-21 19:54:52,934 INFO L226 Difference]: Without dead ends: 521 [2021-10-21 19:54:52,935 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 411.2ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-10-21 19:54:52,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-10-21 19:54:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2021-10-21 19:54:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.2468193384223918) internal successors, (490), 401 states have internal predecessors, (490), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2021-10-21 19:54:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2021-10-21 19:54:52,946 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2021-10-21 19:54:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:52,946 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2021-10-21 19:54:52,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-21 19:54:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2021-10-21 19:54:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-21 19:54:52,948 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:52,948 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:52,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-21 19:54:52,949 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:52,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:52,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1201869596, now seen corresponding path program 1 times [2021-10-21 19:54:52,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:52,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175655463] [2021-10-21 19:54:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:52,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:53,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:53,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:53,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:53,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:53,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:54:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:53,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:54:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:53,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:53,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175655463] [2021-10-21 19:54:53,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175655463] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:53,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:53,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-21 19:54:53,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926553341] [2021-10-21 19:54:53,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 19:54:53,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:53,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 19:54:53,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-21 19:54:53,182 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-21 19:54:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:54,542 INFO L93 Difference]: Finished difference Result 519 states and 644 transitions. [2021-10-21 19:54:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:54:54,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-10-21 19:54:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:54,544 INFO L225 Difference]: With dead ends: 519 [2021-10-21 19:54:54,544 INFO L226 Difference]: Without dead ends: 519 [2021-10-21 19:54:54,544 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 269.1ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:54:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-10-21 19:54:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2021-10-21 19:54:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 396 states have (on average 1.244949494949495) internal successors, (493), 404 states have internal predecessors, (493), 61 states have call successors, (61), 42 states have call predecessors, (61), 45 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69) [2021-10-21 19:54:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2021-10-21 19:54:54,554 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2021-10-21 19:54:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:54,555 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2021-10-21 19:54:54,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-21 19:54:54,555 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2021-10-21 19:54:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-21 19:54:54,557 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:54,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:54,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-21 19:54:54,557 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:54,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:54,558 INFO L82 PathProgramCache]: Analyzing trace with hash -813300133, now seen corresponding path program 1 times [2021-10-21 19:54:54,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:54,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323675648] [2021-10-21 19:54:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:54,558 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:54,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:54,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:54,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:54:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:54,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:54:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:54,804 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:54,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323675648] [2021-10-21 19:54:54,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323675648] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:54,804 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:54,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:54:54,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955016291] [2021-10-21 19:54:54,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:54:54,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:54,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:54:54,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:54,806 INFO L87 Difference]: Start difference. First operand 503 states and 623 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-21 19:54:56,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:56,368 INFO L93 Difference]: Finished difference Result 505 states and 625 transitions. [2021-10-21 19:54:56,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:54:56,368 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-10-21 19:54:56,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:56,370 INFO L225 Difference]: With dead ends: 505 [2021-10-21 19:54:56,370 INFO L226 Difference]: Without dead ends: 505 [2021-10-21 19:54:56,370 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 323.9ms TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-10-21 19:54:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-21 19:54:56,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2021-10-21 19:54:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.2395833333333333) internal successors, (476), 391 states have internal predecessors, (476), 60 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2021-10-21 19:54:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2021-10-21 19:54:56,377 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2021-10-21 19:54:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:56,378 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2021-10-21 19:54:56,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-21 19:54:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2021-10-21 19:54:56,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-21 19:54:56,380 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:56,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:56,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-21 19:54:56,381 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:56,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:56,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1336611306, now seen corresponding path program 1 times [2021-10-21 19:54:56,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:56,381 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897391895] [2021-10-21 19:54:56,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:56,382 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:56,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:56,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:56,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:54:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:56,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:56,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:56,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897391895] [2021-10-21 19:54:56,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897391895] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:56,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:56,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:54:56,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459168186] [2021-10-21 19:54:56,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:54:56,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:56,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:54:56,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:54:56,651 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:57,968 INFO L93 Difference]: Finished difference Result 519 states and 639 transitions. [2021-10-21 19:54:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:54:57,969 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2021-10-21 19:54:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:57,970 INFO L225 Difference]: With dead ends: 519 [2021-10-21 19:54:57,970 INFO L226 Difference]: Without dead ends: 501 [2021-10-21 19:54:57,970 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 194.3ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:54:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-10-21 19:54:57,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2021-10-21 19:54:57,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2388451443569555) internal successors, (472), 388 states have internal predecessors, (472), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2021-10-21 19:54:57,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 598 transitions. [2021-10-21 19:54:57,978 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 598 transitions. Word has length 63 [2021-10-21 19:54:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:57,978 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 598 transitions. [2021-10-21 19:54:57,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:54:57,978 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 598 transitions. [2021-10-21 19:54:57,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-21 19:54:57,980 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:57,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:57,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-21 19:54:57,981 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:57,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:57,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2015464718, now seen corresponding path program 1 times [2021-10-21 19:54:57,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:57,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888888035] [2021-10-21 19:54:57,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:57,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:58,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:58,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:58,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:58,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-21 19:54:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:54:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:58,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:54:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:58,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:54:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:58,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:58,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888888035] [2021-10-21 19:54:58,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888888035] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:58,269 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:58,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:54:58,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646362400] [2021-10-21 19:54:58,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:54:58,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:58,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:54:58,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:54:58,271 INFO L87 Difference]: Start difference. First operand 485 states and 598 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-10-21 19:54:59,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:54:59,346 INFO L93 Difference]: Finished difference Result 520 states and 645 transitions. [2021-10-21 19:54:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 19:54:59,348 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2021-10-21 19:54:59,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:54:59,349 INFO L225 Difference]: With dead ends: 520 [2021-10-21 19:54:59,349 INFO L226 Difference]: Without dead ends: 520 [2021-10-21 19:54:59,350 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 266.0ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:54:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-10-21 19:54:59,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 485. [2021-10-21 19:54:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2335958005249343) internal successors, (470), 388 states have internal predecessors, (470), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2021-10-21 19:54:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2021-10-21 19:54:59,359 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 71 [2021-10-21 19:54:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:54:59,360 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2021-10-21 19:54:59,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-10-21 19:54:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2021-10-21 19:54:59,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-21 19:54:59,362 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:54:59,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:54:59,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-21 19:54:59,362 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:54:59,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:54:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash -137076744, now seen corresponding path program 1 times [2021-10-21 19:54:59,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:54:59,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601093693] [2021-10-21 19:54:59,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:54:59,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:54:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:54:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:59,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:54:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:59,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:54:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:59,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:54:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-10-21 19:54:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:54:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:54:59,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:54:59,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601093693] [2021-10-21 19:54:59,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601093693] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:54:59,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:54:59,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-21 19:54:59,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571655207] [2021-10-21 19:54:59,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 19:54:59,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:54:59,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 19:54:59,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:54:59,622 INFO L87 Difference]: Start difference. First operand 485 states and 596 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:55:00,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:00,788 INFO L93 Difference]: Finished difference Result 509 states and 624 transitions. [2021-10-21 19:55:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:55:00,788 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2021-10-21 19:55:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:00,790 INFO L225 Difference]: With dead ends: 509 [2021-10-21 19:55:00,790 INFO L226 Difference]: Without dead ends: 490 [2021-10-21 19:55:00,790 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 178.1ms TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:55:00,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-10-21 19:55:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2021-10-21 19:55:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 372 states have (on average 1.2311827956989247) internal successors, (458), 379 states have internal predecessors, (458), 58 states have call successors, (58), 42 states have call predecessors, (58), 43 states have return successors, (65), 53 states have call predecessors, (65), 52 states have call successors, (65) [2021-10-21 19:55:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2021-10-21 19:55:00,798 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2021-10-21 19:55:00,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:00,798 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2021-10-21 19:55:00,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:55:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2021-10-21 19:55:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-21 19:55:00,800 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:00,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:00,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-21 19:55:00,800 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:00,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:00,801 INFO L82 PathProgramCache]: Analyzing trace with hash 130187692, now seen corresponding path program 1 times [2021-10-21 19:55:00,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:00,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060446783] [2021-10-21 19:55:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:00,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:00,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:00,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:00,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:00,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:01,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:01,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060446783] [2021-10-21 19:55:01,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060446783] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:01,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:01,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:55:01,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759268256] [2021-10-21 19:55:01,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:55:01,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:01,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:55:01,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:55:01,056 INFO L87 Difference]: Start difference. First operand 474 states and 581 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:55:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:02,128 INFO L93 Difference]: Finished difference Result 504 states and 616 transitions. [2021-10-21 19:55:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:55:02,128 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2021-10-21 19:55:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:02,130 INFO L225 Difference]: With dead ends: 504 [2021-10-21 19:55:02,130 INFO L226 Difference]: Without dead ends: 485 [2021-10-21 19:55:02,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 195.0ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:55:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-10-21 19:55:02,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2021-10-21 19:55:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 368 states have (on average 1.2309782608695652) internal successors, (453), 375 states have internal predecessors, (453), 57 states have call successors, (57), 42 states have call predecessors, (57), 43 states have return successors, (64), 52 states have call predecessors, (64), 51 states have call successors, (64) [2021-10-21 19:55:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2021-10-21 19:55:02,152 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2021-10-21 19:55:02,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:02,154 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2021-10-21 19:55:02,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:55:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2021-10-21 19:55:02,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-21 19:55:02,157 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:02,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:02,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-21 19:55:02,158 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:02,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:02,158 INFO L82 PathProgramCache]: Analyzing trace with hash -799923778, now seen corresponding path program 1 times [2021-10-21 19:55:02,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:02,159 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698138144] [2021-10-21 19:55:02,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:02,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:02,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:02,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:02,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:02,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:02,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:02,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:02,421 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698138144] [2021-10-21 19:55:02,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698138144] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:02,421 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:02,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:55:02,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392882177] [2021-10-21 19:55:02,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:55:02,422 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:02,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:55:02,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:55:02,423 INFO L87 Difference]: Start difference. First operand 469 states and 574 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:55:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:03,642 INFO L93 Difference]: Finished difference Result 499 states and 609 transitions. [2021-10-21 19:55:03,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:55:03,643 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2021-10-21 19:55:03,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:03,644 INFO L225 Difference]: With dead ends: 499 [2021-10-21 19:55:03,645 INFO L226 Difference]: Without dead ends: 481 [2021-10-21 19:55:03,645 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 190.3ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:55:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-10-21 19:55:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2021-10-21 19:55:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2301369863013698) internal successors, (449), 372 states have internal predecessors, (449), 56 states have call successors, (56), 42 states have call predecessors, (56), 43 states have return successors, (63), 51 states have call predecessors, (63), 50 states have call successors, (63) [2021-10-21 19:55:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2021-10-21 19:55:03,654 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2021-10-21 19:55:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:03,654 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2021-10-21 19:55:03,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:55:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2021-10-21 19:55:03,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-21 19:55:03,656 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:03,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:03,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-21 19:55:03,657 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:03,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:03,657 INFO L82 PathProgramCache]: Analyzing trace with hash -163798071, now seen corresponding path program 1 times [2021-10-21 19:55:03,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:03,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41664081] [2021-10-21 19:55:03,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:03,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:03,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:03,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:03,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-21 19:55:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:03,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:03,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:03,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41664081] [2021-10-21 19:55:03,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41664081] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:03,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:03,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-21 19:55:03,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510357676] [2021-10-21 19:55:03,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:55:03,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:03,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:55:03,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:55:03,868 INFO L87 Difference]: Start difference. First operand 465 states and 568 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-21 19:55:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:04,832 INFO L93 Difference]: Finished difference Result 625 states and 761 transitions. [2021-10-21 19:55:04,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:55:04,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2021-10-21 19:55:04,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:04,835 INFO L225 Difference]: With dead ends: 625 [2021-10-21 19:55:04,835 INFO L226 Difference]: Without dead ends: 625 [2021-10-21 19:55:04,836 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 217.8ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:55:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-10-21 19:55:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2021-10-21 19:55:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.220524017467249) internal successors, (559), 467 states have internal predecessors, (559), 69 states have call successors, (69), 52 states have call predecessors, (69), 58 states have return successors, (88), 67 states have call predecessors, (88), 64 states have call successors, (88) [2021-10-21 19:55:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2021-10-21 19:55:04,847 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 70 [2021-10-21 19:55:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:04,847 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2021-10-21 19:55:04,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-21 19:55:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2021-10-21 19:55:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-21 19:55:04,849 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:04,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:04,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-21 19:55:04,850 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:04,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1554229741, now seen corresponding path program 1 times [2021-10-21 19:55:04,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:04,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373067582] [2021-10-21 19:55:04,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:04,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:04,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:04,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:05,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:05,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:05,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-10-21 19:55:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:05,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:05,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:05,105 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373067582] [2021-10-21 19:55:05,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373067582] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:05,105 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:05,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:55:05,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910799278] [2021-10-21 19:55:05,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:55:05,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:05,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:55:05,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:55:05,107 INFO L87 Difference]: Start difference. First operand 586 states and 716 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:55:06,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:06,511 INFO L93 Difference]: Finished difference Result 616 states and 752 transitions. [2021-10-21 19:55:06,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:55:06,512 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2021-10-21 19:55:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:06,514 INFO L225 Difference]: With dead ends: 616 [2021-10-21 19:55:06,514 INFO L226 Difference]: Without dead ends: 576 [2021-10-21 19:55:06,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 203.8ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:55:06,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-10-21 19:55:06,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2021-10-21 19:55:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 437 states have (on average 1.2196796338672768) internal successors, (533), 446 states have internal predecessors, (533), 66 states have call successors, (66), 50 states have call predecessors, (66), 56 states have return successors, (85), 64 states have call predecessors, (85), 61 states have call successors, (85) [2021-10-21 19:55:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2021-10-21 19:55:06,525 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2021-10-21 19:55:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:06,526 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2021-10-21 19:55:06,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-21 19:55:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2021-10-21 19:55:06,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-21 19:55:06,528 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:06,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:06,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-21 19:55:06,529 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:06,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:06,529 INFO L82 PathProgramCache]: Analyzing trace with hash -635159596, now seen corresponding path program 1 times [2021-10-21 19:55:06,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:06,530 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5197248] [2021-10-21 19:55:06,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:06,530 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:06,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:06,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:06,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:06,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-21 19:55:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:06,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:55:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:06,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:06,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-10-21 19:55:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:06,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:06,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5197248] [2021-10-21 19:55:06,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5197248] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:06,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:06,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:55:06,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081063975] [2021-10-21 19:55:06,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:55:06,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:06,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:55:06,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:55:06,902 INFO L87 Difference]: Start difference. First operand 560 states and 684 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-21 19:55:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:08,495 INFO L93 Difference]: Finished difference Result 586 states and 715 transitions. [2021-10-21 19:55:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-21 19:55:08,496 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2021-10-21 19:55:08,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:08,497 INFO L225 Difference]: With dead ends: 586 [2021-10-21 19:55:08,498 INFO L226 Difference]: Without dead ends: 535 [2021-10-21 19:55:08,498 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 389.8ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-10-21 19:55:08,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-10-21 19:55:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2021-10-21 19:55:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 403 states have (on average 1.2133995037220844) internal successors, (489), 412 states have internal predecessors, (489), 62 states have call successors, (62), 47 states have call predecessors, (62), 53 states have return successors, (81), 60 states have call predecessors, (81), 57 states have call successors, (81) [2021-10-21 19:55:08,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2021-10-21 19:55:08,521 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2021-10-21 19:55:08,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:08,521 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2021-10-21 19:55:08,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-21 19:55:08,522 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2021-10-21 19:55:08,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-10-21 19:55:08,523 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:08,524 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:08,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-21 19:55:08,524 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:08,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1523992416, now seen corresponding path program 1 times [2021-10-21 19:55:08,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:08,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54216241] [2021-10-21 19:55:08,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:08,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:08,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:08,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-21 19:55:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:08,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-21 19:55:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:08,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:08,835 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54216241] [2021-10-21 19:55:08,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54216241] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:08,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:08,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:55:08,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792524198] [2021-10-21 19:55:08,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:55:08,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:08,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:55:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:55:08,837 INFO L87 Difference]: Start difference. First operand 519 states and 632 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-10-21 19:55:10,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:10,242 INFO L93 Difference]: Finished difference Result 523 states and 631 transitions. [2021-10-21 19:55:10,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-21 19:55:10,242 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2021-10-21 19:55:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:10,244 INFO L225 Difference]: With dead ends: 523 [2021-10-21 19:55:10,244 INFO L226 Difference]: Without dead ends: 523 [2021-10-21 19:55:10,245 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 603.7ms TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2021-10-21 19:55:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-10-21 19:55:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2021-10-21 19:55:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 389 states have (on average 1.2133676092544987) internal successors, (472), 397 states have internal predecessors, (472), 60 states have call successors, (60), 47 states have call predecessors, (60), 51 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2021-10-21 19:55:10,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2021-10-21 19:55:10,255 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2021-10-21 19:55:10,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:10,255 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2021-10-21 19:55:10,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-10-21 19:55:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2021-10-21 19:55:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-21 19:55:10,257 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:10,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:10,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-21 19:55:10,258 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:10,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:10,259 INFO L82 PathProgramCache]: Analyzing trace with hash 100987323, now seen corresponding path program 1 times [2021-10-21 19:55:10,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:10,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386772762] [2021-10-21 19:55:10,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:10,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:10,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:10,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:10,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:10,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-21 19:55:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:10,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:10,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:10,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:10,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-10-21 19:55:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:10,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:10,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:10,602 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386772762] [2021-10-21 19:55:10,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386772762] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:10,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:10,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:55:10,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353462873] [2021-10-21 19:55:10,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:55:10,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:10,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:55:10,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:55:10,604 INFO L87 Difference]: Start difference. First operand 501 states and 602 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-21 19:55:11,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:11,520 INFO L93 Difference]: Finished difference Result 585 states and 740 transitions. [2021-10-21 19:55:11,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-21 19:55:11,521 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2021-10-21 19:55:11,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:11,523 INFO L225 Difference]: With dead ends: 585 [2021-10-21 19:55:11,523 INFO L226 Difference]: Without dead ends: 585 [2021-10-21 19:55:11,524 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 384.9ms TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-10-21 19:55:11,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2021-10-21 19:55:11,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2021-10-21 19:55:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 371 states have internal predecessors, (443), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2021-10-21 19:55:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2021-10-21 19:55:11,534 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2021-10-21 19:55:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:11,535 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2021-10-21 19:55:11,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-21 19:55:11,535 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2021-10-21 19:55:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-21 19:55:11,536 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:11,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-21 19:55:11,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-21 19:55:11,537 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:11,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:11,538 INFO L82 PathProgramCache]: Analyzing trace with hash 501668298, now seen corresponding path program 1 times [2021-10-21 19:55:11,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:11,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736402200] [2021-10-21 19:55:11,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:11,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:11,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:11,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:11,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:11,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:11,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:11,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-21 19:55:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:11,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:11,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736402200] [2021-10-21 19:55:11,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736402200] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:11,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:11,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-21 19:55:11,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260180369] [2021-10-21 19:55:11,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-21 19:55:11,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:11,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-21 19:55:11,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:55:11,866 INFO L87 Difference]: Start difference. First operand 465 states and 556 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-21 19:55:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:12,981 INFO L93 Difference]: Finished difference Result 523 states and 626 transitions. [2021-10-21 19:55:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-21 19:55:12,982 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2021-10-21 19:55:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:12,983 INFO L225 Difference]: With dead ends: 523 [2021-10-21 19:55:12,983 INFO L226 Difference]: Without dead ends: 505 [2021-10-21 19:55:12,983 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 390.0ms TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-10-21 19:55:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-21 19:55:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2021-10-21 19:55:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 372 states have (on average 1.2096774193548387) internal successors, (450), 378 states have internal predecessors, (450), 53 states have call successors, (53), 41 states have call predecessors, (53), 47 states have return successors, (63), 54 states have call predecessors, (63), 49 states have call successors, (63) [2021-10-21 19:55:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2021-10-21 19:55:12,992 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2021-10-21 19:55:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:12,992 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2021-10-21 19:55:12,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-21 19:55:12,993 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2021-10-21 19:55:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-21 19:55:12,994 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:12,994 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-21 19:55:12,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-21 19:55:12,995 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1591352246, now seen corresponding path program 1 times [2021-10-21 19:55:12,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:12,996 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009928595] [2021-10-21 19:55:12,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:12,996 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:13,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:13,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:13,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:13,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:13,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:13,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:13,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-10-21 19:55:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:13,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:13,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009928595] [2021-10-21 19:55:13,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009928595] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:13,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:13,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-21 19:55:13,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98681484] [2021-10-21 19:55:13,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-21 19:55:13,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:13,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-21 19:55:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:55:13,335 INFO L87 Difference]: Start difference. First operand 473 states and 566 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-21 19:55:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:14,381 INFO L93 Difference]: Finished difference Result 523 states and 625 transitions. [2021-10-21 19:55:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-21 19:55:14,382 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2021-10-21 19:55:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:14,384 INFO L225 Difference]: With dead ends: 523 [2021-10-21 19:55:14,384 INFO L226 Difference]: Without dead ends: 505 [2021-10-21 19:55:14,384 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 313.4ms TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-10-21 19:55:14,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-21 19:55:14,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2021-10-21 19:55:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.210958904109589) internal successors, (442), 371 states have internal predecessors, (442), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2021-10-21 19:55:14,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2021-10-21 19:55:14,390 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2021-10-21 19:55:14,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:14,390 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2021-10-21 19:55:14,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-21 19:55:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2021-10-21 19:55:14,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-21 19:55:14,392 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:14,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-21 19:55:14,392 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:14,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:14,392 INFO L82 PathProgramCache]: Analyzing trace with hash 590529597, now seen corresponding path program 1 times [2021-10-21 19:55:14,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:14,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084496829] [2021-10-21 19:55:14,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:14,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:14,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:14,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:14,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:14,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-21 19:55:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:14,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-10-21 19:55:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:14,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-10-21 19:55:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:14,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:14,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:14,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084496829] [2021-10-21 19:55:14,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084496829] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:14,700 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:14,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-21 19:55:14,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745186821] [2021-10-21 19:55:14,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-21 19:55:14,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:14,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:55:14,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:55:14,701 INFO L87 Difference]: Start difference. First operand 465 states and 555 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-10-21 19:55:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:16,103 INFO L93 Difference]: Finished difference Result 611 states and 714 transitions. [2021-10-21 19:55:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 19:55:16,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2021-10-21 19:55:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:16,105 INFO L225 Difference]: With dead ends: 611 [2021-10-21 19:55:16,105 INFO L226 Difference]: Without dead ends: 611 [2021-10-21 19:55:16,105 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 398.6ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-10-21 19:55:16,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-10-21 19:55:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 586. [2021-10-21 19:55:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 462 states have (on average 1.2034632034632036) internal successors, (556), 470 states have internal predecessors, (556), 61 states have call successors, (61), 53 states have call predecessors, (61), 62 states have return successors, (72), 63 states have call predecessors, (72), 57 states have call successors, (72) [2021-10-21 19:55:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 689 transitions. [2021-10-21 19:55:16,112 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 689 transitions. Word has length 92 [2021-10-21 19:55:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:16,112 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 689 transitions. [2021-10-21 19:55:16,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-10-21 19:55:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 689 transitions. [2021-10-21 19:55:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-21 19:55:16,114 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:16,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:16,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-21 19:55:16,114 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:16,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:16,115 INFO L82 PathProgramCache]: Analyzing trace with hash -605677229, now seen corresponding path program 1 times [2021-10-21 19:55:16,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:16,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081460848] [2021-10-21 19:55:16,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:16,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:16,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:16,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:16,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:16,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-21 19:55:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:16,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:16,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-10-21 19:55:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:16,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-21 19:55:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:16,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:16,437 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081460848] [2021-10-21 19:55:16,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081460848] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:16,437 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:16,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-21 19:55:16,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110242019] [2021-10-21 19:55:16,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-21 19:55:16,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-21 19:55:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:55:16,438 INFO L87 Difference]: Start difference. First operand 586 states and 689 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-10-21 19:55:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:17,506 INFO L93 Difference]: Finished difference Result 587 states and 689 transitions. [2021-10-21 19:55:17,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 19:55:17,506 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 93 [2021-10-21 19:55:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:17,508 INFO L225 Difference]: With dead ends: 587 [2021-10-21 19:55:17,508 INFO L226 Difference]: Without dead ends: 498 [2021-10-21 19:55:17,508 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 287.7ms TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-10-21 19:55:17,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-10-21 19:55:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2021-10-21 19:55:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.20671834625323) internal successors, (467), 394 states have internal predecessors, (467), 54 states have call successors, (54), 47 states have call predecessors, (54), 54 states have return successors, (64), 55 states have call predecessors, (64), 51 states have call successors, (64) [2021-10-21 19:55:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 585 transitions. [2021-10-21 19:55:17,516 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 585 transitions. Word has length 93 [2021-10-21 19:55:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:17,516 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 585 transitions. [2021-10-21 19:55:17,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-10-21 19:55:17,517 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 585 transitions. [2021-10-21 19:55:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-21 19:55:17,518 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:17,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:17,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-21 19:55:17,519 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:17,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:17,519 INFO L82 PathProgramCache]: Analyzing trace with hash 612741088, now seen corresponding path program 1 times [2021-10-21 19:55:17,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:17,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437876012] [2021-10-21 19:55:17,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:17,520 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:17,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:17,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:17,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:17,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:17,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:17,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:17,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:17,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-21 19:55:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:17,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-10-21 19:55:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:17,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:17,803 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437876012] [2021-10-21 19:55:17,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437876012] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:17,803 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:17,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:55:17,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665406494] [2021-10-21 19:55:17,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:55:17,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:17,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:55:17,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:55:17,806 INFO L87 Difference]: Start difference. First operand 496 states and 585 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-21 19:55:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:18,450 INFO L93 Difference]: Finished difference Result 494 states and 580 transitions. [2021-10-21 19:55:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 19:55:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2021-10-21 19:55:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:18,453 INFO L225 Difference]: With dead ends: 494 [2021-10-21 19:55:18,453 INFO L226 Difference]: Without dead ends: 492 [2021-10-21 19:55:18,453 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 201.0ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:55:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-10-21 19:55:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 439. [2021-10-21 19:55:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 343 states have (on average 1.19533527696793) internal successors, (410), 349 states have internal predecessors, (410), 47 states have call successors, (47), 42 states have call predecessors, (47), 48 states have return successors, (55), 48 states have call predecessors, (55), 44 states have call successors, (55) [2021-10-21 19:55:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 512 transitions. [2021-10-21 19:55:18,462 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 512 transitions. Word has length 99 [2021-10-21 19:55:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:18,463 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 512 transitions. [2021-10-21 19:55:18,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-21 19:55:18,463 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 512 transitions. [2021-10-21 19:55:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-21 19:55:18,465 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:18,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:18,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-21 19:55:18,465 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:18,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:18,466 INFO L82 PathProgramCache]: Analyzing trace with hash -78015673, now seen corresponding path program 1 times [2021-10-21 19:55:18,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:18,466 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869385015] [2021-10-21 19:55:18,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:18,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:18,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:18,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:18,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:18,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:18,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:18,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:18,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-21 19:55:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:18,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-10-21 19:55:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:18,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:18,770 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869385015] [2021-10-21 19:55:18,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869385015] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:18,770 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:18,770 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:55:18,770 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027383181] [2021-10-21 19:55:18,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:55:18,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:18,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:55:18,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:55:18,772 INFO L87 Difference]: Start difference. First operand 439 states and 512 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-10-21 19:55:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:19,989 INFO L93 Difference]: Finished difference Result 839 states and 983 transitions. [2021-10-21 19:55:19,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-21 19:55:19,990 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2021-10-21 19:55:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:19,992 INFO L225 Difference]: With dead ends: 839 [2021-10-21 19:55:19,992 INFO L226 Difference]: Without dead ends: 797 [2021-10-21 19:55:19,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 438.6ms TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2021-10-21 19:55:19,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-10-21 19:55:20,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 419. [2021-10-21 19:55:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 327 states have (on average 1.1957186544342508) internal successors, (391), 332 states have internal predecessors, (391), 44 states have call successors, (44), 41 states have call predecessors, (44), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2021-10-21 19:55:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 487 transitions. [2021-10-21 19:55:20,001 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 487 transitions. Word has length 99 [2021-10-21 19:55:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:20,001 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 487 transitions. [2021-10-21 19:55:20,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-10-21 19:55:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 487 transitions. [2021-10-21 19:55:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-21 19:55:20,002 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:20,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:20,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-21 19:55:20,003 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1954562899, now seen corresponding path program 1 times [2021-10-21 19:55:20,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:20,003 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468358129] [2021-10-21 19:55:20,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:20,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:55:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:55:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-10-21 19:55:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:20,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:20,398 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:20,398 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468358129] [2021-10-21 19:55:20,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468358129] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:20,398 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:20,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-21 19:55:20,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811775841] [2021-10-21 19:55:20,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-21 19:55:20,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:20,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-21 19:55:20,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-10-21 19:55:20,400 INFO L87 Difference]: Start difference. First operand 419 states and 487 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2021-10-21 19:55:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:21,145 INFO L93 Difference]: Finished difference Result 464 states and 541 transitions. [2021-10-21 19:55:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-21 19:55:21,145 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2021-10-21 19:55:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:21,147 INFO L225 Difference]: With dead ends: 464 [2021-10-21 19:55:21,147 INFO L226 Difference]: Without dead ends: 438 [2021-10-21 19:55:21,147 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 338.4ms TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2021-10-21 19:55:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-10-21 19:55:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 428. [2021-10-21 19:55:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.182089552238806) internal successors, (396), 341 states have internal predecessors, (396), 45 states have call successors, (45), 41 states have call predecessors, (45), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2021-10-21 19:55:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 493 transitions. [2021-10-21 19:55:21,155 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 493 transitions. Word has length 104 [2021-10-21 19:55:21,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:21,155 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 493 transitions. [2021-10-21 19:55:21,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2021-10-21 19:55:21,155 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 493 transitions. [2021-10-21 19:55:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-10-21 19:55:21,157 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:21,157 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:21,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-21 19:55:21,158 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:21,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:21,158 INFO L82 PathProgramCache]: Analyzing trace with hash 260351279, now seen corresponding path program 1 times [2021-10-21 19:55:21,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:21,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685795596] [2021-10-21 19:55:21,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:21,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-21 19:55:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-10-21 19:55:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:55:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-21 19:55:21,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:21,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685795596] [2021-10-21 19:55:21,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685795596] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:21,448 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:21,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-21 19:55:21,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444294005] [2021-10-21 19:55:21,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 19:55:21,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:21,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 19:55:21,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:55:21,449 INFO L87 Difference]: Start difference. First operand 428 states and 493 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-21 19:55:21,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:21,937 INFO L93 Difference]: Finished difference Result 440 states and 505 transitions. [2021-10-21 19:55:21,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:55:21,938 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2021-10-21 19:55:21,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:21,939 INFO L225 Difference]: With dead ends: 440 [2021-10-21 19:55:21,939 INFO L226 Difference]: Without dead ends: 440 [2021-10-21 19:55:21,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 222.3ms TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-10-21 19:55:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-10-21 19:55:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 436. [2021-10-21 19:55:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 341 states have (on average 1.1788856304985338) internal successors, (402), 347 states have internal predecessors, (402), 45 states have call successors, (45), 41 states have call predecessors, (45), 49 states have return successors, (54), 47 states have call predecessors, (54), 41 states have call successors, (54) [2021-10-21 19:55:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 501 transitions. [2021-10-21 19:55:21,947 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 501 transitions. Word has length 113 [2021-10-21 19:55:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:21,947 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 501 transitions. [2021-10-21 19:55:21,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-21 19:55:21,948 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 501 transitions. [2021-10-21 19:55:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-10-21 19:55:21,949 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:21,949 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:21,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-10-21 19:55:21,950 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:21,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:21,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1796786958, now seen corresponding path program 1 times [2021-10-21 19:55:21,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:21,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368012272] [2021-10-21 19:55:21,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:21,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-21 19:55:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-10-21 19:55:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:55:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-21 19:55:22,236 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:22,237 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368012272] [2021-10-21 19:55:22,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368012272] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:22,237 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:22,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-21 19:55:22,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951767830] [2021-10-21 19:55:22,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:55:22,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:22,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:55:22,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:55:22,239 INFO L87 Difference]: Start difference. First operand 436 states and 501 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2021-10-21 19:55:22,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:22,815 INFO L93 Difference]: Finished difference Result 387 states and 434 transitions. [2021-10-21 19:55:22,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 19:55:22,816 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) Word has length 113 [2021-10-21 19:55:22,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:22,817 INFO L225 Difference]: With dead ends: 387 [2021-10-21 19:55:22,817 INFO L226 Difference]: Without dead ends: 387 [2021-10-21 19:55:22,817 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 206.8ms TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-10-21 19:55:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-10-21 19:55:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 249. [2021-10-21 19:55:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 195 states have (on average 1.1384615384615384) internal successors, (222), 197 states have internal predecessors, (222), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2021-10-21 19:55:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 275 transitions. [2021-10-21 19:55:22,822 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 275 transitions. Word has length 113 [2021-10-21 19:55:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:22,822 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 275 transitions. [2021-10-21 19:55:22,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2021-10-21 19:55:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 275 transitions. [2021-10-21 19:55:22,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-10-21 19:55:22,823 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:22,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-21 19:55:22,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-10-21 19:55:22,824 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:22,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:22,824 INFO L82 PathProgramCache]: Analyzing trace with hash 960404334, now seen corresponding path program 1 times [2021-10-21 19:55:22,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:22,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143493844] [2021-10-21 19:55:22,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:22,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:22,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:23,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:55:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:23,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:23,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:23,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:23,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:55:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:23,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:23,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-10-21 19:55:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:23,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-21 19:55:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:23,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:23,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143493844] [2021-10-21 19:55:23,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143493844] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:23,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:23,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:55:23,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278679088] [2021-10-21 19:55:23,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:55:23,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:55:23,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:55:23,161 INFO L87 Difference]: Start difference. First operand 249 states and 275 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-21 19:55:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:23,923 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2021-10-21 19:55:23,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:55:23,924 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2021-10-21 19:55:23,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:23,924 INFO L225 Difference]: With dead ends: 263 [2021-10-21 19:55:23,925 INFO L226 Difference]: Without dead ends: 263 [2021-10-21 19:55:23,925 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 339.2ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-10-21 19:55:23,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-10-21 19:55:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 253. [2021-10-21 19:55:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 198 states have (on average 1.1363636363636365) internal successors, (225), 200 states have internal predecessors, (225), 26 states have call successors, (26), 26 states have call predecessors, (26), 28 states have return successors, (28), 26 states have call predecessors, (28), 24 states have call successors, (28) [2021-10-21 19:55:23,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 279 transitions. [2021-10-21 19:55:23,929 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 279 transitions. Word has length 120 [2021-10-21 19:55:23,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:23,930 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 279 transitions. [2021-10-21 19:55:23,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-21 19:55:23,930 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 279 transitions. [2021-10-21 19:55:23,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-10-21 19:55:23,931 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:23,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-21 19:55:23,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-10-21 19:55:23,931 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:23,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1141890831, now seen corresponding path program 1 times [2021-10-21 19:55:23,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:23,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841492024] [2021-10-21 19:55:23,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:23,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:55:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:55:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-10-21 19:55:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-21 19:55:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:55:24,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:24,308 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841492024] [2021-10-21 19:55:24,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841492024] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:24,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:24,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:55:24,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338198468] [2021-10-21 19:55:24,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:55:24,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:55:24,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:55:24,310 INFO L87 Difference]: Start difference. First operand 253 states and 279 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-21 19:55:24,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:24,867 INFO L93 Difference]: Finished difference Result 263 states and 289 transitions. [2021-10-21 19:55:24,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:55:24,867 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2021-10-21 19:55:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:24,868 INFO L225 Difference]: With dead ends: 263 [2021-10-21 19:55:24,868 INFO L226 Difference]: Without dead ends: 254 [2021-10-21 19:55:24,868 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 294.9ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-10-21 19:55:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-21 19:55:24,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2021-10-21 19:55:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2021-10-21 19:55:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2021-10-21 19:55:24,874 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 120 [2021-10-21 19:55:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:24,874 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2021-10-21 19:55:24,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-21 19:55:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2021-10-21 19:55:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-10-21 19:55:24,876 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:24,876 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:24,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-10-21 19:55:24,876 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:24,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:24,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1073285628, now seen corresponding path program 1 times [2021-10-21 19:55:24,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:24,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841492356] [2021-10-21 19:55:24,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:24,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:55:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:55:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:55:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-10-21 19:55:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-10-21 19:55:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-21 19:55:25,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:25,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841492356] [2021-10-21 19:55:25,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841492356] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:25,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:25,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-21 19:55:25,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67445883] [2021-10-21 19:55:25,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-21 19:55:25,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:25,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-21 19:55:25,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2021-10-21 19:55:25,502 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-21 19:55:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:26,519 INFO L93 Difference]: Finished difference Result 317 states and 357 transitions. [2021-10-21 19:55:26,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-21 19:55:26,519 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 150 [2021-10-21 19:55:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:26,520 INFO L225 Difference]: With dead ends: 317 [2021-10-21 19:55:26,520 INFO L226 Difference]: Without dead ends: 285 [2021-10-21 19:55:26,520 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 521.1ms TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2021-10-21 19:55:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-10-21 19:55:26,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 265. [2021-10-21 19:55:26,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.138755980861244) internal successors, (238), 211 states have internal predecessors, (238), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2021-10-21 19:55:26,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 293 transitions. [2021-10-21 19:55:26,524 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 293 transitions. Word has length 150 [2021-10-21 19:55:26,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:26,524 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 293 transitions. [2021-10-21 19:55:26,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-21 19:55:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 293 transitions. [2021-10-21 19:55:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-10-21 19:55:26,525 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:26,525 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:26,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-10-21 19:55:26,526 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:26,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:26,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1690329856, now seen corresponding path program 1 times [2021-10-21 19:55:26,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:26,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809593713] [2021-10-21 19:55:26,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:26,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:26,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:26,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:26,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:26,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:26,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:55:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:26,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:26,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:26,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:26,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:26,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:55:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:55:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:27,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:27,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:27,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-10-21 19:55:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-10-21 19:55:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-21 19:55:27,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:27,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809593713] [2021-10-21 19:55:27,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809593713] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:27,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:27,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-21 19:55:27,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800624868] [2021-10-21 19:55:27,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-10-21 19:55:27,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:27,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-10-21 19:55:27,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-10-21 19:55:27,059 INFO L87 Difference]: Start difference. First operand 265 states and 293 transitions. Second operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-21 19:55:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:27,850 INFO L93 Difference]: Finished difference Result 284 states and 314 transitions. [2021-10-21 19:55:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-21 19:55:27,851 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 151 [2021-10-21 19:55:27,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:27,852 INFO L225 Difference]: With dead ends: 284 [2021-10-21 19:55:27,852 INFO L226 Difference]: Without dead ends: 279 [2021-10-21 19:55:27,852 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 409.6ms TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2021-10-21 19:55:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-10-21 19:55:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 265. [2021-10-21 19:55:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.1339712918660287) internal successors, (237), 211 states have internal predecessors, (237), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2021-10-21 19:55:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions. [2021-10-21 19:55:27,855 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 151 [2021-10-21 19:55:27,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:27,855 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions. [2021-10-21 19:55:27,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-21 19:55:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions. [2021-10-21 19:55:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-10-21 19:55:27,857 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:27,857 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:27,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-10-21 19:55:27,858 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:27,858 INFO L82 PathProgramCache]: Analyzing trace with hash -206728514, now seen corresponding path program 1 times [2021-10-21 19:55:27,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:27,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559942476] [2021-10-21 19:55:27,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:27,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:28,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:55:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:55:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:55:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-10-21 19:55:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-10-21 19:55:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-10-21 19:55:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-21 19:55:28,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:28,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559942476] [2021-10-21 19:55:28,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559942476] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:28,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:28,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-21 19:55:28,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650478521] [2021-10-21 19:55:28,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-21 19:55:28,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:28,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-21 19:55:28,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2021-10-21 19:55:28,370 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-21 19:55:29,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:29,447 INFO L93 Difference]: Finished difference Result 303 states and 337 transitions. [2021-10-21 19:55:29,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-21 19:55:29,447 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 153 [2021-10-21 19:55:29,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:29,448 INFO L225 Difference]: With dead ends: 303 [2021-10-21 19:55:29,448 INFO L226 Difference]: Without dead ends: 265 [2021-10-21 19:55:29,448 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 468.7ms TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2021-10-21 19:55:29,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-10-21 19:55:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2021-10-21 19:55:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 205 states have (on average 1.1219512195121952) internal successors, (230), 207 states have internal predecessors, (230), 25 states have call successors, (25), 25 states have call predecessors, (25), 28 states have return successors, (28), 26 states have call predecessors, (28), 23 states have call successors, (28) [2021-10-21 19:55:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 283 transitions. [2021-10-21 19:55:29,451 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 283 transitions. Word has length 153 [2021-10-21 19:55:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:29,451 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 283 transitions. [2021-10-21 19:55:29,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-21 19:55:29,451 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 283 transitions. [2021-10-21 19:55:29,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-21 19:55:29,452 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:29,452 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:29,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-10-21 19:55:29,453 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:29,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:29,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1217289252, now seen corresponding path program 1 times [2021-10-21 19:55:29,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:29,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930480749] [2021-10-21 19:55:29,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:29,454 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:55:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:55:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:55:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-10-21 19:55:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-10-21 19:55:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-10-21 19:55:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-21 19:55:29,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:29,843 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930480749] [2021-10-21 19:55:29,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930480749] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:29,843 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:29,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-21 19:55:29,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777908478] [2021-10-21 19:55:29,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-21 19:55:29,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:29,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:55:29,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:55:29,846 INFO L87 Difference]: Start difference. First operand 259 states and 283 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-10-21 19:55:30,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:30,400 INFO L93 Difference]: Finished difference Result 256 states and 277 transitions. [2021-10-21 19:55:30,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:55:30,401 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 158 [2021-10-21 19:55:30,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:30,402 INFO L225 Difference]: With dead ends: 256 [2021-10-21 19:55:30,402 INFO L226 Difference]: Without dead ends: 245 [2021-10-21 19:55:30,403 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 406.6ms TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2021-10-21 19:55:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-21 19:55:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231. [2021-10-21 19:55:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 183 states have internal predecessors, (200), 24 states have call successors, (24), 24 states have call predecessors, (24), 25 states have return successors, (25), 23 states have call predecessors, (25), 22 states have call successors, (25) [2021-10-21 19:55:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2021-10-21 19:55:30,408 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 158 [2021-10-21 19:55:30,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:30,408 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2021-10-21 19:55:30,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-10-21 19:55:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2021-10-21 19:55:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-21 19:55:30,410 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:30,410 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:55:30,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-10-21 19:55:30,411 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1524054683, now seen corresponding path program 1 times [2021-10-21 19:55:30,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:30,412 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660647181] [2021-10-21 19:55:30,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:30,412 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:55:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:55:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:55:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-10-21 19:55:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-10-21 19:55:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-21 19:55:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:30,844 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-21 19:55:30,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:30,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660647181] [2021-10-21 19:55:30,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660647181] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:30,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:30,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-10-21 19:55:30,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829445578] [2021-10-21 19:55:30,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-21 19:55:30,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:30,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-21 19:55:30,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-10-21 19:55:30,847 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-21 19:55:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:31,411 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2021-10-21 19:55:31,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:55:31,411 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2021-10-21 19:55:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:31,412 INFO L225 Difference]: With dead ends: 220 [2021-10-21 19:55:31,412 INFO L226 Difference]: Without dead ends: 210 [2021-10-21 19:55:31,413 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 316.1ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-10-21 19:55:31,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-21 19:55:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-10-21 19:55:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0920245398773005) internal successors, (178), 164 states have internal predecessors, (178), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2021-10-21 19:55:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 224 transitions. [2021-10-21 19:55:31,417 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 224 transitions. Word has length 160 [2021-10-21 19:55:31,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:31,417 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 224 transitions. [2021-10-21 19:55:31,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-21 19:55:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 224 transitions. [2021-10-21 19:55:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-10-21 19:55:31,419 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:31,419 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-21 19:55:31,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-10-21 19:55:31,420 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1861413762, now seen corresponding path program 1 times [2021-10-21 19:55:31,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:31,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298388716] [2021-10-21 19:55:31,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:31,421 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:55:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:55:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:55:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-10-21 19:55:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:31,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-10-21 19:55:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:32,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-10-21 19:55:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-21 19:55:32,007 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:32,007 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298388716] [2021-10-21 19:55:32,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298388716] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:32,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:32,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-21 19:55:32,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185676859] [2021-10-21 19:55:32,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-21 19:55:32,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:32,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-21 19:55:32,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-10-21 19:55:32,010 INFO L87 Difference]: Start difference. First operand 210 states and 224 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-21 19:55:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:33,334 INFO L93 Difference]: Finished difference Result 355 states and 377 transitions. [2021-10-21 19:55:33,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-10-21 19:55:33,334 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2021-10-21 19:55:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:33,335 INFO L225 Difference]: With dead ends: 355 [2021-10-21 19:55:33,335 INFO L226 Difference]: Without dead ends: 213 [2021-10-21 19:55:33,335 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 910.8ms TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2021-10-21 19:55:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-21 19:55:33,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2021-10-21 19:55:33,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0858895705521472) internal successors, (177), 164 states have internal predecessors, (177), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2021-10-21 19:55:33,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2021-10-21 19:55:33,339 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 161 [2021-10-21 19:55:33,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:33,339 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2021-10-21 19:55:33,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-21 19:55:33,339 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2021-10-21 19:55:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-10-21 19:55:33,340 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:55:33,340 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-21 19:55:33,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-10-21 19:55:33,341 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-21 19:55:33,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:55:33,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1510386108, now seen corresponding path program 1 times [2021-10-21 19:55:33,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:55:33,341 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45502751] [2021-10-21 19:55:33,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:55:33,342 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:55:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-21 19:55:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-21 19:55:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-21 19:55:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-21 19:55:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-21 19:55:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-21 19:55:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-21 19:55:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:55:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:55:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-21 19:55:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:33,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-21 19:55:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:34,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-10-21 19:55:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:34,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-10-21 19:55:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-10-21 19:55:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:55:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-21 19:55:34,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:55:34,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45502751] [2021-10-21 19:55:34,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45502751] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:55:34,025 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:55:34,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-21 19:55:34,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943999733] [2021-10-21 19:55:34,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-21 19:55:34,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:55:34,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-21 19:55:34,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-10-21 19:55:34,027 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-21 19:55:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:55:35,311 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2021-10-21 19:55:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-21 19:55:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2021-10-21 19:55:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:55:35,312 INFO L225 Difference]: With dead ends: 210 [2021-10-21 19:55:35,312 INFO L226 Difference]: Without dead ends: 0 [2021-10-21 19:55:35,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 885.6ms TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2021-10-21 19:55:35,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-21 19:55:35,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-21 19:55:35,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:55:35,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-21 19:55:35,313 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2021-10-21 19:55:35,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:55:35,314 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 19:55:35,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-21 19:55:35,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-21 19:55:35,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-21 19:55:35,317 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-10-21 19:55:35,317 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-10-21 19:55:35,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-10-21 19:55:35,322 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:55:35,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:55:35 BoogieIcfgContainer [2021-10-21 19:55:35,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:55:35,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:55:35,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:55:35,331 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:55:35,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:53:47" (3/4) ... [2021-10-21 19:55:35,335 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-21 19:55:35,344 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-10-21 19:55:35,345 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2021-10-21 19:55:35,345 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2021-10-21 19:55:35,345 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2021-10-21 19:55:35,345 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2021-10-21 19:55:35,345 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2021-10-21 19:55:35,345 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-10-21 19:55:35,345 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2021-10-21 19:55:35,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-10-21 19:55:35,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2021-10-21 19:55:35,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-10-21 19:55:35,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-10-21 19:55:35,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2021-10-21 19:55:35,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2021-10-21 19:55:35,346 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2021-10-21 19:55:35,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2021-10-21 19:55:35,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2021-10-21 19:55:35,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2021-10-21 19:55:35,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-10-21 19:55:35,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2021-10-21 19:55:35,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-10-21 19:55:35,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2021-10-21 19:55:35,348 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2021-10-21 19:55:35,348 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-10-21 19:55:35,348 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2021-10-21 19:55:35,348 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2021-10-21 19:55:35,348 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2021-10-21 19:55:35,349 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2021-10-21 19:55:35,349 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2021-10-21 19:55:35,349 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2021-10-21 19:55:35,396 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 86 nodes and edges [2021-10-21 19:55:35,402 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-10-21 19:55:35,405 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-21 19:55:35,408 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-21 19:55:35,635 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:55:35,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:55:35,637 INFO L168 Benchmark]: Toolchain (without parser) took 110145.81 ms. Allocated memory was 86.0 MB in the beginning and 352.3 MB in the end (delta: 266.3 MB). Free memory was 65.0 MB in the beginning and 192.5 MB in the end (delta: -127.5 MB). Peak memory consumption was 137.7 MB. Max. memory is 16.1 GB. [2021-10-21 19:55:35,637 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 86.0 MB. Free memory is still 62.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:55:35,638 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.96 ms. Allocated memory is still 86.0 MB. Free memory was 65.0 MB in the beginning and 49.3 MB in the end (delta: 15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-21 19:55:35,638 INFO L168 Benchmark]: Boogie Preprocessor took 120.28 ms. Allocated memory is still 86.0 MB. Free memory was 49.3 MB in the beginning and 45.0 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:55:35,639 INFO L168 Benchmark]: RCFGBuilder took 1292.19 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 45.0 MB in the beginning and 40.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:55:35,640 INFO L168 Benchmark]: TraceAbstraction took 107734.09 ms. Allocated memory was 104.9 MB in the beginning and 352.3 MB in the end (delta: 247.5 MB). Free memory was 76.7 MB in the beginning and 218.2 MB in the end (delta: -141.5 MB). Peak memory consumption was 105.6 MB. Max. memory is 16.1 GB. [2021-10-21 19:55:35,640 INFO L168 Benchmark]: Witness Printer took 304.75 ms. Allocated memory is still 352.3 MB. Free memory was 218.2 MB in the beginning and 192.5 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-21 19:55:35,642 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.28 ms. Allocated memory is still 86.0 MB. Free memory is still 62.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 663.96 ms. Allocated memory is still 86.0 MB. Free memory was 65.0 MB in the beginning and 49.3 MB in the end (delta: 15.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 120.28 ms. Allocated memory is still 86.0 MB. Free memory was 49.3 MB in the beginning and 45.0 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1292.19 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 45.0 MB in the beginning and 40.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 28.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 107734.09 ms. Allocated memory was 104.9 MB in the beginning and 352.3 MB in the end (delta: 247.5 MB). Free memory was 76.7 MB in the beginning and 218.2 MB in the end (delta: -141.5 MB). Peak memory consumption was 105.6 MB. Max. memory is 16.1 GB. * Witness Printer took 304.75 ms. Allocated memory is still 352.3 MB. Free memory was 218.2 MB in the beginning and 192.5 MB in the end (delta: 25.7 MB). Peak memory consumption was 25.2 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 - PositiveResult [Line: 667]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1627]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 31 procedures, 396 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 107659.5ms, OverallIterations: 67, TraceHistogramMax: 2, EmptinessCheckTime: 126.1ms, AutomataDifference: 85523.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 28.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 24799 SDtfs, 35964 SDslu, 53376 SDs, 0 SdLazy, 91602 SolverSat, 11213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 60907.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1881 GetRequests, 847 SyntacticMatches, 0 SemanticMatches, 1034 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3103 ImplicationChecksByTransitivity, 22177.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=932occurred in iteration=20, InterpolantAutomatonStates: 863, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1275.8ms AutomataMinimizationTime, 67 MinimizatonAttempts, 3040 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 326.7ms SsaConstructionTime, 1070.9ms SatisfiabilityAnalysisTime, 18619.8ms InterpolantComputationTime, 4766 NumberOfCodeBlocks, 4766 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 4699 ConstructedInterpolants, 0 QuantifiedInterpolants, 21826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 PerfectInterpolantSequences, 229/229 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-21 19:55:35,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_927c0402-9dc9-4ef0-82f6-6a78f446c4cb/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...