./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-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 4df6794b9b3a948996212d63f7c149439c613ff1 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 07:47:30,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:47:30,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:47:30,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:47:30,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:47:30,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:47:30,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:47:30,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:47:30,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:47:30,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:47:30,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:47:30,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:47:30,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:47:30,433 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:47:30,434 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:47:30,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:47:30,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:47:30,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:47:30,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:47:30,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:47:30,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:47:30,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:47:30,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:47:30,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:47:30,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:47:30,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:47:30,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:47:30,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:47:30,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:47:30,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:47:30,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:47:30,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:47:30,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:47:30,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:47:30,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:47:30,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:47:30,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:47:30,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:47:30,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:47:30,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:47:30,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:47:30,454 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 07:47:30,482 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:47:30,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:47:30,483 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:47:30,483 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:47:30,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:47:30,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:47:30,485 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:47:30,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:47:30,485 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:47:30,485 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:47:30,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:47:30,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:47:30,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:47:30,486 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:47:30,486 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:47:30,486 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:47:30,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:47:30,496 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:47:30,496 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:47:30,496 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:47:30,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:47:30,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:47:30,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:47:30,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:47:30,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:47:30,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:47:30,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:47:30,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:47:30,498 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:47:30,498 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> 4df6794b9b3a948996212d63f7c149439c613ff1 [2021-08-27 07:47:30,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:47:30,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:47:30,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:47:30,801 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:47:30,802 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:47:30,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-08-27 07:47:30,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4841f9a7f/fa4443a197214c67a4d4f4497b1b07ba/FLAGfcdffdd39 [2021-08-27 07:47:31,319 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:47:31,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-08-27 07:47:31,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4841f9a7f/fa4443a197214c67a4d4f4497b1b07ba/FLAGfcdffdd39 [2021-08-27 07:47:31,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4841f9a7f/fa4443a197214c67a4d4f4497b1b07ba [2021-08-27 07:47:31,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:47:31,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:47:31,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:47:31,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:47:31,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:47:31,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:47:31" (1/1) ... [2021-08-27 07:47:31,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6527b5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:31, skipping insertion in model container [2021-08-27 07:47:31,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:47:31" (1/1) ... [2021-08-27 07:47:31,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:47:31,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:47:32,039 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-08-27 07:47:32,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:47:32,178 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:47:32,190 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-08-27 07:47:32,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:47:32,252 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:47:32,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:32 WrapperNode [2021-08-27 07:47:32,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:47:32,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:47:32,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:47:32,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:47:32,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:32" (1/1) ... [2021-08-27 07:47:32,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:32" (1/1) ... [2021-08-27 07:47:32,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:32" (1/1) ... [2021-08-27 07:47:32,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:32" (1/1) ... [2021-08-27 07:47:32,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:32" (1/1) ... [2021-08-27 07:47:32,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:32" (1/1) ... [2021-08-27 07:47:32,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:32" (1/1) ... [2021-08-27 07:47:32,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:47:32,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:47:32,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:47:32,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:47:32,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:32" (1/1) ... [2021-08-27 07:47:32,377 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:47:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:47:32,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 07:47:32,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 07:47:32,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:47:32,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:47:32,440 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:47:32,440 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-08-27 07:47:32,440 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-08-27 07:47:32,441 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2021-08-27 07:47:32,441 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2021-08-27 07:47:32,441 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2021-08-27 07:47:32,441 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2021-08-27 07:47:32,442 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2021-08-27 07:47:32,442 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2021-08-27 07:47:32,442 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2021-08-27 07:47:32,442 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2021-08-27 07:47:32,443 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2021-08-27 07:47:32,443 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2021-08-27 07:47:32,443 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2021-08-27 07:47:32,443 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2021-08-27 07:47:32,443 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2021-08-27 07:47:32,443 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2021-08-27 07:47:32,443 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-08-27 07:47:32,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:47:32,444 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-08-27 07:47:32,444 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-08-27 07:47:32,444 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-08-27 07:47:32,444 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-08-27 07:47:32,444 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-08-27 07:47:32,444 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-08-27 07:47:32,445 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2021-08-27 07:47:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:47:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:47:32,461 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:47:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:47:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-08-27 07:47:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 07:47:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-08-27 07:47:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2021-08-27 07:47:32,462 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2021-08-27 07:47:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2021-08-27 07:47:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2021-08-27 07:47:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2021-08-27 07:47:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2021-08-27 07:47:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2021-08-27 07:47:32,463 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2021-08-27 07:47:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2021-08-27 07:47:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2021-08-27 07:47:32,464 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2021-08-27 07:47:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2021-08-27 07:47:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-08-27 07:47:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-08-27 07:47:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-08-27 07:47:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-08-27 07:47:32,465 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2021-08-27 07:47:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-08-27 07:47:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-08-27 07:47:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-08-27 07:47:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2021-08-27 07:47:32,466 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2021-08-27 07:47:32,467 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-08-27 07:47:32,467 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:47:32,467 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-08-27 07:47:32,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:47:32,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:47:32,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:47:32,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:47:32,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:47:32,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:47:32,836 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:32,978 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-08-27 07:47:32,979 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-08-27 07:47:32,985 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:33,016 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2021-08-27 07:47:33,017 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2021-08-27 07:47:33,031 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:33,058 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-08-27 07:47:33,059 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-08-27 07:47:33,065 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:33,077 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:47:33,077 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:47:33,335 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:33,377 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-08-27 07:47:33,378 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-08-27 07:47:33,422 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:33,437 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2021-08-27 07:47:33,438 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2021-08-27 07:47:33,471 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:47:33,472 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-27 07:47:33,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:47:33 BoogieIcfgContainer [2021-08-27 07:47:33,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:47:33,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:47:33,475 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:47:33,478 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:47:33,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:47:31" (1/3) ... [2021-08-27 07:47:33,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2c837a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:47:33, skipping insertion in model container [2021-08-27 07:47:33,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:32" (2/3) ... [2021-08-27 07:47:33,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2c837a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:47:33, skipping insertion in model container [2021-08-27 07:47:33,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:47:33" (3/3) ... [2021-08-27 07:47:33,480 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2021-08-27 07:47:33,484 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:47:33,485 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-27 07:47:33,518 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:47:33,523 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 07:47:33,523 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-27 07:47:33,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 206 states have (on average 1.4320388349514563) internal successors, (295), 225 states have internal predecessors, (295), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) [2021-08-27 07:47:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 07:47:33,547 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:33,547 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:33,548 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:33,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:33,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1560408711, now seen corresponding path program 1 times [2021-08-27 07:47:33,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:33,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135489851] [2021-08-27 07:47:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:33,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:33,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:33,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:33,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:33,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135489851] [2021-08-27 07:47:33,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135489851] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:33,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:33,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:47:33,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718496005] [2021-08-27 07:47:34,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:47:34,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:34,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:47:34,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:47:34,036 INFO L87 Difference]: Start difference. First operand has 296 states, 206 states have (on average 1.4320388349514563) internal successors, (295), 225 states have internal predecessors, (295), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) 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-08-27 07:47:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:34,818 INFO L93 Difference]: Finished difference Result 332 states and 459 transitions. [2021-08-27 07:47:34,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:47:34,820 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-08-27 07:47:34,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:34,830 INFO L225 Difference]: With dead ends: 332 [2021-08-27 07:47:34,830 INFO L226 Difference]: Without dead ends: 326 [2021-08-27 07:47:34,831 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 141.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:47:34,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-08-27 07:47:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2021-08-27 07:47:34,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 201 states have (on average 1.3781094527363185) internal successors, (277), 217 states have internal predecessors, (277), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-08-27 07:47:34,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 384 transitions. [2021-08-27 07:47:34,879 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 384 transitions. Word has length 15 [2021-08-27 07:47:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:34,881 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 384 transitions. [2021-08-27 07:47:34,881 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-08-27 07:47:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 384 transitions. [2021-08-27 07:47:34,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 07:47:34,883 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:34,883 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:34,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:47:34,884 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:34,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:34,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1302515818, now seen corresponding path program 1 times [2021-08-27 07:47:34,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:34,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333119464] [2021-08-27 07:47:34,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:34,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:35,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:35,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:35,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:35,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:35,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333119464] [2021-08-27 07:47:35,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333119464] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:35,080 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:35,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 07:47:35,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925763686] [2021-08-27 07:47:35,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 07:47:35,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:35,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 07:47:35,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:47:35,082 INFO L87 Difference]: Start difference. First operand 287 states and 384 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:47:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:36,013 INFO L93 Difference]: Finished difference Result 331 states and 451 transitions. [2021-08-27 07:47:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:36,014 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), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2021-08-27 07:47:36,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:36,016 INFO L225 Difference]: With dead ends: 331 [2021-08-27 07:47:36,017 INFO L226 Difference]: Without dead ends: 326 [2021-08-27 07:47:36,017 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 198.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-08-27 07:47:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2021-08-27 07:47:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 201 states have (on average 1.373134328358209) internal successors, (276), 217 states have internal predecessors, (276), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-08-27 07:47:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2021-08-27 07:47:36,034 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2021-08-27 07:47:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:36,035 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2021-08-27 07:47:36,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), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:47:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2021-08-27 07:47:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:47:36,036 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:36,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-08-27 07:47:36,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:47:36,036 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:36,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:36,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1551281276, now seen corresponding path program 1 times [2021-08-27 07:47:36,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:36,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890987603] [2021-08-27 07:47:36,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:36,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:36,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,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-08-27 07:47:36,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:36,226 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890987603] [2021-08-27 07:47:36,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890987603] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:36,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:36,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:36,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681045623] [2021-08-27 07:47:36,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:36,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:36,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:36,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:36,228 INFO L87 Difference]: Start difference. First operand 287 states and 383 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-08-27 07:47:37,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:37,811 INFO L93 Difference]: Finished difference Result 508 states and 702 transitions. [2021-08-27 07:47:37,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:37,812 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-08-27 07:47:37,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:37,820 INFO L225 Difference]: With dead ends: 508 [2021-08-27 07:47:37,820 INFO L226 Difference]: Without dead ends: 507 [2021-08-27 07:47:37,820 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 231.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-08-27 07:47:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2021-08-27 07:47:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 318 states have (on average 1.3459119496855345) internal successors, (428), 329 states have internal predecessors, (428), 80 states have call successors, (80), 37 states have call predecessors, (80), 41 states have return successors, (100), 77 states have call predecessors, (100), 68 states have call successors, (100) [2021-08-27 07:47:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 608 transitions. [2021-08-27 07:47:37,871 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 608 transitions. Word has length 25 [2021-08-27 07:47:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:37,871 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 608 transitions. [2021-08-27 07:47:37,872 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-08-27 07:47:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2021-08-27 07:47:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:47:37,875 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:37,875 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-08-27 07:47:37,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:47:37,876 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:37,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:37,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1085614475, now seen corresponding path program 1 times [2021-08-27 07:47:37,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:37,877 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116136416] [2021-08-27 07:47:37,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:37,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:38,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:38,120 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116136416] [2021-08-27 07:47:38,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116136416] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:38,123 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:38,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:38,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817677449] [2021-08-27 07:47:38,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:38,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:38,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:38,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:38,130 INFO L87 Difference]: Start difference. First operand 440 states and 608 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:39,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:39,628 INFO L93 Difference]: Finished difference Result 690 states and 979 transitions. [2021-08-27 07:47:39,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:39,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2021-08-27 07:47:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:39,632 INFO L225 Difference]: With dead ends: 690 [2021-08-27 07:47:39,632 INFO L226 Difference]: Without dead ends: 690 [2021-08-27 07:47:39,633 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 220.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:39,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-08-27 07:47:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 618. [2021-08-27 07:47:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.3560439560439561) internal successors, (617), 466 states have internal predecessors, (617), 109 states have call successors, (109), 49 states have call predecessors, (109), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2021-08-27 07:47:39,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 888 transitions. [2021-08-27 07:47:39,680 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 888 transitions. Word has length 31 [2021-08-27 07:47:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:39,680 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 888 transitions. [2021-08-27 07:47:39,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 888 transitions. [2021-08-27 07:47:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 07:47:39,686 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:39,686 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] [2021-08-27 07:47:39,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:47:39,687 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:39,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:39,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1025634350, now seen corresponding path program 1 times [2021-08-27 07:47:39,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:39,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186773872] [2021-08-27 07:47:39,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:39,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:39,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:39,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:39,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:39,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:39,891 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186773872] [2021-08-27 07:47:39,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186773872] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:39,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:39,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:39,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237895698] [2021-08-27 07:47:39,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:39,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:39,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:39,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:39,894 INFO L87 Difference]: Start difference. First operand 618 states and 888 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 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-08-27 07:47:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:40,707 INFO L93 Difference]: Finished difference Result 661 states and 947 transitions. [2021-08-27 07:47:40,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:40,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 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 36 [2021-08-27 07:47:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:40,711 INFO L225 Difference]: With dead ends: 661 [2021-08-27 07:47:40,711 INFO L226 Difference]: Without dead ends: 661 [2021-08-27 07:47:40,712 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 182.6ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:47:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-08-27 07:47:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2021-08-27 07:47:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 466 states have (on average 1.354077253218884) internal successors, (631), 475 states have internal predecessors, (631), 108 states have call successors, (108), 50 states have call predecessors, (108), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2021-08-27 07:47:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 901 transitions. [2021-08-27 07:47:40,737 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 901 transitions. Word has length 36 [2021-08-27 07:47:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:40,737 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 901 transitions. [2021-08-27 07:47:40,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 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-08-27 07:47:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 901 transitions. [2021-08-27 07:47:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 07:47:40,740 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:40,740 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-08-27 07:47:40,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:47:40,741 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:40,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1273733766, now seen corresponding path program 1 times [2021-08-27 07:47:40,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:40,742 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577200461] [2021-08-27 07:47:40,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:40,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:40,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:40,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:40,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:47:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:41,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:47:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:41,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-08-27 07:47:41,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:41,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577200461] [2021-08-27 07:47:41,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577200461] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:41,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:41,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:47:41,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99103143] [2021-08-27 07:47:41,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:47:41,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:41,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:47:41,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:47:41,054 INFO L87 Difference]: Start difference. First operand 628 states and 901 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-08-27 07:47:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:42,412 INFO L93 Difference]: Finished difference Result 705 states and 1000 transitions. [2021-08-27 07:47:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:47:42,413 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-08-27 07:47:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:42,418 INFO L225 Difference]: With dead ends: 705 [2021-08-27 07:47:42,418 INFO L226 Difference]: Without dead ends: 705 [2021-08-27 07:47:42,418 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 549.0ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:47:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-08-27 07:47:42,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2021-08-27 07:47:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.348360655737705) internal successors, (658), 502 states have internal predecessors, (658), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2021-08-27 07:47:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 936 transitions. [2021-08-27 07:47:42,441 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 936 transitions. Word has length 39 [2021-08-27 07:47:42,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:42,441 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 936 transitions. [2021-08-27 07:47:42,442 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-08-27 07:47:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 936 transitions. [2021-08-27 07:47:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 07:47:42,443 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:42,443 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-08-27 07:47:42,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 07:47:42,444 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:42,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:42,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1267590478, now seen corresponding path program 1 times [2021-08-27 07:47:42,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:42,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027575890] [2021-08-27 07:47:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:42,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:42,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:42,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:42,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:42,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:47:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:42,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:47:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:42,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:42,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027575890] [2021-08-27 07:47:42,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027575890] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:42,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:42,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:47:42,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456543602] [2021-08-27 07:47:42,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:47:42,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:42,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:47:42,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:47:42,745 INFO L87 Difference]: Start difference. First operand 658 states and 936 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-08-27 07:47:44,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:44,713 INFO L93 Difference]: Finished difference Result 705 states and 999 transitions. [2021-08-27 07:47:44,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:47:44,713 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-08-27 07:47:44,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:44,717 INFO L225 Difference]: With dead ends: 705 [2021-08-27 07:47:44,717 INFO L226 Difference]: Without dead ends: 705 [2021-08-27 07:47:44,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 544.3ms TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:47:44,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-08-27 07:47:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2021-08-27 07:47:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.346311475409836) internal successors, (657), 502 states have internal predecessors, (657), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2021-08-27 07:47:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 935 transitions. [2021-08-27 07:47:44,735 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 935 transitions. Word has length 40 [2021-08-27 07:47:44,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:44,736 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 935 transitions. [2021-08-27 07:47:44,736 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-08-27 07:47:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 935 transitions. [2021-08-27 07:47:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 07:47:44,737 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:44,737 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-08-27 07:47:44,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 07:47:44,737 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:44,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:44,738 INFO L82 PathProgramCache]: Analyzing trace with hash -908144207, now seen corresponding path program 1 times [2021-08-27 07:47:44,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:44,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509576965] [2021-08-27 07:47:44,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:44,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:44,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:44,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:44,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:47:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:44,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:47:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:44,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:44,951 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509576965] [2021-08-27 07:47:44,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509576965] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:44,952 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:44,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:47:44,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012058977] [2021-08-27 07:47:44,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:47:44,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:44,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:47:44,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:44,953 INFO L87 Difference]: Start difference. First operand 658 states and 935 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:46,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:46,088 INFO L93 Difference]: Finished difference Result 1186 states and 1741 transitions. [2021-08-27 07:47:46,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:47:46,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2021-08-27 07:47:46,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:46,094 INFO L225 Difference]: With dead ends: 1186 [2021-08-27 07:47:46,094 INFO L226 Difference]: Without dead ends: 1186 [2021-08-27 07:47:46,095 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 229.5ms TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:47:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2021-08-27 07:47:46,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1085. [2021-08-27 07:47:46,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 817 states have (on average 1.3635250917992656) internal successors, (1114), 835 states have internal predecessors, (1114), 173 states have call successors, (173), 79 states have call predecessors, (173), 94 states have return successors, (315), 175 states have call predecessors, (315), 163 states have call successors, (315) [2021-08-27 07:47:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1602 transitions. [2021-08-27 07:47:46,130 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1602 transitions. Word has length 41 [2021-08-27 07:47:46,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:46,130 INFO L470 AbstractCegarLoop]: Abstraction has 1085 states and 1602 transitions. [2021-08-27 07:47:46,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1602 transitions. [2021-08-27 07:47:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-27 07:47:46,131 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:46,131 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-08-27 07:47:46,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:47:46,132 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1920333946, now seen corresponding path program 1 times [2021-08-27 07:47:46,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:46,133 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156189303] [2021-08-27 07:47:46,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:46,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:46,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:46,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:46,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:46,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:46,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:47:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:46,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:47:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:46,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:46,373 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156189303] [2021-08-27 07:47:46,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156189303] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:46,373 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:46,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:47:46,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387541934] [2021-08-27 07:47:46,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:47:46,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:46,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:47:46,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:47:46,376 INFO L87 Difference]: Start difference. First operand 1085 states and 1602 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-08-27 07:47:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:47,468 INFO L93 Difference]: Finished difference Result 1167 states and 1721 transitions. [2021-08-27 07:47:47,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:47:47,469 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-08-27 07:47:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:47,475 INFO L225 Difference]: With dead ends: 1167 [2021-08-27 07:47:47,475 INFO L226 Difference]: Without dead ends: 1148 [2021-08-27 07:47:47,476 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 137.1ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:47:47,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2021-08-27 07:47:47,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1078. [2021-08-27 07:47:47,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 813 states have (on average 1.3640836408364083) internal successors, (1109), 831 states have internal predecessors, (1109), 171 states have call successors, (171), 78 states have call predecessors, (171), 93 states have return successors, (313), 173 states have call predecessors, (313), 161 states have call successors, (313) [2021-08-27 07:47:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1593 transitions. [2021-08-27 07:47:47,513 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1593 transitions. Word has length 42 [2021-08-27 07:47:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:47,513 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1593 transitions. [2021-08-27 07:47:47,513 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-08-27 07:47:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1593 transitions. [2021-08-27 07:47:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 07:47:47,514 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:47,514 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-08-27 07:47:47,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 07:47:47,515 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:47,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:47,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1961075502, now seen corresponding path program 1 times [2021-08-27 07:47:47,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:47,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506068514] [2021-08-27 07:47:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:47,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:47,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:47,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:47,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:47,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-08-27 07:47:47,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:47,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506068514] [2021-08-27 07:47:47,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506068514] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:47,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:47,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:47,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415502237] [2021-08-27 07:47:47,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:47,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:47,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:47,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:47,701 INFO L87 Difference]: Start difference. First operand 1078 states and 1593 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:48,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:48,470 INFO L93 Difference]: Finished difference Result 599 states and 851 transitions. [2021-08-27 07:47:48,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:48,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2021-08-27 07:47:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:48,474 INFO L225 Difference]: With dead ends: 599 [2021-08-27 07:47:48,475 INFO L226 Difference]: Without dead ends: 599 [2021-08-27 07:47:48,475 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 230.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-08-27 07:47:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2021-08-27 07:47:48,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 443 states have (on average 1.327313769751693) internal successors, (588), 455 states have internal predecessors, (588), 102 states have call successors, (102), 47 states have call predecessors, (102), 52 states have return successors, (160), 98 states have call predecessors, (160), 94 states have call successors, (160) [2021-08-27 07:47:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 850 transitions. [2021-08-27 07:47:48,490 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 850 transitions. Word has length 45 [2021-08-27 07:47:48,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:48,490 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 850 transitions. [2021-08-27 07:47:48,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 850 transitions. [2021-08-27 07:47:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 07:47:48,491 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:48,491 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-08-27 07:47:48,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 07:47:48,492 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:48,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:48,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1047559429, now seen corresponding path program 1 times [2021-08-27 07:47:48,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:48,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510699640] [2021-08-27 07:47:48,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:48,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:48,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:48,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:48,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:48,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:47:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:48,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:47:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:48,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:48,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:48,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510699640] [2021-08-27 07:47:48,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510699640] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:48,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:48,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:47:48,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326982404] [2021-08-27 07:47:48,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:47:48,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:48,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:47:48,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:47:48,736 INFO L87 Difference]: Start difference. First operand 598 states and 850 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 4 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-08-27 07:47:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:49,382 INFO L93 Difference]: Finished difference Result 625 states and 884 transitions. [2021-08-27 07:47:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:47:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 4 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-08-27 07:47:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:49,385 INFO L225 Difference]: With dead ends: 625 [2021-08-27 07:47:49,386 INFO L226 Difference]: Without dead ends: 608 [2021-08-27 07:47:49,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 140.2ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:47:49,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-08-27 07:47:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2021-08-27 07:47:49,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.3257918552036199) internal successors, (586), 454 states have internal predecessors, (586), 101 states have call successors, (101), 47 states have call predecessors, (101), 52 states have return successors, (159), 97 states have call predecessors, (159), 93 states have call successors, (159) [2021-08-27 07:47:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 846 transitions. [2021-08-27 07:47:49,403 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 846 transitions. Word has length 46 [2021-08-27 07:47:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:49,403 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 846 transitions. [2021-08-27 07:47:49,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 4 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-08-27 07:47:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 846 transitions. [2021-08-27 07:47:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 07:47:49,404 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:49,404 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-08-27 07:47:49,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:47:49,405 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:49,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1630521075, now seen corresponding path program 1 times [2021-08-27 07:47:49,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:49,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619182756] [2021-08-27 07:47:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:49,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:49,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:49,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:49,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:47:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:49,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:47:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:49,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:49,665 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619182756] [2021-08-27 07:47:49,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619182756] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:49,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:49,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:47:49,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782166912] [2021-08-27 07:47:49,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:47:49,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:49,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:47:49,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:47:49,667 INFO L87 Difference]: Start difference. First operand 596 states and 846 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 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-08-27 07:47:50,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:50,597 INFO L93 Difference]: Finished difference Result 626 states and 884 transitions. [2021-08-27 07:47:50,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:47:50,598 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 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 46 [2021-08-27 07:47:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:50,600 INFO L225 Difference]: With dead ends: 626 [2021-08-27 07:47:50,601 INFO L226 Difference]: Without dead ends: 608 [2021-08-27 07:47:50,601 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 274.5ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:47:50,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-08-27 07:47:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2021-08-27 07:47:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.3235294117647058) internal successors, (585), 454 states have internal predecessors, (585), 101 states have call successors, (101), 47 states have call predecessors, (101), 52 states have return successors, (159), 97 states have call predecessors, (159), 93 states have call successors, (159) [2021-08-27 07:47:50,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 845 transitions. [2021-08-27 07:47:50,616 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 845 transitions. Word has length 46 [2021-08-27 07:47:50,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:50,616 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 845 transitions. [2021-08-27 07:47:50,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 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-08-27 07:47:50,617 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 845 transitions. [2021-08-27 07:47:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 07:47:50,618 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:50,618 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-08-27 07:47:50,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:47:50,618 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1014081090, now seen corresponding path program 1 times [2021-08-27 07:47:50,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:50,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491852905] [2021-08-27 07:47:50,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:50,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:50,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:50,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:50,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:50,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:47:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:50,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:47:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:50,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:50,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491852905] [2021-08-27 07:47:50,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491852905] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:50,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:50,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:47:50,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316702751] [2021-08-27 07:47:50,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:47:50,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:50,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:47:50,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:50,862 INFO L87 Difference]: Start difference. First operand 596 states and 845 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-08-27 07:47:52,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:52,331 INFO L93 Difference]: Finished difference Result 826 states and 1225 transitions. [2021-08-27 07:47:52,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:47:52,332 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-08-27 07:47:52,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:52,336 INFO L225 Difference]: With dead ends: 826 [2021-08-27 07:47:52,336 INFO L226 Difference]: Without dead ends: 826 [2021-08-27 07:47:52,336 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 232.7ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:47:52,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2021-08-27 07:47:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 665. [2021-08-27 07:47:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 495 states have (on average 1.3232323232323233) internal successors, (655), 508 states have internal predecessors, (655), 109 states have call successors, (109), 50 states have call predecessors, (109), 60 states have return successors, (184), 110 states have call predecessors, (184), 101 states have call successors, (184) [2021-08-27 07:47:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 948 transitions. [2021-08-27 07:47:52,361 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 948 transitions. Word has length 46 [2021-08-27 07:47:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:52,361 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 948 transitions. [2021-08-27 07:47:52,361 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-08-27 07:47:52,362 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 948 transitions. [2021-08-27 07:47:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-27 07:47:52,362 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:52,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] [2021-08-27 07:47:52,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 07:47:52,363 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:52,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:52,363 INFO L82 PathProgramCache]: Analyzing trace with hash -74200962, now seen corresponding path program 1 times [2021-08-27 07:47:52,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:52,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778113169] [2021-08-27 07:47:52,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:52,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:52,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:52,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:52,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:52,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-08-27 07:47:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:52,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:52,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778113169] [2021-08-27 07:47:52,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778113169] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:52,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:52,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:47:52,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918861049] [2021-08-27 07:47:52,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:47:52,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:52,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:47:52,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:52,556 INFO L87 Difference]: Start difference. First operand 665 states and 948 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:47:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:53,680 INFO L93 Difference]: Finished difference Result 462 states and 599 transitions. [2021-08-27 07:47:53,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:47:53,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2021-08-27 07:47:53,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:53,682 INFO L225 Difference]: With dead ends: 462 [2021-08-27 07:47:53,682 INFO L226 Difference]: Without dead ends: 462 [2021-08-27 07:47:53,682 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 335.4ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:47:53,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-08-27 07:47:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 441. [2021-08-27 07:47:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 327 states have (on average 1.27217125382263) internal successors, (416), 338 states have internal predecessors, (416), 69 states have call successors, (69), 38 states have call predecessors, (69), 44 states have return successors, (93), 68 states have call predecessors, (93), 61 states have call successors, (93) [2021-08-27 07:47:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 578 transitions. [2021-08-27 07:47:53,692 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 578 transitions. Word has length 49 [2021-08-27 07:47:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:53,692 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 578 transitions. [2021-08-27 07:47:53,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:47:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 578 transitions. [2021-08-27 07:47:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 07:47:53,693 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:53,693 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-08-27 07:47:53,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 07:47:53,693 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:53,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:53,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1824745018, now seen corresponding path program 1 times [2021-08-27 07:47:53,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:53,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65624266] [2021-08-27 07:47:53,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:53,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:47:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:47:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:53,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:53,948 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65624266] [2021-08-27 07:47:53,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65624266] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:53,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:53,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:47:53,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435475187] [2021-08-27 07:47:53,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:47:53,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:53,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:47:53,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:47:53,951 INFO L87 Difference]: Start difference. First operand 441 states and 578 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 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-08-27 07:47:54,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:54,831 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2021-08-27 07:47:54,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:47:54,831 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 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 47 [2021-08-27 07:47:54,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:54,833 INFO L225 Difference]: With dead ends: 454 [2021-08-27 07:47:54,833 INFO L226 Difference]: Without dead ends: 453 [2021-08-27 07:47:54,834 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 185.9ms TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:47:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-08-27 07:47:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2021-08-27 07:47:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 334 states have (on average 1.2724550898203593) internal successors, (425), 346 states have internal predecessors, (425), 70 states have call successors, (70), 38 states have call predecessors, (70), 44 states have return successors, (94), 69 states have call predecessors, (94), 62 states have call successors, (94) [2021-08-27 07:47:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2021-08-27 07:47:54,843 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2021-08-27 07:47:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:54,843 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2021-08-27 07:47:54,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 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-08-27 07:47:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2021-08-27 07:47:54,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 07:47:54,844 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:54,844 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-08-27 07:47:54,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 07:47:54,845 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:54,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1824468188, now seen corresponding path program 1 times [2021-08-27 07:47:54,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:54,845 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693460780] [2021-08-27 07:47:54,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:54,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:54,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:54,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:55,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:55,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:47:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:47:55,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:55,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:55,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693460780] [2021-08-27 07:47:55,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693460780] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:55,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:55,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:47:55,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975860524] [2021-08-27 07:47:55,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:47:55,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:55,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:47:55,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:47:55,117 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 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-08-27 07:47:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:55,811 INFO L93 Difference]: Finished difference Result 487 states and 652 transitions. [2021-08-27 07:47:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:47:55,811 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 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 47 [2021-08-27 07:47:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:55,813 INFO L225 Difference]: With dead ends: 487 [2021-08-27 07:47:55,813 INFO L226 Difference]: Without dead ends: 472 [2021-08-27 07:47:55,813 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 288.1ms TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:47:55,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-08-27 07:47:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 459. [2021-08-27 07:47:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 343 states have (on average 1.2769679300291545) internal successors, (438), 356 states have internal predecessors, (438), 70 states have call successors, (70), 38 states have call predecessors, (70), 45 states have return successors, (96), 69 states have call predecessors, (96), 62 states have call successors, (96) [2021-08-27 07:47:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2021-08-27 07:47:55,823 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 47 [2021-08-27 07:47:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:55,824 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2021-08-27 07:47:55,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 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-08-27 07:47:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2021-08-27 07:47:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 07:47:55,825 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:55,825 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-08-27 07:47:55,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 07:47:55,825 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:55,826 INFO L82 PathProgramCache]: Analyzing trace with hash 463036434, now seen corresponding path program 1 times [2021-08-27 07:47:55,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:55,826 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863454578] [2021-08-27 07:47:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:55,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:55,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:56,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:47:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:56,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:47:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:56,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:56,072 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863454578] [2021-08-27 07:47:56,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863454578] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:56,072 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:56,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:47:56,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921470465] [2021-08-27 07:47:56,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:47:56,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:56,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:47:56,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:47:56,074 INFO L87 Difference]: Start difference. First operand 459 states and 604 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 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-08-27 07:47:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:57,925 INFO L93 Difference]: Finished difference Result 590 states and 807 transitions. [2021-08-27 07:47:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:47:57,925 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 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 48 [2021-08-27 07:47:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:57,927 INFO L225 Difference]: With dead ends: 590 [2021-08-27 07:47:57,927 INFO L226 Difference]: Without dead ends: 575 [2021-08-27 07:47:57,928 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 635.2ms TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:47:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-08-27 07:47:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 444. [2021-08-27 07:47:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 332 states have (on average 1.2771084337349397) internal successors, (424), 343 states have internal predecessors, (424), 68 states have call successors, (68), 38 states have call predecessors, (68), 43 states have return successors, (91), 66 states have call predecessors, (91), 60 states have call successors, (91) [2021-08-27 07:47:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 583 transitions. [2021-08-27 07:47:57,938 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 583 transitions. Word has length 48 [2021-08-27 07:47:57,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:57,939 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 583 transitions. [2021-08-27 07:47:57,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 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-08-27 07:47:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 583 transitions. [2021-08-27 07:47:57,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-08-27 07:47:57,940 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:57,940 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] [2021-08-27 07:47:57,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 07:47:57,940 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:57,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:57,941 INFO L82 PathProgramCache]: Analyzing trace with hash -97212758, now seen corresponding path program 1 times [2021-08-27 07:47:57,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:57,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141203356] [2021-08-27 07:47:57,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:57,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:58,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:58,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 07:47:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:58,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:47:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:58,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:58,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141203356] [2021-08-27 07:47:58,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141203356] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:58,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:58,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:47:58,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668630771] [2021-08-27 07:47:58,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:47:58,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:58,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:47:58,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:47:58,169 INFO L87 Difference]: Start difference. First operand 444 states and 583 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:59,038 INFO L93 Difference]: Finished difference Result 455 states and 596 transitions. [2021-08-27 07:47:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:47:59,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 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 49 [2021-08-27 07:47:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:59,040 INFO L225 Difference]: With dead ends: 455 [2021-08-27 07:47:59,040 INFO L226 Difference]: Without dead ends: 427 [2021-08-27 07:47:59,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 169.9ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:47:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-08-27 07:47:59,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2021-08-27 07:47:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 318 states have (on average 1.279874213836478) internal successors, (407), 330 states have internal predecessors, (407), 66 states have call successors, (66), 36 states have call predecessors, (66), 42 states have return successors, (89), 64 states have call predecessors, (89), 58 states have call successors, (89) [2021-08-27 07:47:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 562 transitions. [2021-08-27 07:47:59,049 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 562 transitions. Word has length 49 [2021-08-27 07:47:59,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:59,049 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 562 transitions. [2021-08-27 07:47:59,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 562 transitions. [2021-08-27 07:47:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:47:59,050 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:59,051 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-08-27 07:47:59,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:47:59,051 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:59,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:59,051 INFO L82 PathProgramCache]: Analyzing trace with hash 193438818, now seen corresponding path program 1 times [2021-08-27 07:47:59,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:59,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302787919] [2021-08-27 07:47:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:59,052 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:47:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:47:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:59,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:59,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302787919] [2021-08-27 07:47:59,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302787919] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:59,281 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:59,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:47:59,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227191673] [2021-08-27 07:47:59,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:47:59,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:59,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:47:59,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:47:59,283 INFO L87 Difference]: Start difference. First operand 427 states and 562 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-08-27 07:48:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:00,073 INFO L93 Difference]: Finished difference Result 453 states and 597 transitions. [2021-08-27 07:48:00,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:48:00,073 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-08-27 07:48:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:00,075 INFO L225 Difference]: With dead ends: 453 [2021-08-27 07:48:00,075 INFO L226 Difference]: Without dead ends: 423 [2021-08-27 07:48:00,076 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 266.7ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:48:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-08-27 07:48:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 409. [2021-08-27 07:48:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 316 states have internal predecessors, (391), 64 states have call successors, (64), 34 states have call predecessors, (64), 40 states have return successors, (87), 62 states have call predecessors, (87), 56 states have call successors, (87) [2021-08-27 07:48:00,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 542 transitions. [2021-08-27 07:48:00,084 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 542 transitions. Word has length 50 [2021-08-27 07:48:00,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:00,084 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 542 transitions. [2021-08-27 07:48:00,084 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-08-27 07:48:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 542 transitions. [2021-08-27 07:48:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:48:00,085 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:00,085 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-08-27 07:48:00,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 07:48:00,085 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:00,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1006860761, now seen corresponding path program 1 times [2021-08-27 07:48:00,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:00,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833581646] [2021-08-27 07:48:00,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:00,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:00,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:00,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:00,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:48:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:00,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:00,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:00,318 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833581646] [2021-08-27 07:48:00,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833581646] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:00,318 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:00,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:48:00,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769199504] [2021-08-27 07:48:00,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:48:00,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:00,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:48:00,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:48:00,320 INFO L87 Difference]: Start difference. First operand 409 states and 542 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:48:02,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:02,439 INFO L93 Difference]: Finished difference Result 600 states and 867 transitions. [2021-08-27 07:48:02,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:48:02,439 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 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-08-27 07:48:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:02,441 INFO L225 Difference]: With dead ends: 600 [2021-08-27 07:48:02,441 INFO L226 Difference]: Without dead ends: 600 [2021-08-27 07:48:02,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 604.3ms TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:48:02,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-08-27 07:48:02,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2021-08-27 07:48:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 399 states have (on average 1.3433583959899749) internal successors, (536), 410 states have internal predecessors, (536), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2021-08-27 07:48:02,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 769 transitions. [2021-08-27 07:48:02,454 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 769 transitions. Word has length 50 [2021-08-27 07:48:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:02,454 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 769 transitions. [2021-08-27 07:48:02,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:48:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 769 transitions. [2021-08-27 07:48:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:48:02,455 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:02,455 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-08-27 07:48:02,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 07:48:02,455 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:02,456 INFO L82 PathProgramCache]: Analyzing trace with hash 645881872, now seen corresponding path program 1 times [2021-08-27 07:48:02,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:02,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583793794] [2021-08-27 07:48:02,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:02,456 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:02,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:02,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:02,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:48:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:02,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:02,625 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:02,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583793794] [2021-08-27 07:48:02,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583793794] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:02,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:02,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:48:02,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336010890] [2021-08-27 07:48:02,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:48:02,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:02,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:48:02,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:48:02,628 INFO L87 Difference]: Start difference. First operand 534 states and 769 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:03,404 INFO L93 Difference]: Finished difference Result 740 states and 1128 transitions. [2021-08-27 07:48:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:48:03,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 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 51 [2021-08-27 07:48:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:03,407 INFO L225 Difference]: With dead ends: 740 [2021-08-27 07:48:03,408 INFO L226 Difference]: Without dead ends: 740 [2021-08-27 07:48:03,408 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 206.2ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:48:03,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-08-27 07:48:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 561. [2021-08-27 07:48:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 419 states have (on average 1.3293556085918854) internal successors, (557), 431 states have internal predecessors, (557), 93 states have call successors, (93), 38 states have call predecessors, (93), 48 states have return successors, (147), 94 states have call predecessors, (147), 85 states have call successors, (147) [2021-08-27 07:48:03,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 797 transitions. [2021-08-27 07:48:03,424 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 797 transitions. Word has length 51 [2021-08-27 07:48:03,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:03,425 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 797 transitions. [2021-08-27 07:48:03,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 797 transitions. [2021-08-27 07:48:03,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:48:03,426 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:03,426 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-08-27 07:48:03,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 07:48:03,427 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:03,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1801633520, now seen corresponding path program 1 times [2021-08-27 07:48:03,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:03,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885594770] [2021-08-27 07:48:03,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:03,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:48:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:03,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:03,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885594770] [2021-08-27 07:48:03,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885594770] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:03,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:03,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:48:03,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020163558] [2021-08-27 07:48:03,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:48:03,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:03,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:48:03,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:48:03,611 INFO L87 Difference]: Start difference. First operand 561 states and 797 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:04,111 INFO L93 Difference]: Finished difference Result 579 states and 821 transitions. [2021-08-27 07:48:04,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:48:04,113 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), 2 states have call successors, (7), 6 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 51 [2021-08-27 07:48:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:04,114 INFO L225 Difference]: With dead ends: 579 [2021-08-27 07:48:04,114 INFO L226 Difference]: Without dead ends: 579 [2021-08-27 07:48:04,115 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 265.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:48:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-08-27 07:48:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 564. [2021-08-27 07:48:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 422 states have (on average 1.3293838862559242) internal successors, (561), 434 states have internal predecessors, (561), 93 states have call successors, (93), 38 states have call predecessors, (93), 48 states have return successors, (147), 94 states have call predecessors, (147), 85 states have call successors, (147) [2021-08-27 07:48:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 801 transitions. [2021-08-27 07:48:04,126 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 801 transitions. Word has length 51 [2021-08-27 07:48:04,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:04,126 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 801 transitions. [2021-08-27 07:48:04,127 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), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:04,127 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 801 transitions. [2021-08-27 07:48:04,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:48:04,127 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:04,127 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-08-27 07:48:04,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 07:48:04,128 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:04,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:04,128 INFO L82 PathProgramCache]: Analyzing trace with hash 499189070, now seen corresponding path program 1 times [2021-08-27 07:48:04,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:04,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028730330] [2021-08-27 07:48:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:04,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:04,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:04,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:04,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:04,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:48:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:04,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:04,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-08-27 07:48:04,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:04,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028730330] [2021-08-27 07:48:04,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028730330] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:04,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:04,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:48:04,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546764025] [2021-08-27 07:48:04,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:48:04,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:04,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:48:04,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:48:04,340 INFO L87 Difference]: Start difference. First operand 564 states and 801 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:48:05,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:05,485 INFO L93 Difference]: Finished difference Result 619 states and 929 transitions. [2021-08-27 07:48:05,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:05,486 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (7), 6 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 51 [2021-08-27 07:48:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:05,488 INFO L225 Difference]: With dead ends: 619 [2021-08-27 07:48:05,488 INFO L226 Difference]: Without dead ends: 619 [2021-08-27 07:48:05,488 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 481.2ms TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:48:05,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-08-27 07:48:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 524. [2021-08-27 07:48:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 390 states have (on average 1.3307692307692307) internal successors, (519), 400 states have internal predecessors, (519), 91 states have call successors, (91), 37 states have call predecessors, (91), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2021-08-27 07:48:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 751 transitions. [2021-08-27 07:48:05,500 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 751 transitions. Word has length 51 [2021-08-27 07:48:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:05,501 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 751 transitions. [2021-08-27 07:48:05,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:48:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 751 transitions. [2021-08-27 07:48:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:48:05,501 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:05,502 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-08-27 07:48:05,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 07:48:05,502 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:05,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:05,502 INFO L82 PathProgramCache]: Analyzing trace with hash -999496148, now seen corresponding path program 1 times [2021-08-27 07:48:05,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:05,503 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378597640] [2021-08-27 07:48:05,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:05,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:05,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:05,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:05,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:05,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:48:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:05,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:05,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:05,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378597640] [2021-08-27 07:48:05,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378597640] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:05,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:05,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:48:05,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162714418] [2021-08-27 07:48:05,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:05,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:05,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:05,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:05,730 INFO L87 Difference]: Start difference. First operand 524 states and 751 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:06,572 INFO L93 Difference]: Finished difference Result 544 states and 778 transitions. [2021-08-27 07:48:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:48:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 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 52 [2021-08-27 07:48:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:06,574 INFO L225 Difference]: With dead ends: 544 [2021-08-27 07:48:06,574 INFO L226 Difference]: Without dead ends: 543 [2021-08-27 07:48:06,575 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 161.0ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:48:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-08-27 07:48:06,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 531. [2021-08-27 07:48:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 396 states have (on average 1.3282828282828283) internal successors, (526), 407 states have internal predecessors, (526), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2021-08-27 07:48:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 760 transitions. [2021-08-27 07:48:06,586 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 760 transitions. Word has length 52 [2021-08-27 07:48:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:06,586 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 760 transitions. [2021-08-27 07:48:06,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 760 transitions. [2021-08-27 07:48:06,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:48:06,587 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:06,587 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-08-27 07:48:06,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 07:48:06,588 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:06,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:06,588 INFO L82 PathProgramCache]: Analyzing trace with hash -999772978, now seen corresponding path program 1 times [2021-08-27 07:48:06,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:06,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454575861] [2021-08-27 07:48:06,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:06,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:48:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:06,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:06,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454575861] [2021-08-27 07:48:06,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454575861] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:06,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:06,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:48:06,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711045027] [2021-08-27 07:48:06,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:06,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:06,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:06,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:06,854 INFO L87 Difference]: Start difference. First operand 531 states and 760 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:07,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:07,509 INFO L93 Difference]: Finished difference Result 559 states and 794 transitions. [2021-08-27 07:48:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:48:07,510 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 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 52 [2021-08-27 07:48:07,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:07,512 INFO L225 Difference]: With dead ends: 559 [2021-08-27 07:48:07,512 INFO L226 Difference]: Without dead ends: 538 [2021-08-27 07:48:07,512 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 240.5ms TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:48:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-08-27 07:48:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 530. [2021-08-27 07:48:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 395 states have (on average 1.3265822784810126) internal successors, (524), 406 states have internal predecessors, (524), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2021-08-27 07:48:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 758 transitions. [2021-08-27 07:48:07,522 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 758 transitions. Word has length 52 [2021-08-27 07:48:07,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:07,523 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 758 transitions. [2021-08-27 07:48:07,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:07,523 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 758 transitions. [2021-08-27 07:48:07,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-27 07:48:07,524 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:07,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] [2021-08-27 07:48:07,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 07:48:07,524 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:07,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:07,525 INFO L82 PathProgramCache]: Analyzing trace with hash -639415020, now seen corresponding path program 1 times [2021-08-27 07:48:07,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:07,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273081607] [2021-08-27 07:48:07,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:07,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:07,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:07,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:07,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:48:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:07,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-08-27 07:48:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:07,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:07,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273081607] [2021-08-27 07:48:07,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273081607] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:07,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:07,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:48:07,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187003667] [2021-08-27 07:48:07,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:48:07,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:07,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:48:07,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:48:07,726 INFO L87 Difference]: Start difference. First operand 530 states and 758 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, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:08,156 INFO L93 Difference]: Finished difference Result 549 states and 800 transitions. [2021-08-27 07:48:08,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:48:08,156 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, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2021-08-27 07:48:08,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:08,158 INFO L225 Difference]: With dead ends: 549 [2021-08-27 07:48:08,158 INFO L226 Difference]: Without dead ends: 549 [2021-08-27 07:48:08,158 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 213.1ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-08-27 07:48:08,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 529. [2021-08-27 07:48:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 394 states have (on average 1.3197969543147208) internal successors, (520), 405 states have internal predecessors, (520), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2021-08-27 07:48:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 754 transitions. [2021-08-27 07:48:08,169 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 754 transitions. Word has length 58 [2021-08-27 07:48:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:08,169 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 754 transitions. [2021-08-27 07:48:08,169 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, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:08,169 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 754 transitions. [2021-08-27 07:48:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-27 07:48:08,170 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:08,170 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:08,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 07:48:08,170 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:08,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1490997952, now seen corresponding path program 1 times [2021-08-27 07:48:08,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:08,171 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762046008] [2021-08-27 07:48:08,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:08,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:08,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:08,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:08,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:08,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:48:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:08,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:08,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:08,388 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762046008] [2021-08-27 07:48:08,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762046008] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:08,389 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:08,389 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:48:08,389 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772999894] [2021-08-27 07:48:08,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:48:08,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:08,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:48:08,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:48:08,394 INFO L87 Difference]: Start difference. First operand 529 states and 754 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:48:09,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:09,712 INFO L93 Difference]: Finished difference Result 671 states and 995 transitions. [2021-08-27 07:48:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:48:09,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 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 53 [2021-08-27 07:48:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:09,715 INFO L225 Difference]: With dead ends: 671 [2021-08-27 07:48:09,715 INFO L226 Difference]: Without dead ends: 639 [2021-08-27 07:48:09,715 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 485.3ms TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:09,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-08-27 07:48:09,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 560. [2021-08-27 07:48:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 415 states have (on average 1.344578313253012) internal successors, (558), 426 states have internal predecessors, (558), 101 states have call successors, (101), 37 states have call predecessors, (101), 43 states have return successors, (165), 98 states have call predecessors, (165), 94 states have call successors, (165) [2021-08-27 07:48:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 824 transitions. [2021-08-27 07:48:09,727 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 824 transitions. Word has length 53 [2021-08-27 07:48:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:09,728 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 824 transitions. [2021-08-27 07:48:09,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:48:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 824 transitions. [2021-08-27 07:48:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:48:09,729 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:09,729 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-08-27 07:48:09,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 07:48:09,729 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:09,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:09,730 INFO L82 PathProgramCache]: Analyzing trace with hash -538464897, now seen corresponding path program 1 times [2021-08-27 07:48:09,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:09,730 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258565795] [2021-08-27 07:48:09,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:09,730 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 07:48:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:10,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:10,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:10,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258565795] [2021-08-27 07:48:10,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258565795] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:10,075 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:10,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:48:10,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729799150] [2021-08-27 07:48:10,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:48:10,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:10,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:48:10,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:48:10,078 INFO L87 Difference]: Start difference. First operand 560 states and 824 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:10,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:10,583 INFO L93 Difference]: Finished difference Result 390 states and 522 transitions. [2021-08-27 07:48:10,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:48:10,584 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-08-27 07:48:10,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:10,585 INFO L225 Difference]: With dead ends: 390 [2021-08-27 07:48:10,585 INFO L226 Difference]: Without dead ends: 390 [2021-08-27 07:48:10,586 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 203.9ms TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:48:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-08-27 07:48:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 338. [2021-08-27 07:48:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.2560975609756098) internal successors, (309), 254 states have internal predecessors, (309), 59 states have call successors, (59), 31 states have call predecessors, (59), 32 states have return successors, (74), 54 states have call predecessors, (74), 53 states have call successors, (74) [2021-08-27 07:48:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2021-08-27 07:48:10,593 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 63 [2021-08-27 07:48:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:10,593 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2021-08-27 07:48:10,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2021-08-27 07:48:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-27 07:48:10,594 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:10,594 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-08-27 07:48:10,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-27 07:48:10,595 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:10,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:10,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1094959805, now seen corresponding path program 1 times [2021-08-27 07:48:10,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:10,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431573289] [2021-08-27 07:48:10,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:10,596 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:10,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:10,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:10,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:10,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:10,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:10,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:10,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:10,907 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:10,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431573289] [2021-08-27 07:48:10,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431573289] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:10,908 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:10,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:10,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081265994] [2021-08-27 07:48:10,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:10,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:10,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:10,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:10,910 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:11,689 INFO L93 Difference]: Finished difference Result 343 states and 451 transitions. [2021-08-27 07:48:11,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:48:11,689 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2021-08-27 07:48:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:11,690 INFO L225 Difference]: With dead ends: 343 [2021-08-27 07:48:11,690 INFO L226 Difference]: Without dead ends: 304 [2021-08-27 07:48:11,690 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 225.8ms TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-08-27 07:48:11,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2021-08-27 07:48:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.2757009345794392) internal successors, (273), 220 states have internal predecessors, (273), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2021-08-27 07:48:11,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2021-08-27 07:48:11,696 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 58 [2021-08-27 07:48:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:11,696 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2021-08-27 07:48:11,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2021-08-27 07:48:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 07:48:11,697 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:11,697 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] [2021-08-27 07:48:11,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 07:48:11,698 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:11,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:11,698 INFO L82 PathProgramCache]: Analyzing trace with hash -703797032, now seen corresponding path program 1 times [2021-08-27 07:48:11,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:11,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129120097] [2021-08-27 07:48:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:11,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 07:48:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:11,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:11,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129120097] [2021-08-27 07:48:11,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129120097] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:11,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:11,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:48:11,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567188152] [2021-08-27 07:48:11,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:11,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:11,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:11,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:11,938 INFO L87 Difference]: Start difference. First operand 298 states and 398 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:12,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:12,605 INFO L93 Difference]: Finished difference Result 316 states and 429 transitions. [2021-08-27 07:48:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:48:12,605 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2021-08-27 07:48:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:12,606 INFO L225 Difference]: With dead ends: 316 [2021-08-27 07:48:12,606 INFO L226 Difference]: Without dead ends: 316 [2021-08-27 07:48:12,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 368.3ms TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:48:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-08-27 07:48:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 298. [2021-08-27 07:48:12,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.266355140186916) internal successors, (271), 220 states have internal predecessors, (271), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2021-08-27 07:48:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 396 transitions. [2021-08-27 07:48:12,612 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 396 transitions. Word has length 67 [2021-08-27 07:48:12,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:12,613 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 396 transitions. [2021-08-27 07:48:12,613 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 396 transitions. [2021-08-27 07:48:12,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-27 07:48:12,613 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:12,614 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-08-27 07:48:12,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-27 07:48:12,614 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:12,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:12,614 INFO L82 PathProgramCache]: Analyzing trace with hash -194321691, now seen corresponding path program 1 times [2021-08-27 07:48:12,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:12,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863109923] [2021-08-27 07:48:12,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:12,615 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:12,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:12,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:12,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-08-27 07:48:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:12,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:12,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:12,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:12,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:12,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863109923] [2021-08-27 07:48:12,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863109923] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:12,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:12,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:48:12,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697154183] [2021-08-27 07:48:12,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:12,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:12,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:12,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:12,841 INFO L87 Difference]: Start difference. First operand 298 states and 396 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:48:13,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:13,167 INFO L93 Difference]: Finished difference Result 330 states and 453 transitions. [2021-08-27 07:48:13,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:48:13,168 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2021-08-27 07:48:13,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:13,169 INFO L225 Difference]: With dead ends: 330 [2021-08-27 07:48:13,169 INFO L226 Difference]: Without dead ends: 330 [2021-08-27 07:48:13,169 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 163.8ms TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:48:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-08-27 07:48:13,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 303. [2021-08-27 07:48:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 218 states have (on average 1.261467889908257) internal successors, (275), 224 states have internal predecessors, (275), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2021-08-27 07:48:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 409 transitions. [2021-08-27 07:48:13,174 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 409 transitions. Word has length 68 [2021-08-27 07:48:13,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:13,175 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 409 transitions. [2021-08-27 07:48:13,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:48:13,175 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 409 transitions. [2021-08-27 07:48:13,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:48:13,176 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:13,176 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] [2021-08-27 07:48:13,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 07:48:13,176 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:13,177 INFO L82 PathProgramCache]: Analyzing trace with hash -198191505, now seen corresponding path program 1 times [2021-08-27 07:48:13,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:13,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056895006] [2021-08-27 07:48:13,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:13,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-08-27 07:48:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:13,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:13,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056895006] [2021-08-27 07:48:13,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056895006] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:13,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:13,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:48:13,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785894780] [2021-08-27 07:48:13,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:48:13,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:13,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:48:13,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:48:13,370 INFO L87 Difference]: Start difference. First operand 303 states and 409 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:48:13,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:13,851 INFO L93 Difference]: Finished difference Result 474 states and 674 transitions. [2021-08-27 07:48:13,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:48:13,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2021-08-27 07:48:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:13,853 INFO L225 Difference]: With dead ends: 474 [2021-08-27 07:48:13,854 INFO L226 Difference]: Without dead ends: 474 [2021-08-27 07:48:13,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 225.8ms TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:13,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-27 07:48:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 307. [2021-08-27 07:48:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 222 states have (on average 1.2657657657657657) internal successors, (281), 228 states have internal predecessors, (281), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2021-08-27 07:48:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 415 transitions. [2021-08-27 07:48:13,861 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 415 transitions. Word has length 69 [2021-08-27 07:48:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:13,861 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 415 transitions. [2021-08-27 07:48:13,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:48:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 415 transitions. [2021-08-27 07:48:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:48:13,862 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:13,862 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-08-27 07:48:13,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-27 07:48:13,862 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash 392199007, now seen corresponding path program 1 times [2021-08-27 07:48:13,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:13,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735825206] [2021-08-27 07:48:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:13,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:13,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-08-27 07:48:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:14,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:14,061 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735825206] [2021-08-27 07:48:14,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735825206] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:14,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:14,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:48:14,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382041238] [2021-08-27 07:48:14,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:48:14,062 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:14,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:48:14,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:48:14,062 INFO L87 Difference]: Start difference. First operand 307 states and 415 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, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:14,853 INFO L93 Difference]: Finished difference Result 529 states and 764 transitions. [2021-08-27 07:48:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:48:14,854 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, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2021-08-27 07:48:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:14,856 INFO L225 Difference]: With dead ends: 529 [2021-08-27 07:48:14,856 INFO L226 Difference]: Without dead ends: 529 [2021-08-27 07:48:14,856 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 215.3ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:48:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-08-27 07:48:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 490. [2021-08-27 07:48:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 366 states have internal predecessors, (461), 89 states have call successors, (89), 35 states have call predecessors, (89), 43 states have return successors, (153), 89 states have call predecessors, (153), 85 states have call successors, (153) [2021-08-27 07:48:14,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 703 transitions. [2021-08-27 07:48:14,867 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 703 transitions. Word has length 71 [2021-08-27 07:48:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:14,867 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 703 transitions. [2021-08-27 07:48:14,867 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, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:14,868 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 703 transitions. [2021-08-27 07:48:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-27 07:48:14,868 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:14,868 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] [2021-08-27 07:48:14,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-27 07:48:14,869 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:14,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1252090646, now seen corresponding path program 1 times [2021-08-27 07:48:14,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:14,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754162808] [2021-08-27 07:48:14,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:14,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:15,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-08-27 07:48:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:15,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:15,160 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754162808] [2021-08-27 07:48:15,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754162808] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:15,160 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:15,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:48:15,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354731881] [2021-08-27 07:48:15,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:48:15,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:15,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:48:15,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:48:15,162 INFO L87 Difference]: Start difference. First operand 490 states and 703 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-08-27 07:48:15,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:15,563 INFO L93 Difference]: Finished difference Result 493 states and 705 transitions. [2021-08-27 07:48:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:48:15,564 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2021-08-27 07:48:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:15,566 INFO L225 Difference]: With dead ends: 493 [2021-08-27 07:48:15,566 INFO L226 Difference]: Without dead ends: 493 [2021-08-27 07:48:15,567 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 221.0ms TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:48:15,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-08-27 07:48:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 484. [2021-08-27 07:48:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 353 states have (on average 1.2832861189801699) internal successors, (453), 361 states have internal predecessors, (453), 88 states have call successors, (88), 35 states have call predecessors, (88), 42 states have return successors, (146), 88 states have call predecessors, (146), 84 states have call successors, (146) [2021-08-27 07:48:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 687 transitions. [2021-08-27 07:48:15,576 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 687 transitions. Word has length 72 [2021-08-27 07:48:15,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:15,576 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 687 transitions. [2021-08-27 07:48:15,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-08-27 07:48:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 687 transitions. [2021-08-27 07:48:15,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-27 07:48:15,577 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:15,578 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-08-27 07:48:15,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-27 07:48:15,578 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:15,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:15,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1761504416, now seen corresponding path program 1 times [2021-08-27 07:48:15,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:15,579 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861570346] [2021-08-27 07:48:15,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:15,579 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-08-27 07:48:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:48:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:15,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:15,848 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861570346] [2021-08-27 07:48:15,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861570346] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:15,849 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:15,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:48:15,849 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915316443] [2021-08-27 07:48:15,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:15,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:15,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:15,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:15,851 INFO L87 Difference]: Start difference. First operand 484 states and 687 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:48:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:16,660 INFO L93 Difference]: Finished difference Result 450 states and 629 transitions. [2021-08-27 07:48:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:16,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2021-08-27 07:48:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:16,673 INFO L225 Difference]: With dead ends: 450 [2021-08-27 07:48:16,673 INFO L226 Difference]: Without dead ends: 450 [2021-08-27 07:48:16,673 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 373.5ms TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:48:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-08-27 07:48:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 436. [2021-08-27 07:48:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 320 states have (on average 1.296875) internal successors, (415), 329 states have internal predecessors, (415), 79 states have call successors, (79), 33 states have call predecessors, (79), 36 states have return successors, (110), 74 states have call predecessors, (110), 75 states have call successors, (110) [2021-08-27 07:48:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 604 transitions. [2021-08-27 07:48:16,681 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 604 transitions. Word has length 83 [2021-08-27 07:48:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:16,681 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 604 transitions. [2021-08-27 07:48:16,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:48:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 604 transitions. [2021-08-27 07:48:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-27 07:48:16,682 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:16,683 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-08-27 07:48:16,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-27 07:48:16,683 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:16,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:16,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1176411851, now seen corresponding path program 1 times [2021-08-27 07:48:16,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:16,684 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49062780] [2021-08-27 07:48:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:16,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:16,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:17,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-08-27 07:48:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:17,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:17,159 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49062780] [2021-08-27 07:48:17,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49062780] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:17,159 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:17,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-08-27 07:48:17,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045165180] [2021-08-27 07:48:17,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-27 07:48:17,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:17,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 07:48:17,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:48:17,161 INFO L87 Difference]: Start difference. First operand 436 states and 604 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2021-08-27 07:48:17,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:17,827 INFO L93 Difference]: Finished difference Result 483 states and 678 transitions. [2021-08-27 07:48:17,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:48:17,828 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2021-08-27 07:48:17,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:17,829 INFO L225 Difference]: With dead ends: 483 [2021-08-27 07:48:17,829 INFO L226 Difference]: Without dead ends: 461 [2021-08-27 07:48:17,830 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 393.8ms TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2021-08-27 07:48:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-08-27 07:48:17,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2021-08-27 07:48:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 329 states have (on average 1.2887537993920972) internal successors, (424), 339 states have internal predecessors, (424), 79 states have call successors, (79), 33 states have call predecessors, (79), 38 states have return successors, (116), 75 states have call predecessors, (116), 75 states have call successors, (116) [2021-08-27 07:48:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 619 transitions. [2021-08-27 07:48:17,838 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 619 transitions. Word has length 92 [2021-08-27 07:48:17,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:17,838 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 619 transitions. [2021-08-27 07:48:17,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2021-08-27 07:48:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 619 transitions. [2021-08-27 07:48:17,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-27 07:48:17,840 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:17,840 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-08-27 07:48:17,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-27 07:48:17,840 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:17,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:17,841 INFO L82 PathProgramCache]: Analyzing trace with hash 702793907, now seen corresponding path program 1 times [2021-08-27 07:48:17,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:17,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319950259] [2021-08-27 07:48:17,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:17,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:17,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:17,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 07:48:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:18,320 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:18,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319950259] [2021-08-27 07:48:18,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319950259] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:18,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:18,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-08-27 07:48:18,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489154673] [2021-08-27 07:48:18,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-27 07:48:18,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:18,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 07:48:18,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:48:18,324 INFO L87 Difference]: Start difference. First operand 447 states and 619 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2021-08-27 07:48:19,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:19,249 INFO L93 Difference]: Finished difference Result 481 states and 674 transitions. [2021-08-27 07:48:19,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:48:19,250 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2021-08-27 07:48:19,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:19,251 INFO L225 Difference]: With dead ends: 481 [2021-08-27 07:48:19,251 INFO L226 Difference]: Without dead ends: 459 [2021-08-27 07:48:19,252 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 390.8ms TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2021-08-27 07:48:19,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-08-27 07:48:19,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 434. [2021-08-27 07:48:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 319 states have (on average 1.297805642633229) internal successors, (414), 328 states have internal predecessors, (414), 78 states have call successors, (78), 33 states have call predecessors, (78), 36 states have return successors, (108), 73 states have call predecessors, (108), 74 states have call successors, (108) [2021-08-27 07:48:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 600 transitions. [2021-08-27 07:48:19,259 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 600 transitions. Word has length 93 [2021-08-27 07:48:19,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:19,259 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 600 transitions. [2021-08-27 07:48:19,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2021-08-27 07:48:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 600 transitions. [2021-08-27 07:48:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-27 07:48:19,261 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:19,261 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] [2021-08-27 07:48:19,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-27 07:48:19,261 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:19,262 INFO L82 PathProgramCache]: Analyzing trace with hash 940384513, now seen corresponding path program 1 times [2021-08-27 07:48:19,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:19,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7219195] [2021-08-27 07:48:19,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:19,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:48:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-08-27 07:48:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:19,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:19,716 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7219195] [2021-08-27 07:48:19,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7219195] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:19,717 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:19,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-08-27 07:48:19,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913503706] [2021-08-27 07:48:19,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-27 07:48:19,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:19,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 07:48:19,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:48:19,718 INFO L87 Difference]: Start difference. First operand 434 states and 600 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-08-27 07:48:21,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:21,982 INFO L93 Difference]: Finished difference Result 860 states and 1205 transitions. [2021-08-27 07:48:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-08-27 07:48:21,982 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2021-08-27 07:48:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:21,986 INFO L225 Difference]: With dead ends: 860 [2021-08-27 07:48:21,986 INFO L226 Difference]: Without dead ends: 827 [2021-08-27 07:48:21,987 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 783.6ms TimeCoverageRelationStatistics Valid=289, Invalid=2261, Unknown=0, NotChecked=0, Total=2550 [2021-08-27 07:48:21,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-08-27 07:48:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 805. [2021-08-27 07:48:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 596 states have (on average 1.3120805369127517) internal successors, (782), 614 states have internal predecessors, (782), 143 states have call successors, (143), 57 states have call predecessors, (143), 65 states have return successors, (208), 134 states have call predecessors, (208), 139 states have call successors, (208) [2021-08-27 07:48:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1133 transitions. [2021-08-27 07:48:22,003 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1133 transitions. Word has length 103 [2021-08-27 07:48:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:22,004 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1133 transitions. [2021-08-27 07:48:22,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-08-27 07:48:22,004 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1133 transitions. [2021-08-27 07:48:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-27 07:48:22,005 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:22,005 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] [2021-08-27 07:48:22,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-27 07:48:22,006 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:22,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:22,006 INFO L82 PathProgramCache]: Analyzing trace with hash 911884223, now seen corresponding path program 1 times [2021-08-27 07:48:22,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:22,006 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641338374] [2021-08-27 07:48:22,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:22,007 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:48:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-08-27 07:48:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:22,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:22,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641338374] [2021-08-27 07:48:22,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641338374] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:22,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:22,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-08-27 07:48:22,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399818058] [2021-08-27 07:48:22,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-27 07:48:22,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:22,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 07:48:22,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:48:22,489 INFO L87 Difference]: Start difference. First operand 805 states and 1133 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-08-27 07:48:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:25,435 INFO L93 Difference]: Finished difference Result 847 states and 1189 transitions. [2021-08-27 07:48:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-27 07:48:25,435 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2021-08-27 07:48:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:25,437 INFO L225 Difference]: With dead ends: 847 [2021-08-27 07:48:25,438 INFO L226 Difference]: Without dead ends: 814 [2021-08-27 07:48:25,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 757.3ms TimeCoverageRelationStatistics Valid=257, Invalid=1723, Unknown=0, NotChecked=0, Total=1980 [2021-08-27 07:48:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-08-27 07:48:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 424. [2021-08-27 07:48:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 313 states have (on average 1.3003194888178913) internal successors, (407), 322 states have internal predecessors, (407), 75 states have call successors, (75), 32 states have call predecessors, (75), 35 states have return successors, (105), 70 states have call predecessors, (105), 71 states have call successors, (105) [2021-08-27 07:48:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 587 transitions. [2021-08-27 07:48:25,446 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 587 transitions. Word has length 103 [2021-08-27 07:48:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:25,446 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 587 transitions. [2021-08-27 07:48:25,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-08-27 07:48:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 587 transitions. [2021-08-27 07:48:25,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-08-27 07:48:25,447 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:25,448 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] [2021-08-27 07:48:25,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-27 07:48:25,448 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:25,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:25,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1426002147, now seen corresponding path program 1 times [2021-08-27 07:48:25,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:25,449 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500368733] [2021-08-27 07:48:25,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:25,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-08-27 07:48:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-08-27 07:48:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:26,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-08-27 07:48:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:26,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:26,003 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500368733] [2021-08-27 07:48:26,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500368733] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:26,003 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:26,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-27 07:48:26,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920392245] [2021-08-27 07:48:26,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 07:48:26,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:26,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 07:48:26,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:48:26,005 INFO L87 Difference]: Start difference. First operand 424 states and 587 transitions. Second operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 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-08-27 07:48:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:26,819 INFO L93 Difference]: Finished difference Result 478 states and 676 transitions. [2021-08-27 07:48:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 07:48:26,819 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 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 108 [2021-08-27 07:48:26,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:26,820 INFO L225 Difference]: With dead ends: 478 [2021-08-27 07:48:26,820 INFO L226 Difference]: Without dead ends: 454 [2021-08-27 07:48:26,821 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 539.7ms TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2021-08-27 07:48:26,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-08-27 07:48:26,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2021-08-27 07:48:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 324 states have (on average 1.2901234567901234) internal successors, (418), 334 states have internal predecessors, (418), 78 states have call successors, (78), 32 states have call predecessors, (78), 37 states have return successors, (114), 74 states have call predecessors, (114), 73 states have call successors, (114) [2021-08-27 07:48:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 610 transitions. [2021-08-27 07:48:26,828 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 610 transitions. Word has length 108 [2021-08-27 07:48:26,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:26,828 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 610 transitions. [2021-08-27 07:48:26,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 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-08-27 07:48:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 610 transitions. [2021-08-27 07:48:26,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-08-27 07:48:26,830 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:26,830 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] [2021-08-27 07:48:26,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-27 07:48:26,830 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:26,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:26,831 INFO L82 PathProgramCache]: Analyzing trace with hash 986627049, now seen corresponding path program 1 times [2021-08-27 07:48:26,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:26,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801813738] [2021-08-27 07:48:26,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:26,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:26,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:26,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:26,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:27,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:27,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:27,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:27,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:27,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:27,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:27,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 07:48:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:27,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-08-27 07:48:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:27,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:27,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-08-27 07:48:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:27,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:27,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:27,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801813738] [2021-08-27 07:48:27,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801813738] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:27,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:27,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-27 07:48:27,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335679073] [2021-08-27 07:48:27,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 07:48:27,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:27,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 07:48:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:48:27,345 INFO L87 Difference]: Start difference. First operand 440 states and 610 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 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-08-27 07:48:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:28,423 INFO L93 Difference]: Finished difference Result 480 states and 674 transitions. [2021-08-27 07:48:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 07:48:28,424 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 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 109 [2021-08-27 07:48:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:28,426 INFO L225 Difference]: With dead ends: 480 [2021-08-27 07:48:28,426 INFO L226 Difference]: Without dead ends: 443 [2021-08-27 07:48:28,426 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 517.0ms TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2021-08-27 07:48:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-08-27 07:48:28,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 413. [2021-08-27 07:48:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 304 states have (on average 1.2664473684210527) internal successors, (385), 312 states have internal predecessors, (385), 75 states have call successors, (75), 32 states have call predecessors, (75), 33 states have return successors, (97), 69 states have call predecessors, (97), 70 states have call successors, (97) [2021-08-27 07:48:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2021-08-27 07:48:28,435 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 109 [2021-08-27 07:48:28,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:28,436 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2021-08-27 07:48:28,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 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-08-27 07:48:28,436 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2021-08-27 07:48:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-08-27 07:48:28,437 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:28,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:28,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-27 07:48:28,438 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:28,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:28,438 INFO L82 PathProgramCache]: Analyzing trace with hash 358552163, now seen corresponding path program 1 times [2021-08-27 07:48:28,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:28,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796298492] [2021-08-27 07:48:28,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:28,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-08-27 07:48:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:48:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 07:48:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:48:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 07:48:28,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:28,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796298492] [2021-08-27 07:48:28,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796298492] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:28,726 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:28,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:28,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33498958] [2021-08-27 07:48:28,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:28,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:28,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:28,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:28,728 INFO L87 Difference]: Start difference. First operand 413 states and 557 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2021-08-27 07:48:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:29,388 INFO L93 Difference]: Finished difference Result 420 states and 559 transitions. [2021-08-27 07:48:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:29,388 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2021-08-27 07:48:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:29,390 INFO L225 Difference]: With dead ends: 420 [2021-08-27 07:48:29,390 INFO L226 Difference]: Without dead ends: 420 [2021-08-27 07:48:29,390 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 238.3ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:29,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-08-27 07:48:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 408. [2021-08-27 07:48:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 302 states have (on average 1.2483443708609272) internal successors, (377), 309 states have internal predecessors, (377), 71 states have call successors, (71), 32 states have call predecessors, (71), 34 states have return successors, (92), 67 states have call predecessors, (92), 66 states have call successors, (92) [2021-08-27 07:48:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 540 transitions. [2021-08-27 07:48:29,399 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 540 transitions. Word has length 121 [2021-08-27 07:48:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:29,399 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 540 transitions. [2021-08-27 07:48:29,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2021-08-27 07:48:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 540 transitions. [2021-08-27 07:48:29,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-08-27 07:48:29,401 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:29,401 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:29,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-27 07:48:29,401 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:29,402 INFO L82 PathProgramCache]: Analyzing trace with hash -618619876, now seen corresponding path program 1 times [2021-08-27 07:48:29,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:29,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28456040] [2021-08-27 07:48:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:29,402 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-08-27 07:48:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:48:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 07:48:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:48:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:29,714 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 07:48:29,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:29,715 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28456040] [2021-08-27 07:48:29,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28456040] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:29,715 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:29,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:29,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100211550] [2021-08-27 07:48:29,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:29,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:29,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:29,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:29,716 INFO L87 Difference]: Start difference. First operand 408 states and 540 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2021-08-27 07:48:30,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:30,319 INFO L93 Difference]: Finished difference Result 547 states and 788 transitions. [2021-08-27 07:48:30,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:30,320 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2021-08-27 07:48:30,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:30,322 INFO L225 Difference]: With dead ends: 547 [2021-08-27 07:48:30,322 INFO L226 Difference]: Without dead ends: 547 [2021-08-27 07:48:30,322 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 222.5ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:30,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-08-27 07:48:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 399. [2021-08-27 07:48:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 294 states have (on average 1.248299319727891) internal successors, (367), 301 states have internal predecessors, (367), 71 states have call successors, (71), 32 states have call predecessors, (71), 33 states have return successors, (91), 66 states have call predecessors, (91), 66 states have call successors, (91) [2021-08-27 07:48:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 529 transitions. [2021-08-27 07:48:30,329 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 529 transitions. Word has length 122 [2021-08-27 07:48:30,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:30,329 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 529 transitions. [2021-08-27 07:48:30,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2021-08-27 07:48:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 529 transitions. [2021-08-27 07:48:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-27 07:48:30,331 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:30,331 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] [2021-08-27 07:48:30,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-27 07:48:30,331 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1613788965, now seen corresponding path program 1 times [2021-08-27 07:48:30,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:30,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937790114] [2021-08-27 07:48:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:30,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:48:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-08-27 07:48:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-08-27 07:48:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 07:48:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:30,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:30,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937790114] [2021-08-27 07:48:30,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937790114] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:30,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:30,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-27 07:48:30,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995610600] [2021-08-27 07:48:30,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 07:48:30,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:30,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 07:48:30,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:48:30,857 INFO L87 Difference]: Start difference. First operand 399 states and 529 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-08-27 07:48:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:33,184 INFO L93 Difference]: Finished difference Result 800 states and 1072 transitions. [2021-08-27 07:48:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-08-27 07:48:33,184 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2021-08-27 07:48:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:33,187 INFO L225 Difference]: With dead ends: 800 [2021-08-27 07:48:33,187 INFO L226 Difference]: Without dead ends: 743 [2021-08-27 07:48:33,188 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 885.6ms TimeCoverageRelationStatistics Valid=377, Invalid=2929, Unknown=0, NotChecked=0, Total=3306 [2021-08-27 07:48:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2021-08-27 07:48:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 724. [2021-08-27 07:48:33,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 536 states have (on average 1.2182835820895523) internal successors, (653), 547 states have internal predecessors, (653), 130 states have call successors, (130), 57 states have call predecessors, (130), 57 states have return successors, (166), 120 states have call predecessors, (166), 122 states have call successors, (166) [2021-08-27 07:48:33,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 949 transitions. [2021-08-27 07:48:33,209 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 949 transitions. Word has length 119 [2021-08-27 07:48:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:33,210 INFO L470 AbstractCegarLoop]: Abstraction has 724 states and 949 transitions. [2021-08-27 07:48:33,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-08-27 07:48:33,210 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 949 transitions. [2021-08-27 07:48:33,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-08-27 07:48:33,211 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:33,211 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] [2021-08-27 07:48:33,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-27 07:48:33,212 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:33,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash 708012953, now seen corresponding path program 1 times [2021-08-27 07:48:33,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:33,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119106865] [2021-08-27 07:48:33,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:33,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:48:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-08-27 07:48:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-08-27 07:48:33,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 07:48:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:33,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:33,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119106865] [2021-08-27 07:48:33,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119106865] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:33,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:33,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-27 07:48:33,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165024717] [2021-08-27 07:48:33,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 07:48:33,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:33,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 07:48:33,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:48:33,775 INFO L87 Difference]: Start difference. First operand 724 states and 949 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-08-27 07:48:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:36,382 INFO L93 Difference]: Finished difference Result 741 states and 977 transitions. [2021-08-27 07:48:36,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-08-27 07:48:36,382 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2021-08-27 07:48:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:36,385 INFO L225 Difference]: With dead ends: 741 [2021-08-27 07:48:36,385 INFO L226 Difference]: Without dead ends: 684 [2021-08-27 07:48:36,385 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 871.0ms TimeCoverageRelationStatistics Valid=341, Invalid=2209, Unknown=0, NotChecked=0, Total=2550 [2021-08-27 07:48:36,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-08-27 07:48:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 341. [2021-08-27 07:48:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 250 states have (on average 1.18) internal successors, (295), 255 states have internal predecessors, (295), 64 states have call successors, (64), 29 states have call predecessors, (64), 26 states have return successors, (77), 56 states have call predecessors, (77), 58 states have call successors, (77) [2021-08-27 07:48:36,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 436 transitions. [2021-08-27 07:48:36,393 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 436 transitions. Word has length 119 [2021-08-27 07:48:36,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:36,394 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 436 transitions. [2021-08-27 07:48:36,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-08-27 07:48:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 436 transitions. [2021-08-27 07:48:36,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-08-27 07:48:36,395 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:36,396 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-27 07:48:36,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-27 07:48:36,396 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:36,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:36,396 INFO L82 PathProgramCache]: Analyzing trace with hash -292170069, now seen corresponding path program 1 times [2021-08-27 07:48:36,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:36,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909805635] [2021-08-27 07:48:36,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:36,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:36,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-08-27 07:48:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:48:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 07:48:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:48:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 07:48:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-08-27 07:48:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-27 07:48:36,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:36,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909805635] [2021-08-27 07:48:36,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909805635] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:48:36,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665701341] [2021-08-27 07:48:36,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:36,700 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:48:36,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:48:36,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:48:36,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 07:48:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 07:48:37,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:48:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-27 07:48:37,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665701341] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:37,530 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 07:48:37,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 15 [2021-08-27 07:48:37,531 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257614509] [2021-08-27 07:48:37,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:48:37,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:37,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:48:37,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:37,532 INFO L87 Difference]: Start difference. First operand 341 states and 436 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-08-27 07:48:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:37,584 INFO L93 Difference]: Finished difference Result 374 states and 483 transitions. [2021-08-27 07:48:37,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:48:37,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 163 [2021-08-27 07:48:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:37,586 INFO L225 Difference]: With dead ends: 374 [2021-08-27 07:48:37,586 INFO L226 Difference]: Without dead ends: 372 [2021-08-27 07:48:37,587 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 198.1ms TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-08-27 07:48:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 361. [2021-08-27 07:48:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 268 states have (on average 1.1679104477611941) internal successors, (313), 273 states have internal predecessors, (313), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2021-08-27 07:48:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 465 transitions. [2021-08-27 07:48:37,593 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 465 transitions. Word has length 163 [2021-08-27 07:48:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:37,593 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 465 transitions. [2021-08-27 07:48:37,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-08-27 07:48:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 465 transitions. [2021-08-27 07:48:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-08-27 07:48:37,595 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:37,595 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-27 07:48:37,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 07:48:37,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-08-27 07:48:37,826 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:37,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:37,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1488612663, now seen corresponding path program 1 times [2021-08-27 07:48:37,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:37,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258718978] [2021-08-27 07:48:37,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:37,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-08-27 07:48:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:48:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 07:48:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:48:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 07:48:38,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 07:48:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-08-27 07:48:38,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:38,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258718978] [2021-08-27 07:48:38,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258718978] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:38,195 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:38,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:38,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806744887] [2021-08-27 07:48:38,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:38,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:38,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:38,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:38,196 INFO L87 Difference]: Start difference. First operand 361 states and 465 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2021-08-27 07:48:38,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:38,852 INFO L93 Difference]: Finished difference Result 388 states and 505 transitions. [2021-08-27 07:48:38,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:38,853 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) Word has length 164 [2021-08-27 07:48:38,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:38,854 INFO L225 Difference]: With dead ends: 388 [2021-08-27 07:48:38,854 INFO L226 Difference]: Without dead ends: 388 [2021-08-27 07:48:38,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 256.8ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-08-27 07:48:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 363. [2021-08-27 07:48:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 270 states have (on average 1.1666666666666667) internal successors, (315), 275 states have internal predecessors, (315), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2021-08-27 07:48:38,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 467 transitions. [2021-08-27 07:48:38,860 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 467 transitions. Word has length 164 [2021-08-27 07:48:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:38,861 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 467 transitions. [2021-08-27 07:48:38,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2021-08-27 07:48:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 467 transitions. [2021-08-27 07:48:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-08-27 07:48:38,862 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:38,862 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-27 07:48:38,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-27 07:48:38,863 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:38,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:38,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1456464136, now seen corresponding path program 1 times [2021-08-27 07:48:38,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:38,864 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546876550] [2021-08-27 07:48:38,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:38,864 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:38,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-08-27 07:48:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:48:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 07:48:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:48:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 07:48:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 07:48:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-08-27 07:48:39,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:39,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546876550] [2021-08-27 07:48:39,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546876550] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:39,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:39,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:48:39,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272737256] [2021-08-27 07:48:39,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:39,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:39,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:39,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:39,169 INFO L87 Difference]: Start difference. First operand 363 states and 467 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (19), 11 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-08-27 07:48:39,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:39,495 INFO L93 Difference]: Finished difference Result 369 states and 477 transitions. [2021-08-27 07:48:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:48:39,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (19), 11 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2021-08-27 07:48:39,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:39,500 INFO L225 Difference]: With dead ends: 369 [2021-08-27 07:48:39,500 INFO L226 Difference]: Without dead ends: 369 [2021-08-27 07:48:39,500 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 202.9ms TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:48:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-08-27 07:48:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2021-08-27 07:48:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 270 states have (on average 1.1592592592592592) internal successors, (313), 275 states have internal predecessors, (313), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2021-08-27 07:48:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 465 transitions. [2021-08-27 07:48:39,506 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 465 transitions. Word has length 164 [2021-08-27 07:48:39,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:39,506 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 465 transitions. [2021-08-27 07:48:39,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (19), 11 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-08-27 07:48:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 465 transitions. [2021-08-27 07:48:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-08-27 07:48:39,508 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:39,508 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2021-08-27 07:48:39,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-27 07:48:39,509 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:39,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:39,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1734693448, now seen corresponding path program 1 times [2021-08-27 07:48:39,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:39,509 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862419454] [2021-08-27 07:48:39,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:39,510 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-08-27 07:48:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:48:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 07:48:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:48:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 07:48:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 07:48:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-08-27 07:48:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-08-27 07:48:39,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:39,855 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862419454] [2021-08-27 07:48:39,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862419454] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:39,855 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:39,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:39,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867024824] [2021-08-27 07:48:39,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:39,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:39,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:39,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:39,857 INFO L87 Difference]: Start difference. First operand 363 states and 465 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-08-27 07:48:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:40,301 INFO L93 Difference]: Finished difference Result 428 states and 566 transitions. [2021-08-27 07:48:40,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:40,301 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 172 [2021-08-27 07:48:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:40,303 INFO L225 Difference]: With dead ends: 428 [2021-08-27 07:48:40,303 INFO L226 Difference]: Without dead ends: 428 [2021-08-27 07:48:40,303 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 233.5ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-08-27 07:48:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 345. [2021-08-27 07:48:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 256 states have (on average 1.14453125) internal successors, (293), 260 states have internal predecessors, (293), 60 states have call successors, (60), 29 states have call predecessors, (60), 28 states have return successors, (80), 55 states have call predecessors, (80), 54 states have call successors, (80) [2021-08-27 07:48:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 433 transitions. [2021-08-27 07:48:40,310 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 433 transitions. Word has length 172 [2021-08-27 07:48:40,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:40,310 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 433 transitions. [2021-08-27 07:48:40,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-08-27 07:48:40,310 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 433 transitions. [2021-08-27 07:48:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-08-27 07:48:40,312 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:40,312 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-08-27 07:48:40,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-27 07:48:40,313 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:40,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:40,313 INFO L82 PathProgramCache]: Analyzing trace with hash 405901981, now seen corresponding path program 1 times [2021-08-27 07:48:40,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:40,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873579089] [2021-08-27 07:48:40,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:40,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-08-27 07:48:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:48:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 07:48:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:48:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 07:48:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 07:48:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-27 07:48:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-08-27 07:48:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:40,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-08-27 07:48:40,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:40,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873579089] [2021-08-27 07:48:40,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873579089] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:40,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:40,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:40,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123304555] [2021-08-27 07:48:40,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:40,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:40,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:40,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:40,682 INFO L87 Difference]: Start difference. First operand 345 states and 433 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-08-27 07:48:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:41,107 INFO L93 Difference]: Finished difference Result 354 states and 451 transitions. [2021-08-27 07:48:41,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:41,108 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 204 [2021-08-27 07:48:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:41,109 INFO L225 Difference]: With dead ends: 354 [2021-08-27 07:48:41,109 INFO L226 Difference]: Without dead ends: 354 [2021-08-27 07:48:41,110 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 263.0ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:41,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-08-27 07:48:41,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 309. [2021-08-27 07:48:41,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 231 states have (on average 1.1255411255411256) internal successors, (260), 234 states have internal predecessors, (260), 52 states have call successors, (52), 24 states have call predecessors, (52), 25 states have return successors, (73), 50 states have call predecessors, (73), 47 states have call successors, (73) [2021-08-27 07:48:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 385 transitions. [2021-08-27 07:48:41,115 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 385 transitions. Word has length 204 [2021-08-27 07:48:41,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:41,115 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 385 transitions. [2021-08-27 07:48:41,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-08-27 07:48:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 385 transitions. [2021-08-27 07:48:41,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-08-27 07:48:41,117 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:41,118 INFO L512 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2021-08-27 07:48:41,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-08-27 07:48:41,118 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:41,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2083081796, now seen corresponding path program 1 times [2021-08-27 07:48:41,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:41,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293286500] [2021-08-27 07:48:41,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:41,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:41,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-08-27 07:48:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:48:41,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 07:48:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:48:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 07:48:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-08-27 07:48:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:41,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-27 07:48:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-08-27 07:48:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:48:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-08-27 07:48:41,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:41,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293286500] [2021-08-27 07:48:41,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293286500] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:41,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:41,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:41,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254308298] [2021-08-27 07:48:41,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:41,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:41,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:41,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:41,519 INFO L87 Difference]: Start difference. First operand 309 states and 385 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-08-27 07:48:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:42,235 INFO L93 Difference]: Finished difference Result 290 states and 362 transitions. [2021-08-27 07:48:42,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:42,235 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 207 [2021-08-27 07:48:42,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:42,236 INFO L225 Difference]: With dead ends: 290 [2021-08-27 07:48:42,236 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 07:48:42,236 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 261.9ms TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 07:48:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 07:48:42,237 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-08-27 07:48:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 07:48:42,237 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2021-08-27 07:48:42,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:42,237 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 07:48:42,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-08-27 07:48:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 07:48:42,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 07:48:42,240 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:48:42,240 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:48:42,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-08-27 07:48:42,243 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:48:42,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:48:42 BoogieIcfgContainer [2021-08-27 07:48:42,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:48:42,245 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:48:42,246 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:48:42,246 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:48:42,246 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:47:33" (3/4) ... [2021-08-27 07:48:42,248 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 07:48:42,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-08-27 07:48:42,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2021-08-27 07:48:42,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-08-27 07:48:42,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2021-08-27 07:48:42,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-08-27 07:48:42,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2021-08-27 07:48:42,253 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2021-08-27 07:48:42,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-08-27 07:48:42,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-08-27 07:48:42,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2021-08-27 07:48:42,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2021-08-27 07:48:42,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2021-08-27 07:48:42,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2021-08-27 07:48:42,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2021-08-27 07:48:42,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2021-08-27 07:48:42,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2021-08-27 07:48:42,254 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2021-08-27 07:48:42,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-08-27 07:48:42,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2021-08-27 07:48:42,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2021-08-27 07:48:42,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2021-08-27 07:48:42,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2021-08-27 07:48:42,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-08-27 07:48:42,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2021-08-27 07:48:42,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2021-08-27 07:48:42,255 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-08-27 07:48:42,256 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2021-08-27 07:48:42,268 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2021-08-27 07:48:42,269 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2021-08-27 07:48:42,270 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-27 07:48:42,272 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-27 07:48:42,362 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 07:48:42,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:48:42,363 INFO L168 Benchmark]: Toolchain (without parser) took 70514.68 ms. Allocated memory was 60.8 MB in the beginning and 446.7 MB in the end (delta: 385.9 MB). Free memory was 38.5 MB in the beginning and 411.4 MB in the end (delta: -372.9 MB). Peak memory consumption was 267.4 MB. Max. memory is 16.1 GB. [2021-08-27 07:48:42,363 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 60.8 MB. Free memory was 42.9 MB in the beginning and 42.8 MB in the end (delta: 44.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:48:42,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.60 ms. Allocated memory is still 60.8 MB. Free memory was 38.4 MB in the beginning and 34.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-27 07:48:42,364 INFO L168 Benchmark]: Boogie Preprocessor took 113.82 ms. Allocated memory is still 60.8 MB. Free memory was 34.2 MB in the beginning and 30.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:48:42,364 INFO L168 Benchmark]: RCFGBuilder took 1103.21 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 30.6 MB in the beginning and 48.0 MB in the end (delta: -17.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. [2021-08-27 07:48:42,365 INFO L168 Benchmark]: TraceAbstraction took 68769.75 ms. Allocated memory was 77.6 MB in the beginning and 446.7 MB in the end (delta: 369.1 MB). Free memory was 47.6 MB in the beginning and 169.1 MB in the end (delta: -121.5 MB). Peak memory consumption was 246.8 MB. Max. memory is 16.1 GB. [2021-08-27 07:48:42,365 INFO L168 Benchmark]: Witness Printer took 116.48 ms. Allocated memory is still 446.7 MB. Free memory was 169.1 MB in the beginning and 411.4 MB in the end (delta: -242.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 07:48:42,366 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.19 ms. Allocated memory is still 60.8 MB. Free memory was 42.9 MB in the beginning and 42.8 MB in the end (delta: 44.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 406.60 ms. Allocated memory is still 60.8 MB. Free memory was 38.4 MB in the beginning and 34.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 113.82 ms. Allocated memory is still 60.8 MB. Free memory was 34.2 MB in the beginning and 30.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1103.21 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 30.6 MB in the beginning and 48.0 MB in the end (delta: -17.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 68769.75 ms. Allocated memory was 77.6 MB in the beginning and 446.7 MB in the end (delta: 369.1 MB). Free memory was 47.6 MB in the beginning and 169.1 MB in the end (delta: -121.5 MB). Peak memory consumption was 246.8 MB. Max. memory is 16.1 GB. * Witness Printer took 116.48 ms. Allocated memory is still 446.7 MB. Free memory was 169.1 MB in the beginning and 411.4 MB in the end (delta: -242.2 MB). Peak memory consumption was 12.6 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: 647]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 56]: 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 28 procedures, 299 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 68726.9ms, OverallIterations: 51, TraceHistogramMax: 4, EmptinessCheckTime: 64.4ms, AutomataDifference: 51486.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 14086 SDtfs, 15531 SDslu, 43660 SDs, 0 SdLazy, 55799 SolverSat, 7488 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 34810.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1756 GetRequests, 927 SyntacticMatches, 0 SemanticMatches, 829 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 16864.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1085occurred in iteration=8, InterpolantAutomatonStates: 656, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 693.1ms AutomataMinimizationTime, 51 MinimizatonAttempts, 2877 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 246.6ms SsaConstructionTime, 752.2ms SatisfiabilityAnalysisTime, 14597.2ms InterpolantComputationTime, 4057 NumberOfCodeBlocks, 4057 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 4005 ConstructedInterpolants, 0 QuantifiedInterpolants, 17077 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1359 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 52 InterpolantComputations, 51 PerfectInterpolantSequences, 851/857 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-08-27 07:48:42,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...