./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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/floppy_simpl4.cil-2.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 3dcfb71b16f6783353008d1be8597dab2a9bd20e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:49:05,321 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:49:05,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:49:05,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:49:05,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:49:05,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:49:05,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:49:05,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:49:05,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:49:05,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:49:05,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:49:05,382 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:49:05,382 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:49:05,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:49:05,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:49:05,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:49:05,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:49:05,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:49:05,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:49:05,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:49:05,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:49:05,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:49:05,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:49:05,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:49:05,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:49:05,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:49:05,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:49:05,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:49:05,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:49:05,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:49:05,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:49:05,412 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:49:05,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:49:05,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:49:05,414 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:49:05,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:49:05,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:49:05,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:49:05,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:49:05,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:49:05,417 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:49:05,420 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:49:05,449 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:49:05,449 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:49:05,450 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:49:05,450 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:49:05,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:49:05,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:49:05,452 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:49:05,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:49:05,453 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:49:05,453 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:49:05,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:49:05,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:49:05,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:49:05,454 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:49:05,454 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:49:05,454 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:49:05,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:49:05,454 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:49:05,455 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:49:05,455 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:49:05,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:49:05,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:49:05,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:49:05,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:49:05,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:49:05,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:49:05,456 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:49:05,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:49:05,456 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:49:05,456 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 -> 3dcfb71b16f6783353008d1be8597dab2a9bd20e [2021-08-27 07:49:05,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:49:05,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:49:05,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:49:05,697 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:49:05,698 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:49:05,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-08-27 07:49:05,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73274e27/41bfeb8f5c454f12ae4193abddc80665/FLAG6fd1b42dc [2021-08-27 07:49:06,211 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:49:06,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-08-27 07:49:06,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73274e27/41bfeb8f5c454f12ae4193abddc80665/FLAG6fd1b42dc [2021-08-27 07:49:06,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b73274e27/41bfeb8f5c454f12ae4193abddc80665 [2021-08-27 07:49:06,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:49:06,562 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:49:06,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:49:06,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:49:06,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:49:06,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:49:06" (1/1) ... [2021-08-27 07:49:06,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d12ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:06, skipping insertion in model container [2021-08-27 07:49:06,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:49:06" (1/1) ... [2021-08-27 07:49:06,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:49:06,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:49:06,935 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/floppy_simpl4.cil-2.c[48585,48598] [2021-08-27 07:49:06,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:49:06,942 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:49:06,992 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/floppy_simpl4.cil-2.c[48585,48598] [2021-08-27 07:49:06,993 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:49:07,003 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:49:07,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:07 WrapperNode [2021-08-27 07:49:07,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:49:07,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:49:07,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:49:07,007 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:49:07,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:07" (1/1) ... [2021-08-27 07:49:07,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:07" (1/1) ... [2021-08-27 07:49:07,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:07" (1/1) ... [2021-08-27 07:49:07,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:07" (1/1) ... [2021-08-27 07:49:07,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:07" (1/1) ... [2021-08-27 07:49:07,075 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:07" (1/1) ... [2021-08-27 07:49:07,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:07" (1/1) ... [2021-08-27 07:49:07,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:49:07,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:49:07,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:49:07,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:49:07,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:07" (1/1) ... [2021-08-27 07:49:07,109 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:49:07,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:49:07,134 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:49:07,136 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:49:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:49:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:49:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:49:07,160 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-08-27 07:49:07,160 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2021-08-27 07:49:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2021-08-27 07:49:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2021-08-27 07:49:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2021-08-27 07:49:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2021-08-27 07:49:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2021-08-27 07:49:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2021-08-27 07:49:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-08-27 07:49:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:49:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-08-27 07:49:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2021-08-27 07:49:07,163 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2021-08-27 07:49:07,163 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2021-08-27 07:49:07,163 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2021-08-27 07:49:07,163 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-08-27 07:49:07,163 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-08-27 07:49:07,163 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-08-27 07:49:07,163 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-08-27 07:49:07,163 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-08-27 07:49:07,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2021-08-27 07:49:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2021-08-27 07:49:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2021-08-27 07:49:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2021-08-27 07:49:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2021-08-27 07:49:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2021-08-27 07:49:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2021-08-27 07:49:07,164 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-08-27 07:49:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:49:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:49:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:49:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:49:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-08-27 07:49:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 07:49:07,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-08-27 07:49:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2021-08-27 07:49:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2021-08-27 07:49:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2021-08-27 07:49:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2021-08-27 07:49:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2021-08-27 07:49:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2021-08-27 07:49:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-08-27 07:49:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2021-08-27 07:49:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2021-08-27 07:49:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2021-08-27 07:49:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2021-08-27 07:49:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-08-27 07:49:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-08-27 07:49:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-08-27 07:49:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2021-08-27 07:49:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2021-08-27 07:49:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2021-08-27 07:49:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2021-08-27 07:49:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2021-08-27 07:49:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2021-08-27 07:49:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2021-08-27 07:49:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-08-27 07:49:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-08-27 07:49:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-08-27 07:49:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2021-08-27 07:49:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-08-27 07:49:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:49:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-08-27 07:49:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:49:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:49:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:49:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:49:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:49:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:49:07,447 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,472 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:49:07,473 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:49:07,483 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,490 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:49:07,490 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:49:07,493 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,589 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-08-27 07:49:07,589 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-08-27 07:49:07,591 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,630 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-08-27 07:49:07,630 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-08-27 07:49:07,638 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,655 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-08-27 07:49:07,656 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-08-27 07:49:07,720 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,726 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:49:07,726 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:49:07,727 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,732 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:49:07,732 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:49:07,734 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,739 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:49:07,739 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:49:07,771 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,790 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2021-08-27 07:49:07,790 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2021-08-27 07:49:07,793 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,883 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2021-08-27 07:49:07,883 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2021-08-27 07:49:07,919 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,925 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:49:07,925 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:49:07,926 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,935 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:49:07,936 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:49:07,936 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:49:07,939 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:49:07,939 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:49:07,959 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:49:07,959 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-27 07:49:07,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:49:07 BoogieIcfgContainer [2021-08-27 07:49:07,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:49:07,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:49:07,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:49:07,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:49:07,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:49:06" (1/3) ... [2021-08-27 07:49:07,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0f24bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:49:07, skipping insertion in model container [2021-08-27 07:49:07,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:49:07" (2/3) ... [2021-08-27 07:49:07,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0f24bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:49:07, skipping insertion in model container [2021-08-27 07:49:07,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:49:07" (3/3) ... [2021-08-27 07:49:07,970 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2021-08-27 07:49:07,974 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:49:07,974 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-27 07:49:08,013 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:49:08,021 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:49:08,023 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-27 07:49:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 390 states, 288 states have (on average 1.4722222222222223) internal successors, (424), 315 states have internal predecessors, (424), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) [2021-08-27 07:49:08,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 07:49:08,052 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:08,053 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:08,054 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:08,058 INFO L82 PathProgramCache]: Analyzing trace with hash 495257184, now seen corresponding path program 1 times [2021-08-27 07:49:08,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:08,071 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059507297] [2021-08-27 07:49:08,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:08,072 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:08,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:08,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:08,437 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:49:08,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:08,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059507297] [2021-08-27 07:49:08,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059507297] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:08,439 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:08,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:49:08,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400664275] [2021-08-27 07:49:08,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:49:08,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:08,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:49:08,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:49:08,454 INFO L87 Difference]: Start difference. First operand has 390 states, 288 states have (on average 1.4722222222222223) internal successors, (424), 315 states have internal predecessors, (424), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:49:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:09,202 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions. [2021-08-27 07:49:09,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:49:09,205 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:49:09,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:09,214 INFO L225 Difference]: With dead ends: 429 [2021-08-27 07:49:09,214 INFO L226 Difference]: Without dead ends: 422 [2021-08-27 07:49:09,215 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 127.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:49:09,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-08-27 07:49:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2021-08-27 07:49:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.4326241134751774) internal successors, (404), 306 states have internal predecessors, (404), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2021-08-27 07:49:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 524 transitions. [2021-08-27 07:49:09,268 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 524 transitions. Word has length 15 [2021-08-27 07:49:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:09,268 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 524 transitions. [2021-08-27 07:49:09,268 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:49:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 524 transitions. [2021-08-27 07:49:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 07:49:09,269 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:09,269 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:49:09,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:49:09,269 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:09,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:09,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1971419500, now seen corresponding path program 1 times [2021-08-27 07:49:09,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:09,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379682748] [2021-08-27 07:49:09,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:09,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:09,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:09,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:09,473 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:49:09,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:09,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379682748] [2021-08-27 07:49:09,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379682748] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:09,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:09,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 07:49:09,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109176461] [2021-08-27 07:49:09,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 07:49:09,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:09,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 07:49:09,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:49:09,477 INFO L87 Difference]: Start difference. First operand 380 states and 524 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 07:49:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:10,490 INFO L93 Difference]: Finished difference Result 422 states and 586 transitions. [2021-08-27 07:49:10,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 07:49:10,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-08-27 07:49:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:10,497 INFO L225 Difference]: With dead ends: 422 [2021-08-27 07:49:10,497 INFO L226 Difference]: Without dead ends: 422 [2021-08-27 07:49:10,498 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 101.8ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:49:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-08-27 07:49:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2021-08-27 07:49:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.429078014184397) internal successors, (403), 306 states have internal predecessors, (403), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2021-08-27 07:49:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2021-08-27 07:49:10,526 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2021-08-27 07:49:10,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:10,526 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2021-08-27 07:49:10,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 07:49:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2021-08-27 07:49:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:49:10,527 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:10,527 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:49:10,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:49:10,527 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:10,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash 809317868, now seen corresponding path program 1 times [2021-08-27 07:49:10,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:10,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139237756] [2021-08-27 07:49:10,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:10,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:10,703 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:49:10,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:10,703 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139237756] [2021-08-27 07:49:10,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139237756] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:10,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:10,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:49:10,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071781107] [2021-08-27 07:49:10,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:49:10,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:10,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:49:10,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:49:10,705 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:49:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:12,020 INFO L93 Difference]: Finished difference Result 585 states and 798 transitions. [2021-08-27 07:49:12,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:49:12,023 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:49:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:12,025 INFO L225 Difference]: With dead ends: 585 [2021-08-27 07:49:12,025 INFO L226 Difference]: Without dead ends: 584 [2021-08-27 07:49:12,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 185.3ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:12,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-08-27 07:49:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2021-08-27 07:49:12,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 405 states have (on average 1.3530864197530865) internal successors, (548), 410 states have internal predecessors, (548), 78 states have call successors, (78), 41 states have call predecessors, (78), 41 states have return successors, (90), 75 states have call predecessors, (90), 66 states have call successors, (90) [2021-08-27 07:49:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2021-08-27 07:49:12,039 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2021-08-27 07:49:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:12,040 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2021-08-27 07:49:12,040 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:49:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2021-08-27 07:49:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:49:12,041 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:12,041 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:49:12,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:49:12,041 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:12,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:12,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1577074200, now seen corresponding path program 1 times [2021-08-27 07:49:12,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:12,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815985516] [2021-08-27 07:49:12,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:12,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:12,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:12,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:49:12,226 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:12,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815985516] [2021-08-27 07:49:12,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815985516] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:12,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:12,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:49:12,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062199958] [2021-08-27 07:49:12,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:49:12,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:12,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:49:12,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:49:12,228 INFO L87 Difference]: Start difference. First operand 525 states and 716 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:49:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:13,026 INFO L93 Difference]: Finished difference Result 676 states and 906 transitions. [2021-08-27 07:49:13,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:49:13,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2021-08-27 07:49:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:13,029 INFO L225 Difference]: With dead ends: 676 [2021-08-27 07:49:13,029 INFO L226 Difference]: Without dead ends: 676 [2021-08-27 07:49:13,030 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 213.0ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-08-27 07:49:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2021-08-27 07:49:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 450 states have (on average 1.3488888888888888) internal successors, (607), 463 states have internal predecessors, (607), 82 states have call successors, (82), 46 states have call predecessors, (82), 50 states have return successors, (101), 78 states have call predecessors, (101), 72 states have call successors, (101) [2021-08-27 07:49:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2021-08-27 07:49:13,044 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2021-08-27 07:49:13,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:13,044 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2021-08-27 07:49:13,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:49:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2021-08-27 07:49:13,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-08-27 07:49:13,045 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:13,045 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:13,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:49:13,046 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:13,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:13,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1576156776, now seen corresponding path program 1 times [2021-08-27 07:49:13,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:13,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966666374] [2021-08-27 07:49:13,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:13,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,200 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:49:13,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:13,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966666374] [2021-08-27 07:49:13,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966666374] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:13,200 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:13,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:49:13,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332556550] [2021-08-27 07:49:13,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:49:13,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:13,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:49:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:49:13,202 INFO L87 Difference]: Start difference. First operand 583 states and 790 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:49:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:14,623 INFO L93 Difference]: Finished difference Result 819 states and 1102 transitions. [2021-08-27 07:49:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:49:14,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2021-08-27 07:49:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:14,627 INFO L225 Difference]: With dead ends: 819 [2021-08-27 07:49:14,629 INFO L226 Difference]: Without dead ends: 819 [2021-08-27 07:49:14,630 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 204.4ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:14,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-08-27 07:49:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2021-08-27 07:49:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 606 states have (on average 1.33993399339934) internal successors, (812), 616 states have internal predecessors, (812), 99 states have call successors, (99), 61 states have call predecessors, (99), 65 states have return successors, (136), 97 states have call predecessors, (136), 91 states have call successors, (136) [2021-08-27 07:49:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2021-08-27 07:49:14,655 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2021-08-27 07:49:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:14,656 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2021-08-27 07:49:14,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:49:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2021-08-27 07:49:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 07:49:14,661 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:14,661 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:14,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:49:14,661 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:14,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1228281964, now seen corresponding path program 1 times [2021-08-27 07:49:14,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:14,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690212600] [2021-08-27 07:49:14,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:14,662 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,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:49:14,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:14,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690212600] [2021-08-27 07:49:14,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690212600] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:14,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:14,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:49:14,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141992341] [2021-08-27 07:49:14,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:49:14,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:14,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:49:14,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:14,855 INFO L87 Difference]: Start difference. First operand 771 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:15,738 INFO L93 Difference]: Finished difference Result 860 states and 1157 transitions. [2021-08-27 07:49:15,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:49:15,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2021-08-27 07:49:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:15,743 INFO L225 Difference]: With dead ends: 860 [2021-08-27 07:49:15,744 INFO L226 Difference]: Without dead ends: 860 [2021-08-27 07:49:15,744 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 188.0ms TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2021-08-27 07:49:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2021-08-27 07:49:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 636 states have (on average 1.3333333333333333) internal successors, (848), 648 states have internal predecessors, (848), 99 states have call successors, (99), 61 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-08-27 07:49:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2021-08-27 07:49:15,759 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38 [2021-08-27 07:49:15,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:15,759 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2021-08-27 07:49:15,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2021-08-27 07:49:15,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 07:49:15,760 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:15,760 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:15,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 07:49:15,761 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:15,761 INFO L82 PathProgramCache]: Analyzing trace with hash 452689020, now seen corresponding path program 1 times [2021-08-27 07:49:15,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:15,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292000891] [2021-08-27 07:49:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:15,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,928 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:49:15,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:15,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292000891] [2021-08-27 07:49:15,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292000891] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:15,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:15,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:49:15,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775639229] [2021-08-27 07:49:15,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:49:15,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:15,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:49:15,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:49:15,930 INFO L87 Difference]: Start difference. First operand 808 states and 1090 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:49:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:16,756 INFO L93 Difference]: Finished difference Result 839 states and 1128 transitions. [2021-08-27 07:49:16,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:49:16,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2021-08-27 07:49:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:16,759 INFO L225 Difference]: With dead ends: 839 [2021-08-27 07:49:16,759 INFO L226 Difference]: Without dead ends: 839 [2021-08-27 07:49:16,759 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 157.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:49:16,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-08-27 07:49:16,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2021-08-27 07:49:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3323029366306027) internal successors, (862), 658 states have internal predecessors, (862), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-08-27 07:49:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2021-08-27 07:49:16,775 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2021-08-27 07:49:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:16,775 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2021-08-27 07:49:16,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:49:16,775 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2021-08-27 07:49:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 07:49:16,777 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:16,777 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:49:16,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 07:49:16,777 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:16,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:16,777 INFO L82 PathProgramCache]: Analyzing trace with hash -126316899, now seen corresponding path program 1 times [2021-08-27 07:49:16,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:16,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047259115] [2021-08-27 07:49:16,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:16,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:17,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:17,054 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:49:17,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:17,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047259115] [2021-08-27 07:49:17,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047259115] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:17,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:17,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:17,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432722421] [2021-08-27 07:49:17,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:17,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:17,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:17,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:17,056 INFO L87 Difference]: Start difference. First operand 819 states and 1104 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:49:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:18,848 INFO L93 Difference]: Finished difference Result 871 states and 1170 transitions. [2021-08-27 07:49:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:18,849 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:49:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:18,851 INFO L225 Difference]: With dead ends: 871 [2021-08-27 07:49:18,852 INFO L226 Difference]: Without dead ends: 871 [2021-08-27 07:49:18,852 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 554.4ms TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:49:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-08-27 07:49:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2021-08-27 07:49:18,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.330757341576507) internal successors, (861), 658 states have internal predecessors, (861), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-08-27 07:49:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2021-08-27 07:49:18,867 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 39 [2021-08-27 07:49:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:18,868 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2021-08-27 07:49:18,868 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:49:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2021-08-27 07:49:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 07:49:18,870 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:18,870 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:49:18,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:49:18,871 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:18,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:18,871 INFO L82 PathProgramCache]: Analyzing trace with hash -481477895, now seen corresponding path program 1 times [2021-08-27 07:49:18,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:18,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114463600] [2021-08-27 07:49:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:18,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:18,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,133 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:49:19,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:19,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114463600] [2021-08-27 07:49:19,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114463600] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:19,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:19,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:19,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939572503] [2021-08-27 07:49:19,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:19,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:19,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:19,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:19,136 INFO L87 Difference]: Start difference. First operand 819 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:49:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:20,851 INFO L93 Difference]: Finished difference Result 871 states and 1169 transitions. [2021-08-27 07:49:20,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:20,852 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:49:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:20,855 INFO L225 Difference]: With dead ends: 871 [2021-08-27 07:49:20,855 INFO L226 Difference]: Without dead ends: 871 [2021-08-27 07:49:20,855 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 581.1ms TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:49:20,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-08-27 07:49:20,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2021-08-27 07:49:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3292117465224111) internal successors, (860), 658 states have internal predecessors, (860), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-08-27 07:49:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2021-08-27 07:49:20,873 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 40 [2021-08-27 07:49:20,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:20,874 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2021-08-27 07:49:20,874 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:49:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2021-08-27 07:49:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-08-27 07:49:20,875 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:20,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 07:49:20,875 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:20,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:20,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1957366842, now seen corresponding path program 1 times [2021-08-27 07:49:20,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:20,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389738720] [2021-08-27 07:49:20,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:20,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:20,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:21,089 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:49:21,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:21,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389738720] [2021-08-27 07:49:21,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389738720] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:21,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:21,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:21,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831729472] [2021-08-27 07:49:21,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:21,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:21,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:21,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:21,091 INFO L87 Difference]: Start difference. First operand 819 states and 1102 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:22,442 INFO L93 Difference]: Finished difference Result 879 states and 1177 transitions. [2021-08-27 07:49:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2021-08-27 07:49:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:22,446 INFO L225 Difference]: With dead ends: 879 [2021-08-27 07:49:22,446 INFO L226 Difference]: Without dead ends: 867 [2021-08-27 07:49:22,446 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 179.3ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2021-08-27 07:49:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2021-08-27 07:49:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 646 states have (on average 1.328173374613003) internal successors, (858), 657 states have internal predecessors, (858), 98 states have call successors, (98), 62 states have call predecessors, (98), 72 states have return successors, (142), 99 states have call predecessors, (142), 90 states have call successors, (142) [2021-08-27 07:49:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2021-08-27 07:49:22,458 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 41 [2021-08-27 07:49:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:22,459 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2021-08-27 07:49:22,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2021-08-27 07:49:22,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-27 07:49:22,460 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:22,460 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:49:22,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 07:49:22,460 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:22,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:22,460 INFO L82 PathProgramCache]: Analyzing trace with hash -884481493, now seen corresponding path program 1 times [2021-08-27 07:49:22,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:22,461 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733038396] [2021-08-27 07:49:22,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:22,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:49:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:22,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:22,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733038396] [2021-08-27 07:49:22,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733038396] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:22,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:22,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:22,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000621155] [2021-08-27 07:49:22,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:22,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:22,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:22,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:22,646 INFO L87 Difference]: Start difference. First operand 817 states and 1098 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:23,946 INFO L93 Difference]: Finished difference Result 877 states and 1173 transitions. [2021-08-27 07:49:23,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:23,947 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:49:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:23,949 INFO L225 Difference]: With dead ends: 877 [2021-08-27 07:49:23,949 INFO L226 Difference]: Without dead ends: 860 [2021-08-27 07:49:23,950 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 142.4ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2021-08-27 07:49:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2021-08-27 07:49:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 642 states have (on average 1.3286604361370717) internal successors, (853), 653 states have internal predecessors, (853), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2021-08-27 07:49:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2021-08-27 07:49:23,964 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 42 [2021-08-27 07:49:23,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:23,964 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2021-08-27 07:49:23,964 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:49:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2021-08-27 07:49:23,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-27 07:49:23,965 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:23,965 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:49:23,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:49:23,966 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:23,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:23,966 INFO L82 PathProgramCache]: Analyzing trace with hash -586304541, now seen corresponding path program 1 times [2021-08-27 07:49:23,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:23,966 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417974526] [2021-08-27 07:49:23,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:23,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,126 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:49:24,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:24,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417974526] [2021-08-27 07:49:24,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417974526] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:24,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:24,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:49:24,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387947627] [2021-08-27 07:49:24,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:49:24,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:24,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:49:24,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:24,130 INFO L87 Difference]: Start difference. First operand 810 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:49:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:25,170 INFO L93 Difference]: Finished difference Result 835 states and 1118 transitions. [2021-08-27 07:49:25,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:49:25,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2021-08-27 07:49:25,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:25,173 INFO L225 Difference]: With dead ends: 835 [2021-08-27 07:49:25,173 INFO L226 Difference]: Without dead ends: 835 [2021-08-27 07:49:25,174 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 280.2ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2021-08-27 07:49:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2021-08-27 07:49:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 644 states have (on average 1.3276397515527951) internal successors, (855), 655 states have internal predecessors, (855), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2021-08-27 07:49:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2021-08-27 07:49:25,186 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2021-08-27 07:49:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:25,186 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2021-08-27 07:49:25,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:49:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2021-08-27 07:49:25,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-08-27 07:49:25,187 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:25,187 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:25,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:49:25,188 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:25,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:25,188 INFO L82 PathProgramCache]: Analyzing trace with hash -211337402, now seen corresponding path program 1 times [2021-08-27 07:49:25,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:25,188 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574376630] [2021-08-27 07:49:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:25,188 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-08-27 07:49:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:25,343 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:49:25,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:25,344 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574376630] [2021-08-27 07:49:25,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574376630] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:25,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:25,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:49:25,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452012542] [2021-08-27 07:49:25,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:49:25,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:25,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:49:25,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:49:25,345 INFO L87 Difference]: Start difference. First operand 812 states and 1091 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:49:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:26,750 INFO L93 Difference]: Finished difference Result 840 states and 1124 transitions. [2021-08-27 07:49:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:49:26,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2021-08-27 07:49:26,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:26,752 INFO L225 Difference]: With dead ends: 840 [2021-08-27 07:49:26,752 INFO L226 Difference]: Without dead ends: 840 [2021-08-27 07:49:26,753 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 180.4ms TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2021-08-27 07:49:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2021-08-27 07:49:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2021-08-27 07:49:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2021-08-27 07:49:26,764 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2021-08-27 07:49:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:26,764 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2021-08-27 07:49:26,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:49:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2021-08-27 07:49:26,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-08-27 07:49:26,765 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:26,765 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:26,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 07:49:26,765 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:26,766 INFO L82 PathProgramCache]: Analyzing trace with hash 114455309, now seen corresponding path program 1 times [2021-08-27 07:49:26,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:26,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719724134] [2021-08-27 07:49:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:26,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,923 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:49:26,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:26,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719724134] [2021-08-27 07:49:26,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719724134] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:26,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:26,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:49:26,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974964121] [2021-08-27 07:49:26,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:49:26,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:26,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:49:26,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:26,925 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:49:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:27,963 INFO L93 Difference]: Finished difference Result 838 states and 1121 transitions. [2021-08-27 07:49:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:49:27,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-08-27 07:49:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:27,966 INFO L225 Difference]: With dead ends: 838 [2021-08-27 07:49:27,966 INFO L226 Difference]: Without dead ends: 838 [2021-08-27 07:49:27,966 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 308.8ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:27,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-08-27 07:49:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2021-08-27 07:49:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2021-08-27 07:49:27,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2021-08-27 07:49:27,978 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2021-08-27 07:49:27,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:27,978 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2021-08-27 07:49:27,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:49:27,979 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2021-08-27 07:49:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 07:49:27,980 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:27,980 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:27,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 07:49:27,980 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:27,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1730277995, now seen corresponding path program 1 times [2021-08-27 07:49:27,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:27,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033680779] [2021-08-27 07:49:27,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:27,981 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,221 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:49:28,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:28,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033680779] [2021-08-27 07:49:28,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033680779] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:28,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:28,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:28,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972716972] [2021-08-27 07:49:28,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:28,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:28,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:28,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:28,222 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:29,219 INFO L93 Difference]: Finished difference Result 858 states and 1146 transitions. [2021-08-27 07:49:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:49:29,221 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2021-08-27 07:49:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:29,223 INFO L225 Difference]: With dead ends: 858 [2021-08-27 07:49:29,223 INFO L226 Difference]: Without dead ends: 843 [2021-08-27 07:49:29,223 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 131.8ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-08-27 07:49:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2021-08-27 07:49:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 646 states have (on average 1.325077399380805) internal successors, (856), 657 states have internal predecessors, (856), 95 states have call successors, (95), 61 states have call predecessors, (95), 72 states have return successors, (141), 97 states have call predecessors, (141), 87 states have call successors, (141) [2021-08-27 07:49:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2021-08-27 07:49:29,234 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2021-08-27 07:49:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:29,234 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2021-08-27 07:49:29,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2021-08-27 07:49:29,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 07:49:29,235 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:29,235 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:49:29,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 07:49:29,235 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:29,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:29,235 INFO L82 PathProgramCache]: Analyzing trace with hash -645503113, now seen corresponding path program 1 times [2021-08-27 07:49:29,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:29,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57942508] [2021-08-27 07:49:29,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:29,236 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:29,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:29,410 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:49:29,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:29,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57942508] [2021-08-27 07:49:29,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57942508] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:29,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:29,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:49:29,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443380427] [2021-08-27 07:49:29,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:49:29,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:29,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:49:29,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:29,414 INFO L87 Difference]: Start difference. First operand 814 states and 1092 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:30,461 INFO L93 Difference]: Finished difference Result 855 states and 1136 transitions. [2021-08-27 07:49:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:49:30,461 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:49:30,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:30,463 INFO L225 Difference]: With dead ends: 855 [2021-08-27 07:49:30,464 INFO L226 Difference]: Without dead ends: 804 [2021-08-27 07:49:30,464 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 187.2ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:49:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2021-08-27 07:49:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2021-08-27 07:49:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 628 states have internal predecessors, (816), 93 states have call successors, (93), 60 states have call predecessors, (93), 65 states have return successors, (132), 88 states have call predecessors, (132), 85 states have call successors, (132) [2021-08-27 07:49:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2021-08-27 07:49:30,475 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2021-08-27 07:49:30,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:30,476 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2021-08-27 07:49:30,476 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:49:30,476 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2021-08-27 07:49:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 07:49:30,477 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:30,477 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:49:30,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 07:49:30,477 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:30,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:30,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1178138073, now seen corresponding path program 1 times [2021-08-27 07:49:30,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:30,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805585884] [2021-08-27 07:49:30,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:30,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-08-27 07:49:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,611 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:49:30,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:30,612 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805585884] [2021-08-27 07:49:30,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805585884] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:30,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:30,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:49:30,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005609363] [2021-08-27 07:49:30,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:49:30,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:30,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:49:30,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:49:30,613 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:49:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:32,050 INFO L93 Difference]: Finished difference Result 1131 states and 1528 transitions. [2021-08-27 07:49:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:49:32,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2021-08-27 07:49:32,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:32,054 INFO L225 Difference]: With dead ends: 1131 [2021-08-27 07:49:32,054 INFO L226 Difference]: Without dead ends: 1131 [2021-08-27 07:49:32,054 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 206.8ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2021-08-27 07:49:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2021-08-27 07:49:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 707 states have (on average 1.3295615275813295) internal successors, (940), 721 states have internal predecessors, (940), 103 states have call successors, (103), 70 states have call predecessors, (103), 77 states have return successors, (152), 98 states have call predecessors, (152), 95 states have call successors, (152) [2021-08-27 07:49:32,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2021-08-27 07:49:32,068 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2021-08-27 07:49:32,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:32,068 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2021-08-27 07:49:32,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-08-27 07:49:32,069 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2021-08-27 07:49:32,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 07:49:32,070 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:32,070 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:49:32,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 07:49:32,070 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:32,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:32,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1451715450, now seen corresponding path program 1 times [2021-08-27 07:49:32,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:32,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033709143] [2021-08-27 07:49:32,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:32,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:49:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,242 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:49:32,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:32,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033709143] [2021-08-27 07:49:32,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033709143] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:32,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:32,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:32,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313241456] [2021-08-27 07:49:32,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:32,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:32,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:32,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:32,245 INFO L87 Difference]: Start difference. First operand 888 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:33,091 INFO L93 Difference]: Finished difference Result 930 states and 1245 transitions. [2021-08-27 07:49:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:49:33,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2021-08-27 07:49:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:33,093 INFO L225 Difference]: With dead ends: 930 [2021-08-27 07:49:33,093 INFO L226 Difference]: Without dead ends: 915 [2021-08-27 07:49:33,094 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 121.0ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:33,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-08-27 07:49:33,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2021-08-27 07:49:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 706 states have (on average 1.3286118980169972) internal successors, (938), 720 states have internal predecessors, (938), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2021-08-27 07:49:33,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2021-08-27 07:49:33,105 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2021-08-27 07:49:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:33,106 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2021-08-27 07:49:33,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2021-08-27 07:49:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 07:49:33,107 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:33,107 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:49:33,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:49:33,107 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:33,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1924484230, now seen corresponding path program 1 times [2021-08-27 07:49:33,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:33,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769192733] [2021-08-27 07:49:33,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:33,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-08-27 07:49:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,321 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:49:33,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:33,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769192733] [2021-08-27 07:49:33,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769192733] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:33,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:33,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:33,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98761679] [2021-08-27 07:49:33,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:33,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:33,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:33,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:33,323 INFO L87 Difference]: Start difference. First operand 886 states and 1191 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 07:49:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:35,036 INFO L93 Difference]: Finished difference Result 936 states and 1237 transitions. [2021-08-27 07:49:35,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:35,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2021-08-27 07:49:35,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:35,038 INFO L225 Difference]: With dead ends: 936 [2021-08-27 07:49:35,038 INFO L226 Difference]: Without dead ends: 936 [2021-08-27 07:49:35,039 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 521.0ms TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:49:35,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2021-08-27 07:49:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2021-08-27 07:49:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 697 states have (on average 1.3156384505021521) internal successors, (917), 711 states have internal predecessors, (917), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2021-08-27 07:49:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2021-08-27 07:49:35,054 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2021-08-27 07:49:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:35,054 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2021-08-27 07:49:35,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-08-27 07:49:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2021-08-27 07:49:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:49:35,055 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:35,055 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:49:35,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 07:49:35,056 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:35,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:35,056 INFO L82 PathProgramCache]: Analyzing trace with hash -398461437, now seen corresponding path program 1 times [2021-08-27 07:49:35,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:35,056 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598969508] [2021-08-27 07:49:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:35,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:35,279 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:49:35,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:35,280 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598969508] [2021-08-27 07:49:35,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598969508] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:35,280 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:35,280 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:35,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351896783] [2021-08-27 07:49:35,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:35,281 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:35,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:35,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:35,281 INFO L87 Difference]: Start difference. First operand 877 states and 1170 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:49:37,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:37,525 INFO L93 Difference]: Finished difference Result 1075 states and 1432 transitions. [2021-08-27 07:49:37,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:49:37,526 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2021-08-27 07:49:37,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:37,528 INFO L225 Difference]: With dead ends: 1075 [2021-08-27 07:49:37,529 INFO L226 Difference]: Without dead ends: 1075 [2021-08-27 07:49:37,529 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 745.5ms TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2021-08-27 07:49:37,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2021-08-27 07:49:37,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2021-08-27 07:49:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3090418353576248) internal successors, (970), 757 states have internal predecessors, (970), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2021-08-27 07:49:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2021-08-27 07:49:37,540 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2021-08-27 07:49:37,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:37,541 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2021-08-27 07:49:37,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:49:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2021-08-27 07:49:37,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:49:37,542 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:37,542 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:49:37,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 07:49:37,542 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:37,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:37,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1946804572, now seen corresponding path program 1 times [2021-08-27 07:49:37,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:37,543 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413775966] [2021-08-27 07:49:37,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:37,543 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:37,731 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:49:37,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:37,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413775966] [2021-08-27 07:49:37,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413775966] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:37,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:37,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:49:37,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647906940] [2021-08-27 07:49:37,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:49:37,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:37,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:49:37,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:49:37,733 INFO L87 Difference]: Start difference. First operand 932 states and 1243 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:49:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:38,805 INFO L93 Difference]: Finished difference Result 976 states and 1293 transitions. [2021-08-27 07:49:38,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:38,806 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:49:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:38,808 INFO L225 Difference]: With dead ends: 976 [2021-08-27 07:49:38,808 INFO L226 Difference]: Without dead ends: 959 [2021-08-27 07:49:38,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 243.1ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:38,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-08-27 07:49:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2021-08-27 07:49:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.2928475033738192) internal successors, (958), 757 states have internal predecessors, (958), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2021-08-27 07:49:38,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2021-08-27 07:49:38,821 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2021-08-27 07:49:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:38,821 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2021-08-27 07:49:38,821 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:49:38,822 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2021-08-27 07:49:38,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:49:38,823 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:38,823 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:38,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 07:49:38,824 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:38,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:38,824 INFO L82 PathProgramCache]: Analyzing trace with hash 764937325, now seen corresponding path program 1 times [2021-08-27 07:49:38,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:38,824 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291132252] [2021-08-27 07:49:38,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:38,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-08-27 07:49:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:38,975 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:49:38,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:38,975 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291132252] [2021-08-27 07:49:38,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291132252] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:38,975 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:38,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:49:38,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084301358] [2021-08-27 07:49:38,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:49:38,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:38,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:49:38,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:38,976 INFO L87 Difference]: Start difference. First operand 932 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:49:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:39,943 INFO L93 Difference]: Finished difference Result 685 states and 869 transitions. [2021-08-27 07:49:39,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:39,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2021-08-27 07:49:39,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:39,947 INFO L225 Difference]: With dead ends: 685 [2021-08-27 07:49:39,947 INFO L226 Difference]: Without dead ends: 685 [2021-08-27 07:49:39,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 343.7ms TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-08-27 07:49:39,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2021-08-27 07:49:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 498 states have (on average 1.2751004016064258) internal successors, (635), 509 states have internal predecessors, (635), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 68 states have call predecessors, (85), 63 states have call successors, (85) [2021-08-27 07:49:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2021-08-27 07:49:39,955 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2021-08-27 07:49:39,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:39,955 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2021-08-27 07:49:39,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:49:39,955 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2021-08-27 07:49:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:49:39,956 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:39,956 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:49:39,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 07:49:39,957 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:39,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:39,957 INFO L82 PathProgramCache]: Analyzing trace with hash 855475542, now seen corresponding path program 1 times [2021-08-27 07:49:39,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:39,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373872568] [2021-08-27 07:49:39,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:39,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:40,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:40,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:40,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:40,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:40,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:40,146 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:49:40,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:40,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373872568] [2021-08-27 07:49:40,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373872568] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:40,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:40,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:49:40,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871774386] [2021-08-27 07:49:40,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:49:40,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:40,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:49:40,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:49:40,148 INFO L87 Difference]: Start difference. First operand 623 states and 791 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:41,685 INFO L93 Difference]: Finished difference Result 659 states and 834 transitions. [2021-08-27 07:49:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:41,689 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2021-08-27 07:49:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:41,690 INFO L225 Difference]: With dead ends: 659 [2021-08-27 07:49:41,690 INFO L226 Difference]: Without dead ends: 659 [2021-08-27 07:49:41,691 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 381.1ms TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:49:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-08-27 07:49:41,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 624. [2021-08-27 07:49:41,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 499 states have (on average 1.2745490981963927) internal successors, (636), 509 states have internal predecessors, (636), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2021-08-27 07:49:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 792 transitions. [2021-08-27 07:49:41,699 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 792 transitions. Word has length 51 [2021-08-27 07:49:41,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:41,699 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 792 transitions. [2021-08-27 07:49:41,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:41,700 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 792 transitions. [2021-08-27 07:49:41,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:49:41,701 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:41,701 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:49:41,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 07:49:41,701 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:41,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:41,702 INFO L82 PathProgramCache]: Analyzing trace with hash -69609850, now seen corresponding path program 1 times [2021-08-27 07:49:41,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:41,702 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405045679] [2021-08-27 07:49:41,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:41,702 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,902 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:49:41,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:41,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405045679] [2021-08-27 07:49:41,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405045679] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:41,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:41,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:49:41,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458056474] [2021-08-27 07:49:41,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:49:41,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:41,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:49:41,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:49:41,903 INFO L87 Difference]: Start difference. First operand 624 states and 792 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:49:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:42,949 INFO L93 Difference]: Finished difference Result 673 states and 848 transitions. [2021-08-27 07:49:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:42,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2021-08-27 07:49:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:42,952 INFO L225 Difference]: With dead ends: 673 [2021-08-27 07:49:42,952 INFO L226 Difference]: Without dead ends: 648 [2021-08-27 07:49:42,953 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 255.5ms TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:49:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2021-08-27 07:49:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 616. [2021-08-27 07:49:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 491 states have (on average 1.2688391038696538) internal successors, (623), 501 states have internal predecessors, (623), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2021-08-27 07:49:42,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2021-08-27 07:49:42,960 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2021-08-27 07:49:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:42,961 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2021-08-27 07:49:42,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:49:42,961 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2021-08-27 07:49:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:49:42,962 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:42,962 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:49:42,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 07:49:42,962 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:42,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:42,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1297164280, now seen corresponding path program 1 times [2021-08-27 07:49:42,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:42,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108843369] [2021-08-27 07:49:42,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:42,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:43,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:43,135 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108843369] [2021-08-27 07:49:43,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108843369] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:43,135 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:43,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:49:43,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832353704] [2021-08-27 07:49:43,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:49:43,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:43,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:49:43,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:43,137 INFO L87 Difference]: Start difference. First operand 616 states and 779 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:44,180 INFO L93 Difference]: Finished difference Result 850 states and 1092 transitions. [2021-08-27 07:49:44,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:49:44,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-08-27 07:49:44,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:44,182 INFO L225 Difference]: With dead ends: 850 [2021-08-27 07:49:44,182 INFO L226 Difference]: Without dead ends: 832 [2021-08-27 07:49:44,183 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 199.6ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:44,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-08-27 07:49:44,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 659. [2021-08-27 07:49:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 527 states have (on average 1.2580645161290323) internal successors, (663), 530 states have internal predecessors, (663), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2021-08-27 07:49:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 833 transitions. [2021-08-27 07:49:44,190 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 833 transitions. Word has length 52 [2021-08-27 07:49:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:44,190 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 833 transitions. [2021-08-27 07:49:44,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 833 transitions. [2021-08-27 07:49:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:49:44,191 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:44,192 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:49:44,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 07:49:44,192 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:44,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:44,192 INFO L82 PathProgramCache]: Analyzing trace with hash 147904264, now seen corresponding path program 1 times [2021-08-27 07:49:44,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:44,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924316511] [2021-08-27 07:49:44,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:44,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:44,363 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:49:44,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:44,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924316511] [2021-08-27 07:49:44,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924316511] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:44,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:44,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:49:44,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641697757] [2021-08-27 07:49:44,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:49:44,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:44,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:49:44,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:44,365 INFO L87 Difference]: Start difference. First operand 659 states and 833 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:45,208 INFO L93 Difference]: Finished difference Result 719 states and 923 transitions. [2021-08-27 07:49:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:49:45,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-08-27 07:49:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:45,220 INFO L225 Difference]: With dead ends: 719 [2021-08-27 07:49:45,220 INFO L226 Difference]: Without dead ends: 714 [2021-08-27 07:49:45,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 181.6ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:49:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2021-08-27 07:49:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 666. [2021-08-27 07:49:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 534 states have (on average 1.2602996254681649) internal successors, (673), 537 states have internal predecessors, (673), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2021-08-27 07:49:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 843 transitions. [2021-08-27 07:49:45,227 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 843 transitions. Word has length 52 [2021-08-27 07:49:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:45,228 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 843 transitions. [2021-08-27 07:49:45,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 843 transitions. [2021-08-27 07:49:45,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:49:45,229 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:45,229 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:49:45,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 07:49:45,229 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:45,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:45,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1440443638, now seen corresponding path program 1 times [2021-08-27 07:49:45,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:45,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192057251] [2021-08-27 07:49:45,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:45,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,458 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:49:45,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:45,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192057251] [2021-08-27 07:49:45,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192057251] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:45,459 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:45,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:45,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611287070] [2021-08-27 07:49:45,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:45,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:45,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:45,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:45,460 INFO L87 Difference]: Start difference. First operand 666 states and 843 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:49:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:46,938 INFO L93 Difference]: Finished difference Result 652 states and 822 transitions. [2021-08-27 07:49:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:49:46,939 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2021-08-27 07:49:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:46,940 INFO L225 Difference]: With dead ends: 652 [2021-08-27 07:49:46,940 INFO L226 Difference]: Without dead ends: 610 [2021-08-27 07:49:46,940 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 566.4ms TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:49:46,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-08-27 07:49:46,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 575. [2021-08-27 07:49:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 455 states have (on average 1.2747252747252746) internal successors, (580), 465 states have internal predecessors, (580), 69 states have call successors, (69), 44 states have call predecessors, (69), 50 states have return successors, (82), 66 states have call predecessors, (82), 61 states have call successors, (82) [2021-08-27 07:49:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2021-08-27 07:49:46,947 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2021-08-27 07:49:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:46,947 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2021-08-27 07:49:46,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:49:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2021-08-27 07:49:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-27 07:49:46,948 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:46,948 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:46,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 07:49:46,949 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:46,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:46,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1105462305, now seen corresponding path program 1 times [2021-08-27 07:49:46,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:46,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30296336] [2021-08-27 07:49:46,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:46,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,133 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:49:47,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:47,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30296336] [2021-08-27 07:49:47,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30296336] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:47,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:47,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:49:47,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527536310] [2021-08-27 07:49:47,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:49:47,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:47,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:49:47,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:47,136 INFO L87 Difference]: Start difference. First operand 575 states and 731 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:48,622 INFO L93 Difference]: Finished difference Result 606 states and 767 transitions. [2021-08-27 07:49:48,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:48,623 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2021-08-27 07:49:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:48,624 INFO L225 Difference]: With dead ends: 606 [2021-08-27 07:49:48,624 INFO L226 Difference]: Without dead ends: 605 [2021-08-27 07:49:48,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 141.0ms TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-08-27 07:49:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 583. [2021-08-27 07:49:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 462 states have (on average 1.2705627705627707) internal successors, (587), 472 states have internal predecessors, (587), 69 states have call successors, (69), 44 states have call predecessors, (69), 51 states have return successors, (83), 67 states have call predecessors, (83), 61 states have call successors, (83) [2021-08-27 07:49:48,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 739 transitions. [2021-08-27 07:49:48,630 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 739 transitions. Word has length 53 [2021-08-27 07:49:48,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:48,631 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 739 transitions. [2021-08-27 07:49:48,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 739 transitions. [2021-08-27 07:49:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-27 07:49:48,632 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:48,632 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:49:48,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-27 07:49:48,632 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:48,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:48,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1105739135, now seen corresponding path program 1 times [2021-08-27 07:49:48,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:48,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492482313] [2021-08-27 07:49:48,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:48,633 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,921 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:49:48,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:48,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492482313] [2021-08-27 07:49:48,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492482313] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:48,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:48,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:49:48,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853742350] [2021-08-27 07:49:48,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:49:48,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:48,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:49:48,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:48,924 INFO L87 Difference]: Start difference. First operand 583 states and 739 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:49,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:49,957 INFO L93 Difference]: Finished difference Result 641 states and 820 transitions. [2021-08-27 07:49:49,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:49,958 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2021-08-27 07:49:49,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:49,960 INFO L225 Difference]: With dead ends: 641 [2021-08-27 07:49:49,960 INFO L226 Difference]: Without dead ends: 629 [2021-08-27 07:49:49,960 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 271.0ms TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:49,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-08-27 07:49:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 589. [2021-08-27 07:49:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 467 states have (on average 1.2676659528907923) internal successors, (592), 478 states have internal predecessors, (592), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (90), 67 states have call predecessors, (90), 61 states have call successors, (90) [2021-08-27 07:49:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2021-08-27 07:49:49,975 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2021-08-27 07:49:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:49,975 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2021-08-27 07:49:49,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2021-08-27 07:49:49,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-27 07:49:49,977 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:49,977 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:49,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 07:49:49,977 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:49,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:49,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1185659497, now seen corresponding path program 1 times [2021-08-27 07:49:49,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:49,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622659836] [2021-08-27 07:49:49,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:49,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:50,164 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:49:50,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:50,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622659836] [2021-08-27 07:49:50,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622659836] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:50,164 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:50,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:50,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119381975] [2021-08-27 07:49:50,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:50,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:50,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:50,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:50,166 INFO L87 Difference]: Start difference. First operand 589 states and 751 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:49:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:52,321 INFO L93 Difference]: Finished difference Result 754 states and 980 transitions. [2021-08-27 07:49:52,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:49:52,321 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2021-08-27 07:49:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:52,323 INFO L225 Difference]: With dead ends: 754 [2021-08-27 07:49:52,323 INFO L226 Difference]: Without dead ends: 740 [2021-08-27 07:49:52,323 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 611.8ms TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:49:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-08-27 07:49:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 573. [2021-08-27 07:49:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 454 states have (on average 1.2731277533039647) internal successors, (578), 464 states have internal predecessors, (578), 68 states have call successors, (68), 44 states have call predecessors, (68), 50 states have return successors, (81), 65 states have call predecessors, (81), 60 states have call successors, (81) [2021-08-27 07:49:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 727 transitions. [2021-08-27 07:49:52,330 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 727 transitions. Word has length 54 [2021-08-27 07:49:52,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:52,330 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 727 transitions. [2021-08-27 07:49:52,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:49:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 727 transitions. [2021-08-27 07:49:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-27 07:49:52,331 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:52,332 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:52,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-27 07:49:52,332 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:52,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:52,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1315437004, now seen corresponding path program 1 times [2021-08-27 07:49:52,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:52,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763203965] [2021-08-27 07:49:52,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:52,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,547 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:49:52,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:52,548 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763203965] [2021-08-27 07:49:52,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763203965] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:52,548 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:52,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:49:52,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033102287] [2021-08-27 07:49:52,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:49:52,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:52,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:49:52,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:52,549 INFO L87 Difference]: Start difference. First operand 573 states and 727 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:49:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:53,705 INFO L93 Difference]: Finished difference Result 605 states and 763 transitions. [2021-08-27 07:49:53,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:53,705 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2021-08-27 07:49:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:53,707 INFO L225 Difference]: With dead ends: 605 [2021-08-27 07:49:53,707 INFO L226 Difference]: Without dead ends: 580 [2021-08-27 07:49:53,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 165.0ms TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-08-27 07:49:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 561. [2021-08-27 07:49:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 445 states have (on average 1.2719101123595506) internal successors, (566), 455 states have internal predecessors, (566), 66 states have call successors, (66), 43 states have call predecessors, (66), 49 states have return successors, (79), 63 states have call predecessors, (79), 58 states have call successors, (79) [2021-08-27 07:49:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2021-08-27 07:49:53,713 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 55 [2021-08-27 07:49:53,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:53,713 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2021-08-27 07:49:53,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:49:53,713 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2021-08-27 07:49:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 07:49:53,714 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:53,714 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] [2021-08-27 07:49:53,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 07:49:53,714 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:53,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:53,715 INFO L82 PathProgramCache]: Analyzing trace with hash -283583224, now seen corresponding path program 1 times [2021-08-27 07:49:53,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:53,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247599341] [2021-08-27 07:49:53,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:53,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-08-27 07:49:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-08-27 07:49:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,870 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:49:53,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:53,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247599341] [2021-08-27 07:49:53,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247599341] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:53,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:53,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:49:53,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650534250] [2021-08-27 07:49:53,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:49:53,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:53,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:49:53,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:49:53,872 INFO L87 Difference]: Start difference. First operand 561 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:49:54,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:54,665 INFO L93 Difference]: Finished difference Result 589 states and 746 transitions. [2021-08-27 07:49:54,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:49:54,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2021-08-27 07:49:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:54,668 INFO L225 Difference]: With dead ends: 589 [2021-08-27 07:49:54,668 INFO L226 Difference]: Without dead ends: 589 [2021-08-27 07:49:54,668 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 196.4ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:54,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-08-27 07:49:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2021-08-27 07:49:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 449 states have (on average 1.265033407572383) internal successors, (568), 460 states have internal predecessors, (568), 66 states have call successors, (66), 43 states have call predecessors, (66), 50 states have return successors, (83), 63 states have call predecessors, (83), 58 states have call successors, (83) [2021-08-27 07:49:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2021-08-27 07:49:54,675 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 61 [2021-08-27 07:49:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:54,676 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2021-08-27 07:49:54,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:49:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2021-08-27 07:49:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-27 07:49:54,677 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:54,677 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:54,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-27 07:49:54,678 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:54,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:54,678 INFO L82 PathProgramCache]: Analyzing trace with hash 178096204, now seen corresponding path program 1 times [2021-08-27 07:49:54,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:54,678 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964732033] [2021-08-27 07:49:54,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:54,679 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:54,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-08-27 07:49:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:54,917 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:49:54,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:54,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964732033] [2021-08-27 07:49:54,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964732033] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:54,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:54,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:54,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983469767] [2021-08-27 07:49:54,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:54,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:54,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:54,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:54,918 INFO L87 Difference]: Start difference. First operand 566 states and 717 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:49:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:55,688 INFO L93 Difference]: Finished difference Result 538 states and 675 transitions. [2021-08-27 07:49:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:49:55,689 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2021-08-27 07:49:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:55,690 INFO L225 Difference]: With dead ends: 538 [2021-08-27 07:49:55,690 INFO L226 Difference]: Without dead ends: 538 [2021-08-27 07:49:55,690 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 135.5ms TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-08-27 07:49:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2021-08-27 07:49:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 402 states have (on average 1.2537313432835822) internal successors, (504), 410 states have internal predecessors, (504), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (72), 59 states have call predecessors, (72), 56 states have call successors, (72) [2021-08-27 07:49:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2021-08-27 07:49:55,696 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2021-08-27 07:49:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:55,696 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2021-08-27 07:49:55,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:49:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2021-08-27 07:49:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 07:49:55,697 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:55,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] [2021-08-27 07:49:55,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-27 07:49:55,697 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:55,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:55,698 INFO L82 PathProgramCache]: Analyzing trace with hash -464089137, now seen corresponding path program 1 times [2021-08-27 07:49:55,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:55,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560692319] [2021-08-27 07:49:55,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:55,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-08-27 07:49:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:55,941 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:49:55,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:55,942 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560692319] [2021-08-27 07:49:55,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560692319] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:55,942 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:55,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:49:55,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514704445] [2021-08-27 07:49:55,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:49:55,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:55,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:49:55,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:55,943 INFO L87 Difference]: Start difference. First operand 511 states and 639 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:49:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:57,501 INFO L93 Difference]: Finished difference Result 542 states and 675 transitions. [2021-08-27 07:49:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:49:57,501 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2021-08-27 07:49:57,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:57,503 INFO L225 Difference]: With dead ends: 542 [2021-08-27 07:49:57,503 INFO L226 Difference]: Without dead ends: 524 [2021-08-27 07:49:57,503 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 259.5ms TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:49:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-08-27 07:49:57,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2021-08-27 07:49:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 399 states have (on average 1.255639097744361) internal successors, (501), 408 states have internal predecessors, (501), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (71), 58 states have call predecessors, (71), 56 states have call successors, (71) [2021-08-27 07:49:57,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2021-08-27 07:49:57,508 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2021-08-27 07:49:57,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:57,508 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2021-08-27 07:49:57,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:49:57,509 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2021-08-27 07:49:57,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-27 07:49:57,509 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:57,509 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:49:57,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-27 07:49:57,510 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:57,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:57,510 INFO L82 PathProgramCache]: Analyzing trace with hash 462485744, now seen corresponding path program 1 times [2021-08-27 07:49:57,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:57,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367015090] [2021-08-27 07:49:57,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:57,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:49:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:49:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:57,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:57,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367015090] [2021-08-27 07:49:57,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367015090] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:57,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:57,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:49:57,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534601096] [2021-08-27 07:49:57,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:49:57,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:57,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:49:57,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:57,715 INFO L87 Difference]: Start difference. First operand 508 states and 635 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:58,748 INFO L93 Difference]: Finished difference Result 535 states and 666 transitions. [2021-08-27 07:49:58,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:49:58,749 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2021-08-27 07:49:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:58,750 INFO L225 Difference]: With dead ends: 535 [2021-08-27 07:49:58,750 INFO L226 Difference]: Without dead ends: 520 [2021-08-27 07:49:58,750 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 158.8ms TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:49:58,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-08-27 07:49:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2021-08-27 07:49:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 396 states have (on average 1.255050505050505) internal successors, (497), 405 states have internal predecessors, (497), 62 states have call successors, (62), 42 states have call predecessors, (62), 45 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2021-08-27 07:49:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2021-08-27 07:49:58,759 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2021-08-27 07:49:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:58,759 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2021-08-27 07:49:58,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:49:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2021-08-27 07:49:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 07:49:58,760 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:58,760 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:58,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-27 07:49:58,761 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash -238724580, now seen corresponding path program 1 times [2021-08-27 07:49:58,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:58,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645129664] [2021-08-27 07:49:58,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:58,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:58,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:58,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:58,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:58,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:49:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:58,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:49:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:58,964 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:49:58,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:58,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645129664] [2021-08-27 07:49:58,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645129664] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:58,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:58,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:58,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690750382] [2021-08-27 07:49:58,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:58,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:58,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:58,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:58,965 INFO L87 Difference]: Start difference. First operand 504 states and 629 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:50:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:00,144 INFO L93 Difference]: Finished difference Result 536 states and 666 transitions. [2021-08-27 07:50:00,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:00,145 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2021-08-27 07:50:00,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:00,146 INFO L225 Difference]: With dead ends: 536 [2021-08-27 07:50:00,147 INFO L226 Difference]: Without dead ends: 515 [2021-08-27 07:50:00,147 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 190.9ms TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:50:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-08-27 07:50:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2021-08-27 07:50:00,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.251908396946565) internal successors, (492), 401 states have internal predecessors, (492), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2021-08-27 07:50:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2021-08-27 07:50:00,152 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2021-08-27 07:50:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:00,153 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2021-08-27 07:50:00,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:50:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2021-08-27 07:50:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-27 07:50:00,154 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:00,154 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:50:00,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-27 07:50:00,154 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash -858312845, now seen corresponding path program 1 times [2021-08-27 07:50:00,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:00,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885897764] [2021-08-27 07:50:00,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:00,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-08-27 07:50:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:00,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:00,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885897764] [2021-08-27 07:50:00,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885897764] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:00,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:00,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:00,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358600462] [2021-08-27 07:50:00,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:00,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:00,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:00,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:00,388 INFO L87 Difference]: Start difference. First operand 499 states and 621 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:50:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:01,763 INFO L93 Difference]: Finished difference Result 521 states and 649 transitions. [2021-08-27 07:50:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:50:01,763 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2021-08-27 07:50:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:01,765 INFO L225 Difference]: With dead ends: 521 [2021-08-27 07:50:01,765 INFO L226 Difference]: Without dead ends: 521 [2021-08-27 07:50:01,766 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 408.2ms TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:50:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-08-27 07:50:01,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2021-08-27 07:50:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.2468193384223918) internal successors, (490), 401 states have internal predecessors, (490), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2021-08-27 07:50:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2021-08-27 07:50:01,772 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2021-08-27 07:50:01,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:01,772 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2021-08-27 07:50:01,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:50:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2021-08-27 07:50:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:50:01,773 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:01,774 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:50:01,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-27 07:50:01,774 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:01,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1201869596, now seen corresponding path program 1 times [2021-08-27 07:50:01,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:01,775 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029152228] [2021-08-27 07:50:01,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:01,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:01,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:01,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:01,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:01,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:50:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:01,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:01,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:01,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:50:01,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:01,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029152228] [2021-08-27 07:50:01,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029152228] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:01,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:01,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:50:01,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172917401] [2021-08-27 07:50:01,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:50:01,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:01,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:50:01,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:50:01,994 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:50:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:03,331 INFO L93 Difference]: Finished difference Result 519 states and 644 transitions. [2021-08-27 07:50:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:50:03,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-08-27 07:50:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:03,334 INFO L225 Difference]: With dead ends: 519 [2021-08-27 07:50:03,334 INFO L226 Difference]: Without dead ends: 519 [2021-08-27 07:50:03,334 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 252.2ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:50:03,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-08-27 07:50:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2021-08-27 07:50:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 396 states have (on average 1.244949494949495) internal successors, (493), 404 states have internal predecessors, (493), 61 states have call successors, (61), 42 states have call predecessors, (61), 45 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69) [2021-08-27 07:50:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2021-08-27 07:50:03,338 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2021-08-27 07:50:03,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:03,339 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2021-08-27 07:50:03,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:50:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2021-08-27 07:50:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:50:03,339 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:03,339 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:50:03,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-27 07:50:03,340 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:03,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:03,340 INFO L82 PathProgramCache]: Analyzing trace with hash -813300133, now seen corresponding path program 1 times [2021-08-27 07:50:03,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:03,340 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669505236] [2021-08-27 07:50:03,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:03,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:03,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:03,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:50:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:03,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:03,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:03,552 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:50:03,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:03,553 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669505236] [2021-08-27 07:50:03,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669505236] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:03,553 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:03,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:03,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076796835] [2021-08-27 07:50:03,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:03,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:03,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:03,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:03,554 INFO L87 Difference]: Start difference. First operand 503 states and 623 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:50:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:04,930 INFO L93 Difference]: Finished difference Result 505 states and 625 transitions. [2021-08-27 07:50:04,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:04,930 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-08-27 07:50:04,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:04,931 INFO L225 Difference]: With dead ends: 505 [2021-08-27 07:50:04,931 INFO L226 Difference]: Without dead ends: 505 [2021-08-27 07:50:04,932 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 278.2ms TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:50:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-08-27 07:50:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2021-08-27 07:50:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.2395833333333333) internal successors, (476), 391 states have internal predecessors, (476), 60 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2021-08-27 07:50:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2021-08-27 07:50:04,936 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2021-08-27 07:50:04,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:04,937 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2021-08-27 07:50:04,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:50:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2021-08-27 07:50:04,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:50:04,938 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:04,938 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:50:04,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-27 07:50:04,938 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:04,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:04,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1336611306, now seen corresponding path program 1 times [2021-08-27 07:50:04,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:04,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684986594] [2021-08-27 07:50:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:04,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:05,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:05,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:05,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:05,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:05,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:05,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:05,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684986594] [2021-08-27 07:50:05,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684986594] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:05,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:05,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:50:05,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386810995] [2021-08-27 07:50:05,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:50:05,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:05,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:50:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:50:05,142 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:06,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:06,473 INFO L93 Difference]: Finished difference Result 519 states and 639 transitions. [2021-08-27 07:50:06,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:06,473 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2021-08-27 07:50:06,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:06,474 INFO L225 Difference]: With dead ends: 519 [2021-08-27 07:50:06,474 INFO L226 Difference]: Without dead ends: 501 [2021-08-27 07:50:06,475 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 169.0ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:50:06,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-08-27 07:50:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2021-08-27 07:50:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2388451443569555) internal successors, (472), 388 states have internal predecessors, (472), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2021-08-27 07:50:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 598 transitions. [2021-08-27 07:50:06,479 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 598 transitions. Word has length 63 [2021-08-27 07:50:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:06,479 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 598 transitions. [2021-08-27 07:50:06,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 598 transitions. [2021-08-27 07:50:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:50:06,480 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:06,480 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:50:06,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-27 07:50:06,481 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:06,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:06,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2015464718, now seen corresponding path program 1 times [2021-08-27 07:50:06,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:06,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846582019] [2021-08-27 07:50:06,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:06,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-08-27 07:50:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,738 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:50:06,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:06,738 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846582019] [2021-08-27 07:50:06,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846582019] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:06,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:06,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:06,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834095341] [2021-08-27 07:50:06,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:06,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:06,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:06,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:06,743 INFO L87 Difference]: Start difference. First operand 485 states and 598 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:50:07,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:07,891 INFO L93 Difference]: Finished difference Result 520 states and 645 transitions. [2021-08-27 07:50:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:50:07,891 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2021-08-27 07:50:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:07,892 INFO L225 Difference]: With dead ends: 520 [2021-08-27 07:50:07,892 INFO L226 Difference]: Without dead ends: 520 [2021-08-27 07:50:07,893 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 283.0ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:50:07,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-08-27 07:50:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 485. [2021-08-27 07:50:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2335958005249343) internal successors, (470), 388 states have internal predecessors, (470), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2021-08-27 07:50:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2021-08-27 07:50:07,897 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 71 [2021-08-27 07:50:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:07,897 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2021-08-27 07:50:07,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:50:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2021-08-27 07:50:07,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-27 07:50:07,898 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:07,898 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:07,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-27 07:50:07,899 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:07,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:07,899 INFO L82 PathProgramCache]: Analyzing trace with hash -137076744, now seen corresponding path program 1 times [2021-08-27 07:50:07,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:07,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570420673] [2021-08-27 07:50:07,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:07,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:08,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:08,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:08,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:50:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:08,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-08-27 07:50:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:08,110 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:50:08,110 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:08,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570420673] [2021-08-27 07:50:08,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570420673] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:08,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:08,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:50:08,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825894382] [2021-08-27 07:50:08,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:50:08,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:08,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:50:08,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:50:08,112 INFO L87 Difference]: Start difference. First operand 485 states and 596 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:09,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:09,238 INFO L93 Difference]: Finished difference Result 509 states and 624 transitions. [2021-08-27 07:50:09,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:09,238 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2021-08-27 07:50:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:09,239 INFO L225 Difference]: With dead ends: 509 [2021-08-27 07:50:09,239 INFO L226 Difference]: Without dead ends: 490 [2021-08-27 07:50:09,240 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 148.7ms TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:50:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-08-27 07:50:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2021-08-27 07:50:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 372 states have (on average 1.2311827956989247) internal successors, (458), 379 states have internal predecessors, (458), 58 states have call successors, (58), 42 states have call predecessors, (58), 43 states have return successors, (65), 53 states have call predecessors, (65), 52 states have call successors, (65) [2021-08-27 07:50:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2021-08-27 07:50:09,244 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2021-08-27 07:50:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:09,244 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2021-08-27 07:50:09,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2021-08-27 07:50:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-27 07:50:09,245 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:09,245 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:09,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-27 07:50:09,245 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:09,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:09,245 INFO L82 PathProgramCache]: Analyzing trace with hash 130187692, now seen corresponding path program 1 times [2021-08-27 07:50:09,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:09,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845560883] [2021-08-27 07:50:09,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:09,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,449 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:50:09,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:09,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845560883] [2021-08-27 07:50:09,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845560883] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:09,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:09,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:50:09,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217013349] [2021-08-27 07:50:09,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:50:09,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:09,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:50:09,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:50:09,452 INFO L87 Difference]: Start difference. First operand 474 states and 581 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:10,460 INFO L93 Difference]: Finished difference Result 504 states and 616 transitions. [2021-08-27 07:50:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:10,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2021-08-27 07:50:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:10,461 INFO L225 Difference]: With dead ends: 504 [2021-08-27 07:50:10,461 INFO L226 Difference]: Without dead ends: 485 [2021-08-27 07:50:10,462 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 169.7ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:50:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-08-27 07:50:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2021-08-27 07:50:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 368 states have (on average 1.2309782608695652) internal successors, (453), 375 states have internal predecessors, (453), 57 states have call successors, (57), 42 states have call predecessors, (57), 43 states have return successors, (64), 52 states have call predecessors, (64), 51 states have call successors, (64) [2021-08-27 07:50:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2021-08-27 07:50:10,466 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2021-08-27 07:50:10,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:10,466 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2021-08-27 07:50:10,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:10,466 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2021-08-27 07:50:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-27 07:50:10,467 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:10,467 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:10,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-27 07:50:10,467 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:10,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:10,467 INFO L82 PathProgramCache]: Analyzing trace with hash -799923778, now seen corresponding path program 1 times [2021-08-27 07:50:10,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:10,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707554988] [2021-08-27 07:50:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:10,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,660 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:50:10,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:10,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707554988] [2021-08-27 07:50:10,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707554988] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:10,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:10,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:50:10,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977422959] [2021-08-27 07:50:10,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:50:10,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:10,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:50:10,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:50:10,666 INFO L87 Difference]: Start difference. First operand 469 states and 574 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:11,887 INFO L93 Difference]: Finished difference Result 499 states and 609 transitions. [2021-08-27 07:50:11,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:11,887 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2021-08-27 07:50:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:11,888 INFO L225 Difference]: With dead ends: 499 [2021-08-27 07:50:11,888 INFO L226 Difference]: Without dead ends: 481 [2021-08-27 07:50:11,889 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 159.3ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:50:11,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-08-27 07:50:11,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2021-08-27 07:50:11,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2301369863013698) internal successors, (449), 372 states have internal predecessors, (449), 56 states have call successors, (56), 42 states have call predecessors, (56), 43 states have return successors, (63), 51 states have call predecessors, (63), 50 states have call successors, (63) [2021-08-27 07:50:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2021-08-27 07:50:11,893 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2021-08-27 07:50:11,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:11,893 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2021-08-27 07:50:11,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2021-08-27 07:50:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-27 07:50:11,894 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:11,894 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:11,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-27 07:50:11,895 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:11,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:11,895 INFO L82 PathProgramCache]: Analyzing trace with hash -163798071, now seen corresponding path program 1 times [2021-08-27 07:50:11,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:11,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198273236] [2021-08-27 07:50:11,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:11,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-08-27 07:50:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,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:50:12,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:12,075 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198273236] [2021-08-27 07:50:12,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198273236] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:12,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:12,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:50:12,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421708153] [2021-08-27 07:50:12,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:50:12,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:12,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:50:12,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:50:12,076 INFO L87 Difference]: Start difference. First operand 465 states and 568 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:50:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:13,004 INFO L93 Difference]: Finished difference Result 625 states and 761 transitions. [2021-08-27 07:50:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:50:13,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2021-08-27 07:50:13,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:13,006 INFO L225 Difference]: With dead ends: 625 [2021-08-27 07:50:13,006 INFO L226 Difference]: Without dead ends: 625 [2021-08-27 07:50:13,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 214.4ms TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:50:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-08-27 07:50:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2021-08-27 07:50:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.220524017467249) internal successors, (559), 467 states have internal predecessors, (559), 69 states have call successors, (69), 52 states have call predecessors, (69), 58 states have return successors, (88), 67 states have call predecessors, (88), 64 states have call successors, (88) [2021-08-27 07:50:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2021-08-27 07:50:13,012 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 70 [2021-08-27 07:50:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:13,012 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2021-08-27 07:50:13,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:50:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2021-08-27 07:50:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-27 07:50:13,014 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:13,014 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:50:13,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-27 07:50:13,014 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1554229741, now seen corresponding path program 1 times [2021-08-27 07:50:13,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:13,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604497656] [2021-08-27 07:50:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:13,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:13,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-08-27 07:50:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,230 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:50:13,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:13,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604497656] [2021-08-27 07:50:13,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604497656] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:13,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:13,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:50:13,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715014720] [2021-08-27 07:50:13,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:50:13,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:13,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:50:13,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:50:13,232 INFO L87 Difference]: Start difference. First operand 586 states and 716 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:14,405 INFO L93 Difference]: Finished difference Result 616 states and 752 transitions. [2021-08-27 07:50:14,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:14,405 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2021-08-27 07:50:14,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:14,406 INFO L225 Difference]: With dead ends: 616 [2021-08-27 07:50:14,407 INFO L226 Difference]: Without dead ends: 576 [2021-08-27 07:50:14,407 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 178.7ms TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:50:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-08-27 07:50:14,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2021-08-27 07:50:14,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 437 states have (on average 1.2196796338672768) internal successors, (533), 446 states have internal predecessors, (533), 66 states have call successors, (66), 50 states have call predecessors, (66), 56 states have return successors, (85), 64 states have call predecessors, (85), 61 states have call successors, (85) [2021-08-27 07:50:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2021-08-27 07:50:14,412 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2021-08-27 07:50:14,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:14,412 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2021-08-27 07:50:14,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2021-08-27 07:50:14,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:50:14,413 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:14,413 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:50:14,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-27 07:50:14,413 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:14,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash -635159596, now seen corresponding path program 1 times [2021-08-27 07:50:14,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:14,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429275635] [2021-08-27 07:50:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:14,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:50:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-08-27 07:50:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,672 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:50:14,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:14,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429275635] [2021-08-27 07:50:14,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429275635] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:14,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:14,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:50:14,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841125500] [2021-08-27 07:50:14,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:50:14,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:14,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:50:14,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:50:14,674 INFO L87 Difference]: Start difference. First operand 560 states and 684 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:50:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:16,094 INFO L93 Difference]: Finished difference Result 586 states and 715 transitions. [2021-08-27 07:50:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:50:16,095 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2021-08-27 07:50:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:16,096 INFO L225 Difference]: With dead ends: 586 [2021-08-27 07:50:16,096 INFO L226 Difference]: Without dead ends: 535 [2021-08-27 07:50:16,096 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 313.7ms TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:50:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-08-27 07:50:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2021-08-27 07:50:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 403 states have (on average 1.2133995037220844) internal successors, (489), 412 states have internal predecessors, (489), 62 states have call successors, (62), 47 states have call predecessors, (62), 53 states have return successors, (81), 60 states have call predecessors, (81), 57 states have call successors, (81) [2021-08-27 07:50:16,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2021-08-27 07:50:16,101 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2021-08-27 07:50:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:16,102 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2021-08-27 07:50:16,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:50:16,102 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2021-08-27 07:50:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-27 07:50:16,103 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:16,103 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:16,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-27 07:50:16,103 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:16,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:16,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1523992416, now seen corresponding path program 1 times [2021-08-27 07:50:16,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:16,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034293046] [2021-08-27 07:50:16,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:16,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-08-27 07:50:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:50:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,347 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:50:16,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:16,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034293046] [2021-08-27 07:50:16,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034293046] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:16,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:16,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:16,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005871138] [2021-08-27 07:50:16,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:16,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:16,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:16,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:16,349 INFO L87 Difference]: Start difference. First operand 519 states and 632 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:50:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:17,727 INFO L93 Difference]: Finished difference Result 523 states and 631 transitions. [2021-08-27 07:50:17,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:50:17,728 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2021-08-27 07:50:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:17,729 INFO L225 Difference]: With dead ends: 523 [2021-08-27 07:50:17,729 INFO L226 Difference]: Without dead ends: 523 [2021-08-27 07:50:17,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 584.0ms TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2021-08-27 07:50:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-08-27 07:50:17,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2021-08-27 07:50:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 389 states have (on average 1.2133676092544987) internal successors, (472), 397 states have internal predecessors, (472), 60 states have call successors, (60), 47 states have call predecessors, (60), 51 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2021-08-27 07:50:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2021-08-27 07:50:17,734 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2021-08-27 07:50:17,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:17,734 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2021-08-27 07:50:17,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:50:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2021-08-27 07:50:17,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-27 07:50:17,735 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:17,735 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:50:17,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-27 07:50:17,735 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:17,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:17,736 INFO L82 PathProgramCache]: Analyzing trace with hash 100987323, now seen corresponding path program 1 times [2021-08-27 07:50:17,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:17,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472005396] [2021-08-27 07:50:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:17,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-08-27 07:50:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-08-27 07:50:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,970 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:50:17,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:17,970 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472005396] [2021-08-27 07:50:17,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472005396] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:17,970 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:17,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:50:17,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268981254] [2021-08-27 07:50:17,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:50:17,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:17,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:50:17,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:50:17,971 INFO L87 Difference]: Start difference. First operand 501 states and 602 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:50:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:18,833 INFO L93 Difference]: Finished difference Result 585 states and 740 transitions. [2021-08-27 07:50:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:50:18,833 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2021-08-27 07:50:18,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:18,834 INFO L225 Difference]: With dead ends: 585 [2021-08-27 07:50:18,834 INFO L226 Difference]: Without dead ends: 585 [2021-08-27 07:50:18,835 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 304.9ms TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:50:18,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2021-08-27 07:50:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2021-08-27 07:50:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 371 states have internal predecessors, (443), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2021-08-27 07:50:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2021-08-27 07:50:18,840 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2021-08-27 07:50:18,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:18,840 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2021-08-27 07:50:18,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:50:18,840 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2021-08-27 07:50:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-08-27 07:50:18,841 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:18,841 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:18,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-27 07:50:18,842 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:18,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:18,842 INFO L82 PathProgramCache]: Analyzing trace with hash 501668298, now seen corresponding path program 1 times [2021-08-27 07:50:18,842 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:18,842 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830989057] [2021-08-27 07:50:18,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:18,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 07:50:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,116 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:50:19,116 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:19,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830989057] [2021-08-27 07:50:19,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830989057] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:19,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:19,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:50:19,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908338889] [2021-08-27 07:50:19,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:50:19,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:19,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:50:19,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:50:19,117 INFO L87 Difference]: Start difference. First operand 465 states and 556 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:50:20,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:20,171 INFO L93 Difference]: Finished difference Result 523 states and 626 transitions. [2021-08-27 07:50:20,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:50:20,172 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2021-08-27 07:50:20,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:20,173 INFO L225 Difference]: With dead ends: 523 [2021-08-27 07:50:20,173 INFO L226 Difference]: Without dead ends: 505 [2021-08-27 07:50:20,173 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 362.6ms TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:50:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-08-27 07:50:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2021-08-27 07:50:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 372 states have (on average 1.2096774193548387) internal successors, (450), 378 states have internal predecessors, (450), 53 states have call successors, (53), 41 states have call predecessors, (53), 47 states have return successors, (63), 54 states have call predecessors, (63), 49 states have call successors, (63) [2021-08-27 07:50:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2021-08-27 07:50:20,177 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2021-08-27 07:50:20,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:20,178 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2021-08-27 07:50:20,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:50:20,178 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2021-08-27 07:50:20,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-08-27 07:50:20,179 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:20,179 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:20,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-08-27 07:50:20,179 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:20,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:20,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1591352246, now seen corresponding path program 1 times [2021-08-27 07:50:20,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:20,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466900145] [2021-08-27 07:50:20,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:20,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:20,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:20,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:20,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:20,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:20,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:20,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:20,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:20,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:20,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:50:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:20,405 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:50:20,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:20,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466900145] [2021-08-27 07:50:20,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466900145] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:20,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:20,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:50:20,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860871384] [2021-08-27 07:50:20,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:50:20,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:20,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:50:20,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:50:20,407 INFO L87 Difference]: Start difference. First operand 473 states and 566 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:50:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:21,316 INFO L93 Difference]: Finished difference Result 523 states and 625 transitions. [2021-08-27 07:50:21,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 07:50:21,317 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2021-08-27 07:50:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:21,318 INFO L225 Difference]: With dead ends: 523 [2021-08-27 07:50:21,318 INFO L226 Difference]: Without dead ends: 505 [2021-08-27 07:50:21,318 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 272.5ms TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:50:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-08-27 07:50:21,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2021-08-27 07:50:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.210958904109589) internal successors, (442), 371 states have internal predecessors, (442), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2021-08-27 07:50:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2021-08-27 07:50:21,322 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2021-08-27 07:50:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:21,322 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2021-08-27 07:50:21,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:50:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2021-08-27 07:50:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-08-27 07:50:21,323 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:21,323 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:50:21,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-08-27 07:50:21,324 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:21,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:21,324 INFO L82 PathProgramCache]: Analyzing trace with hash 590529597, now seen corresponding path program 1 times [2021-08-27 07:50:21,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:21,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583398561] [2021-08-27 07:50:21,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:21,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:50:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:50:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-08-27 07:50:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,543 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:50:21,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:21,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583398561] [2021-08-27 07:50:21,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583398561] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:21,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:21,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:21,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847136252] [2021-08-27 07:50:21,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:21,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:21,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:21,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:21,545 INFO L87 Difference]: Start difference. First operand 465 states and 555 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:50:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:22,783 INFO L93 Difference]: Finished difference Result 611 states and 714 transitions. [2021-08-27 07:50:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:50:22,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2021-08-27 07:50:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:22,785 INFO L225 Difference]: With dead ends: 611 [2021-08-27 07:50:22,785 INFO L226 Difference]: Without dead ends: 611 [2021-08-27 07:50:22,785 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 355.3ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:50:22,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-08-27 07:50:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 586. [2021-08-27 07:50:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 462 states have (on average 1.2034632034632036) internal successors, (556), 470 states have internal predecessors, (556), 61 states have call successors, (61), 53 states have call predecessors, (61), 62 states have return successors, (72), 63 states have call predecessors, (72), 57 states have call successors, (72) [2021-08-27 07:50:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 689 transitions. [2021-08-27 07:50:22,790 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 689 transitions. Word has length 92 [2021-08-27 07:50:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:22,790 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 689 transitions. [2021-08-27 07:50:22,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:50:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 689 transitions. [2021-08-27 07:50:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-08-27 07:50:22,791 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:22,791 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:50:22,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-08-27 07:50:22,791 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:22,792 INFO L82 PathProgramCache]: Analyzing trace with hash -605677229, now seen corresponding path program 1 times [2021-08-27 07:50:22,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:22,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580297941] [2021-08-27 07:50:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:22,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:50:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:50:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 07:50:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,035 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:50:23,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:23,035 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580297941] [2021-08-27 07:50:23,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580297941] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:23,036 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:23,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:50:23,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995669775] [2021-08-27 07:50:23,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:50:23,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:23,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:50:23,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:50:23,037 INFO L87 Difference]: Start difference. First operand 586 states and 689 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-08-27 07:50:24,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:24,094 INFO L93 Difference]: Finished difference Result 587 states and 689 transitions. [2021-08-27 07:50:24,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:50:24,094 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 93 [2021-08-27 07:50:24,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:24,095 INFO L225 Difference]: With dead ends: 587 [2021-08-27 07:50:24,095 INFO L226 Difference]: Without dead ends: 498 [2021-08-27 07:50:24,095 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 258.2ms TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:50:24,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-08-27 07:50:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2021-08-27 07:50:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.20671834625323) internal successors, (467), 394 states have internal predecessors, (467), 54 states have call successors, (54), 47 states have call predecessors, (54), 54 states have return successors, (64), 55 states have call predecessors, (64), 51 states have call successors, (64) [2021-08-27 07:50:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 585 transitions. [2021-08-27 07:50:24,100 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 585 transitions. Word has length 93 [2021-08-27 07:50:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:24,100 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 585 transitions. [2021-08-27 07:50:24,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-08-27 07:50:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 585 transitions. [2021-08-27 07:50:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-27 07:50:24,101 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:24,101 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:24,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-08-27 07:50:24,101 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash 612741088, now seen corresponding path program 1 times [2021-08-27 07:50:24,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:24,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721850918] [2021-08-27 07:50:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:24,102 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-08-27 07:50:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-27 07:50:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,319 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:50:24,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:24,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721850918] [2021-08-27 07:50:24,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721850918] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:24,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:24,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:50:24,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433244020] [2021-08-27 07:50:24,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:50:24,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:24,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:50:24,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:50:24,320 INFO L87 Difference]: Start difference. First operand 496 states and 585 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-08-27 07:50:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:24,812 INFO L93 Difference]: Finished difference Result 494 states and 580 transitions. [2021-08-27 07:50:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:24,812 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2021-08-27 07:50:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:24,814 INFO L225 Difference]: With dead ends: 494 [2021-08-27 07:50:24,814 INFO L226 Difference]: Without dead ends: 492 [2021-08-27 07:50:24,814 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 166.6ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:50:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-08-27 07:50:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 439. [2021-08-27 07:50:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 343 states have (on average 1.19533527696793) internal successors, (410), 349 states have internal predecessors, (410), 47 states have call successors, (47), 42 states have call predecessors, (47), 48 states have return successors, (55), 48 states have call predecessors, (55), 44 states have call successors, (55) [2021-08-27 07:50:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 512 transitions. [2021-08-27 07:50:24,826 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 512 transitions. Word has length 99 [2021-08-27 07:50:24,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:24,826 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 512 transitions. [2021-08-27 07:50:24,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-08-27 07:50:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 512 transitions. [2021-08-27 07:50:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-27 07:50:24,827 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:24,827 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:24,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-08-27 07:50:24,828 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:24,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:24,828 INFO L82 PathProgramCache]: Analyzing trace with hash -78015673, now seen corresponding path program 1 times [2021-08-27 07:50:24,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:24,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798358592] [2021-08-27 07:50:24,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:24,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:24,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-08-27 07:50:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-08-27 07:50:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,076 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:50:25,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:25,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798358592] [2021-08-27 07:50:25,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798358592] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:25,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:25,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:50:25,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724432783] [2021-08-27 07:50:25,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:50:25,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:25,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:50:25,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:50:25,077 INFO L87 Difference]: Start difference. First operand 439 states and 512 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-08-27 07:50:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:26,205 INFO L93 Difference]: Finished difference Result 839 states and 983 transitions. [2021-08-27 07:50:26,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 07:50:26,205 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2021-08-27 07:50:26,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:26,207 INFO L225 Difference]: With dead ends: 839 [2021-08-27 07:50:26,207 INFO L226 Difference]: Without dead ends: 797 [2021-08-27 07:50:26,207 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 400.9ms TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2021-08-27 07:50:26,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-08-27 07:50:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 419. [2021-08-27 07:50:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 327 states have (on average 1.1957186544342508) internal successors, (391), 332 states have internal predecessors, (391), 44 states have call successors, (44), 41 states have call predecessors, (44), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2021-08-27 07:50:26,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 487 transitions. [2021-08-27 07:50:26,212 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 487 transitions. Word has length 99 [2021-08-27 07:50:26,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:26,213 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 487 transitions. [2021-08-27 07:50:26,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-08-27 07:50:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 487 transitions. [2021-08-27 07:50:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-08-27 07:50:26,214 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:26,214 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:26,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-08-27 07:50:26,214 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:26,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:26,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1954562899, now seen corresponding path program 1 times [2021-08-27 07:50:26,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:26,215 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193233560] [2021-08-27 07:50:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:26,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-08-27 07:50:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,540 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:50:26,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:26,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193233560] [2021-08-27 07:50:26,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193233560] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:26,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:26,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:50:26,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146815305] [2021-08-27 07:50:26,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:50:26,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:26,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:50:26,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:26,542 INFO L87 Difference]: Start difference. First operand 419 states and 487 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2021-08-27 07:50:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:27,137 INFO L93 Difference]: Finished difference Result 464 states and 541 transitions. [2021-08-27 07:50:27,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 07:50:27,138 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2021-08-27 07:50:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:27,142 INFO L225 Difference]: With dead ends: 464 [2021-08-27 07:50:27,142 INFO L226 Difference]: Without dead ends: 438 [2021-08-27 07:50:27,142 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 293.6ms TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:50:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-08-27 07:50:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 428. [2021-08-27 07:50:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.182089552238806) internal successors, (396), 341 states have internal predecessors, (396), 45 states have call successors, (45), 41 states have call predecessors, (45), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2021-08-27 07:50:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 493 transitions. [2021-08-27 07:50:27,147 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 493 transitions. Word has length 104 [2021-08-27 07:50:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:27,147 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 493 transitions. [2021-08-27 07:50:27,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2021-08-27 07:50:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 493 transitions. [2021-08-27 07:50:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-08-27 07:50:27,148 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:27,148 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:27,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-08-27 07:50:27,149 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:27,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:27,149 INFO L82 PathProgramCache]: Analyzing trace with hash 260351279, now seen corresponding path program 1 times [2021-08-27 07:50:27,149 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:27,149 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666795408] [2021-08-27 07:50:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:27,149 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-08-27 07:50:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-08-27 07:50:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 07:50:27,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:27,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666795408] [2021-08-27 07:50:27,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666795408] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:27,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:27,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:50:27,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793671125] [2021-08-27 07:50:27,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:50:27,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:27,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:50:27,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:50:27,398 INFO L87 Difference]: Start difference. First operand 428 states and 493 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-08-27 07:50:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:27,876 INFO L93 Difference]: Finished difference Result 440 states and 505 transitions. [2021-08-27 07:50:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:50:27,876 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2021-08-27 07:50:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:27,877 INFO L225 Difference]: With dead ends: 440 [2021-08-27 07:50:27,877 INFO L226 Difference]: Without dead ends: 440 [2021-08-27 07:50:27,878 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 212.5ms TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:50:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-08-27 07:50:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 436. [2021-08-27 07:50:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 341 states have (on average 1.1788856304985338) internal successors, (402), 347 states have internal predecessors, (402), 45 states have call successors, (45), 41 states have call predecessors, (45), 49 states have return successors, (54), 47 states have call predecessors, (54), 41 states have call successors, (54) [2021-08-27 07:50:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 501 transitions. [2021-08-27 07:50:27,881 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 501 transitions. Word has length 113 [2021-08-27 07:50:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:27,881 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 501 transitions. [2021-08-27 07:50:27,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-08-27 07:50:27,881 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 501 transitions. [2021-08-27 07:50:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-08-27 07:50:27,882 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:27,882 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:27,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-08-27 07:50:27,882 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:27,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1796786958, now seen corresponding path program 1 times [2021-08-27 07:50:27,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:27,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592893876] [2021-08-27 07:50:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:27,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-08-27 07:50:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:28,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-08-27 07:50:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-27 07:50:28,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:28,113 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592893876] [2021-08-27 07:50:28,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592893876] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:28,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:28,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:50:28,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169438967] [2021-08-27 07:50:28,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:50:28,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:28,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:50:28,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:50:28,114 INFO L87 Difference]: Start difference. First operand 436 states and 501 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2021-08-27 07:50:28,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:28,652 INFO L93 Difference]: Finished difference Result 387 states and 434 transitions. [2021-08-27 07:50:28,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:50:28,652 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) Word has length 113 [2021-08-27 07:50:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:28,653 INFO L225 Difference]: With dead ends: 387 [2021-08-27 07:50:28,653 INFO L226 Difference]: Without dead ends: 387 [2021-08-27 07:50:28,653 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 184.8ms TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:50:28,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-08-27 07:50:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 249. [2021-08-27 07:50:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 195 states have (on average 1.1384615384615384) internal successors, (222), 197 states have internal predecessors, (222), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2021-08-27 07:50:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 275 transitions. [2021-08-27 07:50:28,656 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 275 transitions. Word has length 113 [2021-08-27 07:50:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:28,656 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 275 transitions. [2021-08-27 07:50:28,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2021-08-27 07:50:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 275 transitions. [2021-08-27 07:50:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-27 07:50:28,657 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:28,657 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:28,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-08-27 07:50:28,657 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:28,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:28,658 INFO L82 PathProgramCache]: Analyzing trace with hash 960404334, now seen corresponding path program 1 times [2021-08-27 07:50:28,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:28,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011727444] [2021-08-27 07:50:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:28,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-27 07:50:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:50:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,947 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:50:28,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:28,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011727444] [2021-08-27 07:50:28,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011727444] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:28,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:28,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:50:28,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636161300] [2021-08-27 07:50:28,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:50:28,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:50:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:50:28,950 INFO L87 Difference]: Start difference. First operand 249 states and 275 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-08-27 07:50:29,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:29,554 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2021-08-27 07:50:29,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:50:29,554 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2021-08-27 07:50:29,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:29,555 INFO L225 Difference]: With dead ends: 263 [2021-08-27 07:50:29,555 INFO L226 Difference]: Without dead ends: 263 [2021-08-27 07:50:29,555 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 294.7ms TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:29,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-08-27 07:50:29,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 253. [2021-08-27 07:50:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 198 states have (on average 1.1363636363636365) internal successors, (225), 200 states have internal predecessors, (225), 26 states have call successors, (26), 26 states have call predecessors, (26), 28 states have return successors, (28), 26 states have call predecessors, (28), 24 states have call successors, (28) [2021-08-27 07:50:29,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 279 transitions. [2021-08-27 07:50:29,557 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 279 transitions. Word has length 120 [2021-08-27 07:50:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:29,557 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 279 transitions. [2021-08-27 07:50:29,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-08-27 07:50:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 279 transitions. [2021-08-27 07:50:29,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-08-27 07:50:29,558 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:29,558 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:29,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-08-27 07:50:29,558 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:29,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:29,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1141890831, now seen corresponding path program 1 times [2021-08-27 07:50:29,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:29,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413204388] [2021-08-27 07:50:29,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:29,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-08-27 07:50:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-08-27 07:50:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:29,846 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:50:29,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:29,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413204388] [2021-08-27 07:50:29,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413204388] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:29,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:29,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:50:29,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660654744] [2021-08-27 07:50:29,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:50:29,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:29,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:50:29,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:50:29,848 INFO L87 Difference]: Start difference. First operand 253 states and 279 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-08-27 07:50:30,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:30,304 INFO L93 Difference]: Finished difference Result 263 states and 289 transitions. [2021-08-27 07:50:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:50:30,305 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2021-08-27 07:50:30,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:30,305 INFO L225 Difference]: With dead ends: 263 [2021-08-27 07:50:30,305 INFO L226 Difference]: Without dead ends: 254 [2021-08-27 07:50:30,306 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 230.5ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:30,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-08-27 07:50:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2021-08-27 07:50:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2021-08-27 07:50:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2021-08-27 07:50:30,308 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 120 [2021-08-27 07:50:30,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:30,308 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2021-08-27 07:50:30,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-08-27 07:50:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2021-08-27 07:50:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-08-27 07:50:30,309 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:30,309 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:30,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-08-27 07:50:30,309 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:30,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:30,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1073285628, now seen corresponding path program 1 times [2021-08-27 07:50:30,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:30,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617428513] [2021-08-27 07:50:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:30,310 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-08-27 07:50:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-08-27 07:50:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-27 07:50:30,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:30,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617428513] [2021-08-27 07:50:30,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617428513] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:30,791 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:30,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-27 07:50:30,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692611028] [2021-08-27 07:50:30,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 07:50:30,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:30,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 07:50:30,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:50:30,792 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-08-27 07:50:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:31,764 INFO L93 Difference]: Finished difference Result 317 states and 357 transitions. [2021-08-27 07:50:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-27 07:50:31,764 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 150 [2021-08-27 07:50:31,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:31,765 INFO L225 Difference]: With dead ends: 317 [2021-08-27 07:50:31,765 INFO L226 Difference]: Without dead ends: 285 [2021-08-27 07:50:31,765 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 470.3ms TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2021-08-27 07:50:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-08-27 07:50:31,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 265. [2021-08-27 07:50:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.138755980861244) internal successors, (238), 211 states have internal predecessors, (238), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2021-08-27 07:50:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 293 transitions. [2021-08-27 07:50:31,767 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 293 transitions. Word has length 150 [2021-08-27 07:50:31,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:31,767 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 293 transitions. [2021-08-27 07:50:31,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-08-27 07:50:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 293 transitions. [2021-08-27 07:50:31,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-08-27 07:50:31,768 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:31,769 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:31,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-08-27 07:50:31,769 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:31,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:31,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1690329856, now seen corresponding path program 1 times [2021-08-27 07:50:31,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:31,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069871806] [2021-08-27 07:50:31,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:31,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:31,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:31,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:31,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:31,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-08-27 07:50:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-08-27 07:50:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-08-27 07:50:32,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:32,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069871806] [2021-08-27 07:50:32,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069871806] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:32,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:32,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-08-27 07:50:32,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108480525] [2021-08-27 07:50:32,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-08-27 07:50:32,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:32,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-08-27 07:50:32,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:50:32,168 INFO L87 Difference]: Start difference. First operand 265 states and 293 transitions. Second operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-08-27 07:50:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:32,941 INFO L93 Difference]: Finished difference Result 284 states and 314 transitions. [2021-08-27 07:50:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:50:32,942 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 151 [2021-08-27 07:50:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:32,942 INFO L225 Difference]: With dead ends: 284 [2021-08-27 07:50:32,942 INFO L226 Difference]: Without dead ends: 279 [2021-08-27 07:50:32,943 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 356.0ms TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2021-08-27 07:50:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-08-27 07:50:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 265. [2021-08-27 07:50:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.1339712918660287) internal successors, (237), 211 states have internal predecessors, (237), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2021-08-27 07:50:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions. [2021-08-27 07:50:32,945 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 151 [2021-08-27 07:50:32,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:32,945 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions. [2021-08-27 07:50:32,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-08-27 07:50:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions. [2021-08-27 07:50:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-08-27 07:50:32,946 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:32,946 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:32,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-08-27 07:50:32,946 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:32,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:32,947 INFO L82 PathProgramCache]: Analyzing trace with hash -206728514, now seen corresponding path program 1 times [2021-08-27 07:50:32,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:32,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092298439] [2021-08-27 07:50:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:32,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-08-27 07:50:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-08-27 07:50:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-08-27 07:50:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-27 07:50:33,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:33,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092298439] [2021-08-27 07:50:33,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092298439] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:33,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:33,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-27 07:50:33,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224656168] [2021-08-27 07:50:33,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:50:33,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:33,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:50:33,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:50:33,361 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2021-08-27 07:50:34,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:34,298 INFO L93 Difference]: Finished difference Result 303 states and 337 transitions. [2021-08-27 07:50:34,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:50:34,298 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 153 [2021-08-27 07:50:34,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:34,299 INFO L225 Difference]: With dead ends: 303 [2021-08-27 07:50:34,299 INFO L226 Difference]: Without dead ends: 265 [2021-08-27 07:50:34,299 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 438.4ms TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:50:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-08-27 07:50:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2021-08-27 07:50:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 205 states have (on average 1.1219512195121952) internal successors, (230), 207 states have internal predecessors, (230), 25 states have call successors, (25), 25 states have call predecessors, (25), 28 states have return successors, (28), 26 states have call predecessors, (28), 23 states have call successors, (28) [2021-08-27 07:50:34,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 283 transitions. [2021-08-27 07:50:34,301 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 283 transitions. Word has length 153 [2021-08-27 07:50:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:34,302 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 283 transitions. [2021-08-27 07:50:34,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2021-08-27 07:50:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 283 transitions. [2021-08-27 07:50:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-08-27 07:50:34,302 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:34,302 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:34,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-08-27 07:50:34,303 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:34,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1217289252, now seen corresponding path program 1 times [2021-08-27 07:50:34,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:34,303 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744600368] [2021-08-27 07:50:34,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:34,303 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:34,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:34,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-08-27 07:50:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-08-27 07:50:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-08-27 07:50:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-27 07:50:34,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:34,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744600368] [2021-08-27 07:50:34,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744600368] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:34,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:34,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:50:34,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615951717] [2021-08-27 07:50:34,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:50:34,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:34,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:50:34,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:50:34,590 INFO L87 Difference]: Start difference. First operand 259 states and 283 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-08-27 07:50:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:35,083 INFO L93 Difference]: Finished difference Result 256 states and 277 transitions. [2021-08-27 07:50:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:50:35,084 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 158 [2021-08-27 07:50:35,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:35,084 INFO L225 Difference]: With dead ends: 256 [2021-08-27 07:50:35,085 INFO L226 Difference]: Without dead ends: 245 [2021-08-27 07:50:35,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 333.9ms TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:50:35,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-08-27 07:50:35,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231. [2021-08-27 07:50:35,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 183 states have internal predecessors, (200), 24 states have call successors, (24), 24 states have call predecessors, (24), 25 states have return successors, (25), 23 states have call predecessors, (25), 22 states have call successors, (25) [2021-08-27 07:50:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2021-08-27 07:50:35,087 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 158 [2021-08-27 07:50:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:35,087 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2021-08-27 07:50:35,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-08-27 07:50:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2021-08-27 07:50:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-08-27 07:50:35,088 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:35,088 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:35,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-08-27 07:50:35,088 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:35,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1524054683, now seen corresponding path program 1 times [2021-08-27 07:50:35,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:35,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910900404] [2021-08-27 07:50:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:35,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-08-27 07:50:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-08-27 07:50:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-08-27 07:50:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-08-27 07:50:35,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:35,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910900404] [2021-08-27 07:50:35,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910900404] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:35,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:35,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-08-27 07:50:35,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517488790] [2021-08-27 07:50:35,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 07:50:35,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:35,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 07:50:35,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:50:35,394 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-08-27 07:50:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:35,782 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2021-08-27 07:50:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:50:35,782 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2021-08-27 07:50:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:35,783 INFO L225 Difference]: With dead ends: 220 [2021-08-27 07:50:35,783 INFO L226 Difference]: Without dead ends: 210 [2021-08-27 07:50:35,783 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 244.9ms TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:50:35,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-08-27 07:50:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-08-27 07:50:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0920245398773005) internal successors, (178), 164 states have internal predecessors, (178), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2021-08-27 07:50:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 224 transitions. [2021-08-27 07:50:35,785 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 224 transitions. Word has length 160 [2021-08-27 07:50:35,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:35,785 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 224 transitions. [2021-08-27 07:50:35,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-08-27 07:50:35,785 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 224 transitions. [2021-08-27 07:50:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-27 07:50:35,798 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:35,798 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:35,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-08-27 07:50:35,798 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1861413762, now seen corresponding path program 1 times [2021-08-27 07:50:35,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:35,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698634331] [2021-08-27 07:50:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:35,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:36,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 07:50:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-08-27 07:50:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-08-27 07:50:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 07:50:36,177 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:36,177 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698634331] [2021-08-27 07:50:36,177 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698634331] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:36,177 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:36,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-08-27 07:50:36,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120083581] [2021-08-27 07:50:36,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 07:50:36,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:36,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 07:50:36,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:50:36,178 INFO L87 Difference]: Start difference. First operand 210 states and 224 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-08-27 07:50:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:37,353 INFO L93 Difference]: Finished difference Result 355 states and 377 transitions. [2021-08-27 07:50:37,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-08-27 07:50:37,353 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2021-08-27 07:50:37,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:37,353 INFO L225 Difference]: With dead ends: 355 [2021-08-27 07:50:37,354 INFO L226 Difference]: Without dead ends: 213 [2021-08-27 07:50:37,354 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 727.1ms TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2021-08-27 07:50:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-08-27 07:50:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2021-08-27 07:50:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0858895705521472) internal successors, (177), 164 states have internal predecessors, (177), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2021-08-27 07:50:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2021-08-27 07:50:37,356 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 161 [2021-08-27 07:50:37,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:37,356 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2021-08-27 07:50:37,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-08-27 07:50:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2021-08-27 07:50:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-08-27 07:50:37,356 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:37,357 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:37,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-08-27 07:50:37,357 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:37,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:37,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1510386108, now seen corresponding path program 1 times [2021-08-27 07:50:37,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:37,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525757474] [2021-08-27 07:50:37,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:37,357 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-08-27 07:50:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-08-27 07:50:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-08-27 07:50:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-08-27 07:50:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-08-27 07:50:37,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:37,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525757474] [2021-08-27 07:50:37,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525757474] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:37,807 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:37,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-08-27 07:50:37,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152843937] [2021-08-27 07:50:37,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-08-27 07:50:37,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:37,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-08-27 07:50:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-08-27 07:50:37,808 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-08-27 07:50:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:38,926 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2021-08-27 07:50:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-08-27 07:50:38,927 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2021-08-27 07:50:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:38,927 INFO L225 Difference]: With dead ends: 210 [2021-08-27 07:50:38,927 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 07:50:38,927 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 676.3ms TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2021-08-27 07:50:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 07:50:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 07:50:38,928 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:50:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 07:50:38,928 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2021-08-27 07:50:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:38,928 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 07:50:38,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-08-27 07:50:38,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 07:50:38,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 07:50:38,930 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:50:38,938 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:50:38,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-08-27 07:50:38,941 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:50:38,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:50:38 BoogieIcfgContainer [2021-08-27 07:50:38,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:50:38,943 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:50:38,943 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:50:38,943 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:50:38,943 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:49:07" (3/4) ... [2021-08-27 07:50:38,945 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 07:50:38,950 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-08-27 07:50:38,950 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2021-08-27 07:50:38,950 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2021-08-27 07:50:38,950 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2021-08-27 07:50:38,950 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2021-08-27 07:50:38,950 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2021-08-27 07:50:38,950 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-08-27 07:50:38,950 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2021-08-27 07:50:38,950 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-08-27 07:50:38,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2021-08-27 07:50:38,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-08-27 07:50:38,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-08-27 07:50:38,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2021-08-27 07:50:38,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2021-08-27 07:50:38,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2021-08-27 07:50:38,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2021-08-27 07:50:38,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2021-08-27 07:50:38,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2021-08-27 07:50:38,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-08-27 07:50:38,951 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2021-08-27 07:50:38,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-08-27 07:50:38,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2021-08-27 07:50:38,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2021-08-27 07:50:38,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-08-27 07:50:38,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2021-08-27 07:50:38,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2021-08-27 07:50:38,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2021-08-27 07:50:38,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2021-08-27 07:50:38,952 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2021-08-27 07:50:38,953 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2021-08-27 07:50:38,974 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 86 nodes and edges [2021-08-27 07:50:38,976 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-08-27 07:50:38,977 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-27 07:50:38,978 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-08-27 07:50:39,073 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 07:50:39,073 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:50:39,075 INFO L168 Benchmark]: Toolchain (without parser) took 92511.68 ms. Allocated memory was 62.9 MB in the beginning and 436.2 MB in the end (delta: 373.3 MB). Free memory was 42.3 MB in the beginning and 270.9 MB in the end (delta: -228.6 MB). Peak memory consumption was 145.5 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:39,075 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 62.9 MB. Free memory is still 45.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:50:39,075 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.82 ms. Allocated memory is still 62.9 MB. Free memory was 42.0 MB in the beginning and 34.4 MB in the end (delta: 7.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:39,075 INFO L168 Benchmark]: Boogie Preprocessor took 84.35 ms. Allocated memory is still 62.9 MB. Free memory was 34.4 MB in the beginning and 30.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:39,076 INFO L168 Benchmark]: RCFGBuilder took 870.29 ms. Allocated memory was 62.9 MB in the beginning and 77.6 MB in the end (delta: 14.7 MB). Free memory was 30.2 MB in the beginning and 32.2 MB in the end (delta: -2.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:39,078 INFO L168 Benchmark]: TraceAbstraction took 90977.26 ms. Allocated memory was 77.6 MB in the beginning and 436.2 MB in the end (delta: 358.6 MB). Free memory was 31.7 MB in the beginning and 298.4 MB in the end (delta: -266.7 MB). Peak memory consumption was 92.4 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:39,078 INFO L168 Benchmark]: Witness Printer took 130.26 ms. Allocated memory is still 436.2 MB. Free memory was 298.4 MB in the beginning and 270.9 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:39,079 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.15 ms. Allocated memory is still 62.9 MB. Free memory is still 45.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 441.82 ms. Allocated memory is still 62.9 MB. Free memory was 42.0 MB in the beginning and 34.4 MB in the end (delta: 7.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 84.35 ms. Allocated memory is still 62.9 MB. Free memory was 34.4 MB in the beginning and 30.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 870.29 ms. Allocated memory was 62.9 MB in the beginning and 77.6 MB in the end (delta: 14.7 MB). Free memory was 30.2 MB in the beginning and 32.2 MB in the end (delta: -2.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 90977.26 ms. Allocated memory was 77.6 MB in the beginning and 436.2 MB in the end (delta: 358.6 MB). Free memory was 31.7 MB in the beginning and 298.4 MB in the end (delta: -266.7 MB). Peak memory consumption was 92.4 MB. Max. memory is 16.1 GB. * Witness Printer took 130.26 ms. Allocated memory is still 436.2 MB. Free memory was 298.4 MB in the beginning and 270.9 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 667]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1627]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 31 procedures, 396 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 90929.1ms, OverallIterations: 67, TraceHistogramMax: 2, EmptinessCheckTime: 79.1ms, AutomataDifference: 74413.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 24799 SDtfs, 35964 SDslu, 53376 SDs, 0 SdLazy, 91602 SolverSat, 11213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51591.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1881 GetRequests, 847 SyntacticMatches, 0 SemanticMatches, 1034 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3103 ImplicationChecksByTransitivity, 19364.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=932occurred in iteration=20, InterpolantAutomatonStates: 863, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 569.0ms AutomataMinimizationTime, 67 MinimizatonAttempts, 3040 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 183.7ms SsaConstructionTime, 580.0ms SatisfiabilityAnalysisTime, 14629.3ms InterpolantComputationTime, 4769 NumberOfCodeBlocks, 4769 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 4702 ConstructedInterpolants, 0 QuantifiedInterpolants, 21829 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 PerfectInterpolantSequences, 229/229 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-08-27 07:50:39,109 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...