./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.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/kbfiltr_simpl2.cil-1.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 3e0d5536f9cd1f3a5d711f95a0369e25308fe790 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:59,544 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:49:59,547 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:49:59,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:49:59,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:49:59,594 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:49:59,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:49:59,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:49:59,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:49:59,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:49:59,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:49:59,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:49:59,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:49:59,624 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:49:59,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:49:59,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:49:59,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:49:59,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:49:59,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:49:59,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:49:59,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:49:59,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:49:59,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:49:59,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:49:59,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:49:59,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:49:59,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:49:59,658 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:49:59,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:49:59,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:49:59,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:49:59,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:49:59,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:49:59,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:49:59,663 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:49:59,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:49:59,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:49:59,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:49:59,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:49:59,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:49:59,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:49:59,668 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:59,707 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:49:59,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:49:59,709 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:49:59,709 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:49:59,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:49:59,711 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:49:59,711 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:49:59,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:49:59,712 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:49:59,712 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:49:59,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:49:59,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:49:59,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:49:59,714 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:49:59,714 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:49:59,714 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:49:59,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:49:59,720 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:49:59,721 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:49:59,721 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:49:59,721 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:49:59,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:49:59,721 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:49:59,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:49:59,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:49:59,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:49:59,722 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:49:59,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:49:59,723 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:49:59,723 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 -> 3e0d5536f9cd1f3a5d711f95a0369e25308fe790 [2021-08-27 07:50:00,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:50:00,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:50:00,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:50:00,083 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:50:00,084 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:50:00,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2021-08-27 07:50:00,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c43e71375/40ee7b6ce1494ff9b6d207f8532014c4/FLAGe2f97b322 [2021-08-27 07:50:00,652 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:50:00,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2021-08-27 07:50:00,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c43e71375/40ee7b6ce1494ff9b6d207f8532014c4/FLAGe2f97b322 [2021-08-27 07:50:01,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c43e71375/40ee7b6ce1494ff9b6d207f8532014c4 [2021-08-27 07:50:01,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:50:01,013 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:50:01,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:50:01,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:50:01,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:50:01,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:50:01" (1/1) ... [2021-08-27 07:50:01,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7c556c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:01, skipping insertion in model container [2021-08-27 07:50:01,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:50:01" (1/1) ... [2021-08-27 07:50:01,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:50:01,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:50:01,294 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/kbfiltr_simpl2.cil-1.c[29620,29633] [2021-08-27 07:50:01,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:50:01,305 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:50:01,389 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/kbfiltr_simpl2.cil-1.c[29620,29633] [2021-08-27 07:50:01,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:50:01,404 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:50:01,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:01 WrapperNode [2021-08-27 07:50:01,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:50:01,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:50:01,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:50:01,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:50:01,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:01" (1/1) ... [2021-08-27 07:50:01,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:01" (1/1) ... [2021-08-27 07:50:01,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:01" (1/1) ... [2021-08-27 07:50:01,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:01" (1/1) ... [2021-08-27 07:50:01,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:01" (1/1) ... [2021-08-27 07:50:01,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:01" (1/1) ... [2021-08-27 07:50:01,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:01" (1/1) ... [2021-08-27 07:50:01,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:50:01,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:50:01,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:50:01,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:50:01,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:01" (1/1) ... [2021-08-27 07:50:01,470 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:50:01,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:50:01,494 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:50:01,498 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:50:01,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:50:01,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:50:01,532 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:50:01,533 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-08-27 07:50:01,533 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-08-27 07:50:01,533 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2021-08-27 07:50:01,533 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:50:01,533 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-08-27 07:50:01,533 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-08-27 07:50:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-08-27 07:50:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-08-27 07:50:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-08-27 07:50:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2021-08-27 07:50:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2021-08-27 07:50:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2021-08-27 07:50:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2021-08-27 07:50:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2021-08-27 07:50:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2021-08-27 07:50:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-08-27 07:50:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:50:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:50:01,535 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:50:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:50:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-08-27 07:50:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 07:50:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-08-27 07:50:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2021-08-27 07:50:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2021-08-27 07:50:01,536 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-08-27 07:50:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-08-27 07:50:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-08-27 07:50:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2021-08-27 07:50:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2021-08-27 07:50:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2021-08-27 07:50:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2021-08-27 07:50:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2021-08-27 07:50:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-08-27 07:50:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-08-27 07:50:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-08-27 07:50:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-08-27 07:50:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:50:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-08-27 07:50:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:50:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:50:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:50:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:50:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:50:01,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:50:01,834 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:50:01,955 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-08-27 07:50:01,955 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-08-27 07:50:01,961 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:50:02,011 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2021-08-27 07:50:02,012 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2021-08-27 07:50:02,088 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:50:02,108 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-08-27 07:50:02,109 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-08-27 07:50:02,114 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:50:02,229 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2021-08-27 07:50:02,229 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2021-08-27 07:50:02,233 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:50:02,263 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2021-08-27 07:50:02,263 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2021-08-27 07:50:02,270 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:50:02,303 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2021-08-27 07:50:02,303 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2021-08-27 07:50:02,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:50:02,368 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-08-27 07:50:02,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:50:02 BoogieIcfgContainer [2021-08-27 07:50:02,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:50:02,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:50:02,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:50:02,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:50:02,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:50:01" (1/3) ... [2021-08-27 07:50:02,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513d329a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:50:02, skipping insertion in model container [2021-08-27 07:50:02,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:01" (2/3) ... [2021-08-27 07:50:02,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513d329a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:50:02, skipping insertion in model container [2021-08-27 07:50:02,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:50:02" (3/3) ... [2021-08-27 07:50:02,380 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2021-08-27 07:50:02,383 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:50:02,384 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-27 07:50:02,424 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:50:02,431 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:50:02,432 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-27 07:50:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 182 states have (on average 1.565934065934066) internal successors, (285), 200 states have internal predecessors, (285), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2021-08-27 07:50:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 07:50:02,474 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:02,474 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:02,475 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:02,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:02,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1842564240, now seen corresponding path program 1 times [2021-08-27 07:50:02,491 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:02,491 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591368494] [2021-08-27 07:50:02,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:02,492 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:02,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:02,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:02,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:50:02,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:02,922 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591368494] [2021-08-27 07:50:02,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591368494] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:02,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:02,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:50:02,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385595203] [2021-08-27 07:50:02,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:02,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:02,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:02,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:02,958 INFO L87 Difference]: Start difference. First operand has 240 states, 182 states have (on average 1.565934065934066) internal successors, (285), 200 states have internal predecessors, (285), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) 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:50:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:03,589 INFO L93 Difference]: Finished difference Result 265 states and 384 transitions. [2021-08-27 07:50:03,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:03,591 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:50:03,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:03,601 INFO L225 Difference]: With dead ends: 265 [2021-08-27 07:50:03,601 INFO L226 Difference]: Without dead ends: 256 [2021-08-27 07:50:03,602 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 111.3ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:03,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-08-27 07:50:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2021-08-27 07:50:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 174 states have (on average 1.5) internal successors, (261), 189 states have internal predecessors, (261), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-08-27 07:50:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 323 transitions. [2021-08-27 07:50:03,648 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 323 transitions. Word has length 15 [2021-08-27 07:50:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:03,648 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 323 transitions. [2021-08-27 07:50:03,649 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:50:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 323 transitions. [2021-08-27 07:50:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 07:50:03,650 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:03,650 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:50:03,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:50:03,650 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:03,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2103448868, now seen corresponding path program 1 times [2021-08-27 07:50:03,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:03,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397852149] [2021-08-27 07:50:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:03,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:03,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:03,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:03,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:03,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397852149] [2021-08-27 07:50:03,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397852149] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:03,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:03,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 07:50:03,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166109600] [2021-08-27 07:50:03,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 07:50:03,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:03,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 07:50:03,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:03,912 INFO L87 Difference]: Start difference. First operand 228 states and 323 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:50:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:04,554 INFO L93 Difference]: Finished difference Result 256 states and 363 transitions. [2021-08-27 07:50:04,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 07:50:04,555 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:50:04,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:04,559 INFO L225 Difference]: With dead ends: 256 [2021-08-27 07:50:04,560 INFO L226 Difference]: Without dead ends: 256 [2021-08-27 07:50:04,561 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 118.4ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:04,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-08-27 07:50:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 228. [2021-08-27 07:50:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 174 states have (on average 1.4942528735632183) internal successors, (260), 189 states have internal predecessors, (260), 38 states have call successors, (38), 17 states have call predecessors, (38), 15 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2021-08-27 07:50:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 322 transitions. [2021-08-27 07:50:04,593 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 322 transitions. Word has length 20 [2021-08-27 07:50:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:04,594 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 322 transitions. [2021-08-27 07:50:04,594 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:50:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 322 transitions. [2021-08-27 07:50:04,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:50:04,596 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:04,604 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:04,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:50:04,605 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:04,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:04,606 INFO L82 PathProgramCache]: Analyzing trace with hash 275687575, now seen corresponding path program 1 times [2021-08-27 07:50:04,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:04,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086522471] [2021-08-27 07:50:04,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:04,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:04,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:04,838 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:04,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:04,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086522471] [2021-08-27 07:50:04,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086522471] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:04,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:04,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:50:04,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766455576] [2021-08-27 07:50:04,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:50:04,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:04,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:50:04,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:50:04,841 INFO L87 Difference]: Start difference. First operand 228 states and 322 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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:50:05,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:05,852 INFO L93 Difference]: Finished difference Result 344 states and 470 transitions. [2021-08-27 07:50:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:50:05,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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 28 [2021-08-27 07:50:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:05,858 INFO L225 Difference]: With dead ends: 344 [2021-08-27 07:50:05,858 INFO L226 Difference]: Without dead ends: 343 [2021-08-27 07:50:05,858 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 223.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:50:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-08-27 07:50:05,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 301. [2021-08-27 07:50:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 237 states have (on average 1.3924050632911393) internal successors, (330), 240 states have internal predecessors, (330), 37 states have call successors, (37), 23 states have call predecessors, (37), 26 states have return successors, (44), 40 states have call predecessors, (44), 29 states have call successors, (44) [2021-08-27 07:50:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2021-08-27 07:50:05,875 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 28 [2021-08-27 07:50:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:05,875 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2021-08-27 07:50:05,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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:50:05,876 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2021-08-27 07:50:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:50:05,877 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:05,877 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:05,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:50:05,877 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:05,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash -306664554, now seen corresponding path program 1 times [2021-08-27 07:50:05,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:05,878 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279952197] [2021-08-27 07:50:05,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:05,878 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:05,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,084 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,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:06,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279952197] [2021-08-27 07:50:06,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279952197] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:06,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:06,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:50:06,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286863814] [2021-08-27 07:50:06,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:50:06,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:06,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:50:06,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:50:06,087 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:50:06,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:06,671 INFO L93 Difference]: Finished difference Result 362 states and 486 transitions. [2021-08-27 07:50:06,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:50:06,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2021-08-27 07:50:06,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:06,674 INFO L225 Difference]: With dead ends: 362 [2021-08-27 07:50:06,674 INFO L226 Difference]: Without dead ends: 362 [2021-08-27 07:50:06,674 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 217.2ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:50:06,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-08-27 07:50:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 341. [2021-08-27 07:50:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 278 states have (on average 1.3848920863309353) internal successors, (385), 279 states have internal predecessors, (385), 33 states have call successors, (33), 23 states have call predecessors, (33), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2021-08-27 07:50:06,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 462 transitions. [2021-08-27 07:50:06,686 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 462 transitions. Word has length 28 [2021-08-27 07:50:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:06,686 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 462 transitions. [2021-08-27 07:50:06,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:50:06,686 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 462 transitions. [2021-08-27 07:50:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-08-27 07:50:06,688 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:06,688 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:50:06,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:50:06,689 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:06,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1014580693, now seen corresponding path program 1 times [2021-08-27 07:50:06,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:06,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627687209] [2021-08-27 07:50:06,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:06,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:06,897 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,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:06,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627687209] [2021-08-27 07:50:06,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627687209] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:06,898 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:06,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:50:06,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160232965] [2021-08-27 07:50:06,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:50:06,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:06,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:50:06,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:50:06,899 INFO L87 Difference]: Start difference. First operand 341 states and 462 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:50:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:07,606 INFO L93 Difference]: Finished difference Result 340 states and 459 transitions. [2021-08-27 07:50:07,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:50:07,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (8), 6 states have call predecessors, (8), 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:50:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:07,608 INFO L225 Difference]: With dead ends: 340 [2021-08-27 07:50:07,608 INFO L226 Difference]: Without dead ends: 340 [2021-08-27 07:50:07,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 196.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:50:07,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2021-08-27 07:50:07,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2021-08-27 07:50:07,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 278 states have (on average 1.3776978417266188) internal successors, (383), 278 states have internal predecessors, (383), 32 states have call successors, (32), 23 states have call predecessors, (32), 29 states have return successors, (44), 39 states have call predecessors, (44), 27 states have call successors, (44) [2021-08-27 07:50:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 459 transitions. [2021-08-27 07:50:07,619 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 459 transitions. Word has length 38 [2021-08-27 07:50:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:07,620 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 459 transitions. [2021-08-27 07:50:07,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 3 states have internal predecessors, (27), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:50:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 459 transitions. [2021-08-27 07:50:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 07:50:07,622 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:07,623 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:50:07,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:50:07,623 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:07,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:07,623 INFO L82 PathProgramCache]: Analyzing trace with hash -366955023, now seen corresponding path program 1 times [2021-08-27 07:50:07,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:07,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987241625] [2021-08-27 07:50:07,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:07,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:50:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,825 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:07,826 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:07,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987241625] [2021-08-27 07:50:07,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987241625] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:07,826 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:07,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:50:07,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020733975] [2021-08-27 07:50:07,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:50:07,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:07,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:50:07,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:50:07,828 INFO L87 Difference]: Start difference. First operand 340 states and 459 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:50:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:08,958 INFO L93 Difference]: Finished difference Result 319 states and 423 transitions. [2021-08-27 07:50:08,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:50:08,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-08-27 07:50:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:08,964 INFO L225 Difference]: With dead ends: 319 [2021-08-27 07:50:08,964 INFO L226 Difference]: Without dead ends: 319 [2021-08-27 07:50:08,965 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 299.3ms TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-08-27 07:50:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 301. [2021-08-27 07:50:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 244 states have (on average 1.3688524590163935) internal successors, (334), 244 states have internal predecessors, (334), 29 states have call successors, (29), 21 states have call predecessors, (29), 27 states have return successors, (39), 36 states have call predecessors, (39), 24 states have call successors, (39) [2021-08-27 07:50:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 402 transitions. [2021-08-27 07:50:08,988 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 402 transitions. Word has length 46 [2021-08-27 07:50:08,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:08,988 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 402 transitions. [2021-08-27 07:50:08,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:50:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 402 transitions. [2021-08-27 07:50:08,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-08-27 07:50:08,994 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:08,994 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:08,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 07:50:08,994 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash 992673928, now seen corresponding path program 1 times [2021-08-27 07:50:08,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:08,999 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984817553] [2021-08-27 07:50:08,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:08,999 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 07:50:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,351 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,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:09,352 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984817553] [2021-08-27 07:50:09,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984817553] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:09,352 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:09,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:09,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310999246] [2021-08-27 07:50:09,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:09,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:09,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:09,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:09,354 INFO L87 Difference]: Start difference. First operand 301 states and 402 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 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:50:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:10,589 INFO L93 Difference]: Finished difference Result 322 states and 425 transitions. [2021-08-27 07:50:10,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:10,590 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 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 45 [2021-08-27 07:50:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:10,593 INFO L225 Difference]: With dead ends: 322 [2021-08-27 07:50:10,593 INFO L226 Difference]: Without dead ends: 322 [2021-08-27 07:50:10,594 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 574.6ms TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-08-27 07:50:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 315. [2021-08-27 07:50:10,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 256 states have (on average 1.359375) internal successors, (348), 255 states have internal predecessors, (348), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2021-08-27 07:50:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 418 transitions. [2021-08-27 07:50:10,622 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 418 transitions. Word has length 45 [2021-08-27 07:50:10,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:10,622 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 418 transitions. [2021-08-27 07:50:10,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 7 states have internal predecessors, (33), 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:50:10,623 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 418 transitions. [2021-08-27 07:50:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 07:50:10,625 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:10,625 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:50:10,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 07:50:10,626 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:10,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:10,626 INFO L82 PathProgramCache]: Analyzing trace with hash 328810937, now seen corresponding path program 1 times [2021-08-27 07:50:10,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:10,627 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458114684] [2021-08-27 07:50:10,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:10,627 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 07:50:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,940 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,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:10,941 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458114684] [2021-08-27 07:50:10,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458114684] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:10,941 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:10,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:10,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064648094] [2021-08-27 07:50:10,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:10,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:10,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:10,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:10,944 INFO L87 Difference]: Start difference. First operand 315 states and 418 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 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:50:11,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:11,974 INFO L93 Difference]: Finished difference Result 322 states and 424 transitions. [2021-08-27 07:50:11,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:11,974 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 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 46 [2021-08-27 07:50:11,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:11,976 INFO L225 Difference]: With dead ends: 322 [2021-08-27 07:50:11,976 INFO L226 Difference]: Without dead ends: 322 [2021-08-27 07:50:11,977 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 561.7ms TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-08-27 07:50:11,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 316. [2021-08-27 07:50:11,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 257 states have (on average 1.3579766536964981) internal successors, (349), 256 states have internal predecessors, (349), 29 states have call successors, (29), 21 states have call predecessors, (29), 29 states have return successors, (41), 38 states have call predecessors, (41), 24 states have call successors, (41) [2021-08-27 07:50:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 419 transitions. [2021-08-27 07:50:11,985 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 419 transitions. Word has length 46 [2021-08-27 07:50:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:11,986 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 419 transitions. [2021-08-27 07:50:11,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 7 states have internal predecessors, (34), 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:50:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 419 transitions. [2021-08-27 07:50:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 07:50:11,987 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:11,988 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:50:11,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:50:11,988 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:11,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:11,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1391975518, now seen corresponding path program 1 times [2021-08-27 07:50:11,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:11,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527732453] [2021-08-27 07:50:11,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:11,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 07:50:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,169 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,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:12,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527732453] [2021-08-27 07:50:12,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527732453] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:12,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:12,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:50:12,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836710300] [2021-08-27 07:50:12,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:50:12,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:12,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:50:12,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:50:12,176 INFO L87 Difference]: Start difference. First operand 316 states and 419 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:12,815 INFO L93 Difference]: Finished difference Result 310 states and 408 transitions. [2021-08-27 07:50:12,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:50:12,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2021-08-27 07:50:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:12,817 INFO L225 Difference]: With dead ends: 310 [2021-08-27 07:50:12,817 INFO L226 Difference]: Without dead ends: 102 [2021-08-27 07:50:12,817 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 257.6ms TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-08-27 07:50:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-08-27 07:50:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 15 states have call successors, (15), 13 states have call predecessors, (15), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2021-08-27 07:50:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2021-08-27 07:50:12,820 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 47 [2021-08-27 07:50:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:12,820 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2021-08-27 07:50:12,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:50:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2021-08-27 07:50:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-27 07:50:12,820 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:12,820 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:50:12,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 07:50:12,821 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:12,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:12,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1240570869, now seen corresponding path program 1 times [2021-08-27 07:50:12,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:12,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538207287] [2021-08-27 07:50:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:12,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-08-27 07:50:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-08-27 07:50:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:13,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:13,031 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538207287] [2021-08-27 07:50:13,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538207287] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:13,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:13,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:50:13,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069472349] [2021-08-27 07:50:13,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:50:13,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:13,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:50:13,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:50:13,032 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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:50:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:13,315 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2021-08-27 07:50:13,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:50:13,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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 53 [2021-08-27 07:50:13,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:13,316 INFO L225 Difference]: With dead ends: 100 [2021-08-27 07:50:13,316 INFO L226 Difference]: Without dead ends: 100 [2021-08-27 07:50:13,317 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 204.2ms TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:50:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-08-27 07:50:13,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-08-27 07:50:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2021-08-27 07:50:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2021-08-27 07:50:13,320 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 53 [2021-08-27 07:50:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:13,322 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2021-08-27 07:50:13,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 3 states have internal predecessors, (37), 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:50:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2021-08-27 07:50:13,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-08-27 07:50:13,323 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:13,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] [2021-08-27 07:50:13,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 07:50:13,324 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:13,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash 508196442, now seen corresponding path program 1 times [2021-08-27 07:50:13,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:13,329 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197114226] [2021-08-27 07:50:13,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:13,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:50:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,654 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,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:13,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197114226] [2021-08-27 07:50:13,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197114226] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:13,655 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:13,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:13,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23196047] [2021-08-27 07:50:13,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:13,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:13,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:13,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:13,657 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 5 states have internal predecessors, (41), 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:50:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:13,853 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2021-08-27 07:50:13,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:50:13,853 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 5 states have internal predecessors, (41), 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 57 [2021-08-27 07:50:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:13,854 INFO L225 Difference]: With dead ends: 93 [2021-08-27 07:50:13,854 INFO L226 Difference]: Without dead ends: 93 [2021-08-27 07:50:13,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 192.8ms TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:13,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-27 07:50:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-08-27 07:50:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.173913043478261) internal successors, (81), 70 states have internal predecessors, (81), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2021-08-27 07:50:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2021-08-27 07:50:13,857 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 57 [2021-08-27 07:50:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:13,857 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2021-08-27 07:50:13,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 5 states have internal predecessors, (41), 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:50:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2021-08-27 07:50:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 07:50:13,858 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:13,858 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:50:13,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:50:13,858 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:13,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:13,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1993240723, now seen corresponding path program 1 times [2021-08-27 07:50:13,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:13,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785684911] [2021-08-27 07:50:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:13,859 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:50:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,125 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,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:14,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785684911] [2021-08-27 07:50:14,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785684911] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:14,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:14,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:14,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480202327] [2021-08-27 07:50:14,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:14,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:14,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:14,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:14,128 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 6 states have internal predecessors, (43), 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:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:14,569 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2021-08-27 07:50:14,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:50:14,570 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 6 states have internal predecessors, (43), 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 61 [2021-08-27 07:50:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:14,572 INFO L225 Difference]: With dead ends: 93 [2021-08-27 07:50:14,572 INFO L226 Difference]: Without dead ends: 93 [2021-08-27 07:50:14,573 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 374.5ms TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:14,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-27 07:50:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-08-27 07:50:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 70 states have internal predecessors, (80), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2021-08-27 07:50:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2021-08-27 07:50:14,575 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 61 [2021-08-27 07:50:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:14,576 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2021-08-27 07:50:14,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 6 states have internal predecessors, (43), 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:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2021-08-27 07:50:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:50:14,577 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:14,577 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:14,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:50:14,577 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:14,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:14,578 INFO L82 PathProgramCache]: Analyzing trace with hash 726507320, now seen corresponding path program 1 times [2021-08-27 07:50:14,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:14,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167063925] [2021-08-27 07:50:14,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:14,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:50:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,819 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,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:14,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167063925] [2021-08-27 07:50:14,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167063925] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:14,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:14,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:50:14,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752325517] [2021-08-27 07:50:14,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:50:14,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:14,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:50:14,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:50:14,821 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 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:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:15,019 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2021-08-27 07:50:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:50:15,020 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 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 63 [2021-08-27 07:50:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:15,021 INFO L225 Difference]: With dead ends: 96 [2021-08-27 07:50:15,021 INFO L226 Difference]: Without dead ends: 96 [2021-08-27 07:50:15,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 150.8ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:50:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-08-27 07:50:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-08-27 07:50:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 73 states have internal predecessors, (83), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2021-08-27 07:50:15,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2021-08-27 07:50:15,024 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 63 [2021-08-27 07:50:15,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:15,024 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2021-08-27 07:50:15,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 3 states have internal predecessors, (45), 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:15,024 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2021-08-27 07:50:15,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:50:15,025 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:15,025 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:15,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 07:50:15,025 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:15,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:15,026 INFO L82 PathProgramCache]: Analyzing trace with hash 139701306, now seen corresponding path program 1 times [2021-08-27 07:50:15,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:15,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253404353] [2021-08-27 07:50:15,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:15,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:50:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,289 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:15,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:15,289 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253404353] [2021-08-27 07:50:15,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253404353] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:15,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:15,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:15,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765567330] [2021-08-27 07:50:15,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:15,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:15,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:15,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:15,291 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 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:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:15,500 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2021-08-27 07:50:15,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:50:15,500 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 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 63 [2021-08-27 07:50:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:15,501 INFO L225 Difference]: With dead ends: 105 [2021-08-27 07:50:15,501 INFO L226 Difference]: Without dead ends: 95 [2021-08-27 07:50:15,501 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 187.2ms TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:50:15,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-27 07:50:15,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2021-08-27 07:50:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 68 states have internal predecessors, (76), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2021-08-27 07:50:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2021-08-27 07:50:15,504 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 63 [2021-08-27 07:50:15,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:15,504 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2021-08-27 07:50:15,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 5 states have internal predecessors, (45), 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:15,504 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2021-08-27 07:50:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-27 07:50:15,505 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:15,505 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:15,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 07:50:15,505 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:15,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:15,505 INFO L82 PathProgramCache]: Analyzing trace with hash -422329367, now seen corresponding path program 1 times [2021-08-27 07:50:15,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:15,505 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568613015] [2021-08-27 07:50:15,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:15,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:50:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,694 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:15,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:15,694 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568613015] [2021-08-27 07:50:15,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568613015] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:15,694 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:15,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:50:15,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623163993] [2021-08-27 07:50:15,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:50:15,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:15,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:50:15,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:50:15,695 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:50:15,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:15,893 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2021-08-27 07:50:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:50:15,893 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2021-08-27 07:50:15,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:15,894 INFO L225 Difference]: With dead ends: 104 [2021-08-27 07:50:15,894 INFO L226 Difference]: Without dead ends: 102 [2021-08-27 07:50:15,894 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 193.0ms TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:50:15,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-08-27 07:50:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2021-08-27 07:50:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 70 states have internal predecessors, (77), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2021-08-27 07:50:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2021-08-27 07:50:15,897 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 64 [2021-08-27 07:50:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:15,897 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2021-08-27 07:50:15,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (11), 8 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:50:15,898 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2021-08-27 07:50:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-08-27 07:50:15,898 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:15,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:15,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 07:50:15,898 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:15,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:15,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1957822650, now seen corresponding path program 1 times [2021-08-27 07:50:15,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:15,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8895226] [2021-08-27 07:50:15,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:15,899 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:50:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,128 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,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:16,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8895226] [2021-08-27 07:50:16,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8895226] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:16,129 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:16,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:16,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353815481] [2021-08-27 07:50:16,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:16,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:16,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:16,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:16,130 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 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:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:16,369 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2021-08-27 07:50:16,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:50:16,370 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), 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 64 [2021-08-27 07:50:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:16,371 INFO L225 Difference]: With dead ends: 93 [2021-08-27 07:50:16,371 INFO L226 Difference]: Without dead ends: 93 [2021-08-27 07:50:16,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 169.7ms TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:50:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-27 07:50:16,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-08-27 07:50:16,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 70 states have internal predecessors, (76), 14 states have call successors, (14), 13 states have call predecessors, (14), 9 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2021-08-27 07:50:16,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2021-08-27 07:50:16,374 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 64 [2021-08-27 07:50:16,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:16,374 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2021-08-27 07:50:16,374 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), 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:16,374 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2021-08-27 07:50:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-27 07:50:16,375 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:16,375 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] [2021-08-27 07:50:16,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 07:50:16,375 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:16,376 INFO L82 PathProgramCache]: Analyzing trace with hash -445098009, now seen corresponding path program 1 times [2021-08-27 07:50:16,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:16,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262144225] [2021-08-27 07:50:16,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:16,376 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:50:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,568 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,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:16,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262144225] [2021-08-27 07:50:16,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262144225] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:16,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:16,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:50:16,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707024774] [2021-08-27 07:50:16,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:50:16,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:16,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:50:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:50:16,571 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:50:16,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:16,794 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2021-08-27 07:50:16,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:50:16,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2021-08-27 07:50:16,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:16,795 INFO L225 Difference]: With dead ends: 88 [2021-08-27 07:50:16,795 INFO L226 Difference]: Without dead ends: 78 [2021-08-27 07:50:16,796 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 205.7ms TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-08-27 07:50:16,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-08-27 07:50:16,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 07:50:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-08-27 07:50:16,798 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2021-08-27 07:50:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:16,799 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-08-27 07:50:16,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:50:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-08-27 07:50:16,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-27 07:50:16,800 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:16,800 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:16,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 07:50:16,800 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:16,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:16,801 INFO L82 PathProgramCache]: Analyzing trace with hash 362782196, now seen corresponding path program 1 times [2021-08-27 07:50:16,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:16,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933519898] [2021-08-27 07:50:16,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:16,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:50:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,066 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,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:17,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933519898] [2021-08-27 07:50:17,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933519898] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:17,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:17,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:17,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722435302] [2021-08-27 07:50:17,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:17,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:17,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:17,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:17,068 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:17,270 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2021-08-27 07:50:17,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:50:17,270 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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 65 [2021-08-27 07:50:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:17,271 INFO L225 Difference]: With dead ends: 78 [2021-08-27 07:50:17,271 INFO L226 Difference]: Without dead ends: 78 [2021-08-27 07:50:17,272 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 189.0ms TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:50:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-08-27 07:50:17,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-08-27 07:50:17,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 57 states have internal predecessors, (60), 12 states have call successors, (12), 12 states have call predecessors, (12), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-08-27 07:50:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2021-08-27 07:50:17,274 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 65 [2021-08-27 07:50:17,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:17,274 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2021-08-27 07:50:17,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 5 states have internal predecessors, (47), 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:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2021-08-27 07:50:17,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-27 07:50:17,275 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:17,276 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] [2021-08-27 07:50:17,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:50:17,276 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:17,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:17,277 INFO L82 PathProgramCache]: Analyzing trace with hash -137527127, now seen corresponding path program 1 times [2021-08-27 07:50:17,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:17,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401708894] [2021-08-27 07:50:17,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:17,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-08-27 07:50:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:50:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,520 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,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:17,520 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401708894] [2021-08-27 07:50:17,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401708894] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:17,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:17,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:50:17,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121079477] [2021-08-27 07:50:17,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:50:17,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:50:17,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:50:17,523 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:50:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:17,745 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2021-08-27 07:50:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:50:17,745 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2021-08-27 07:50:17,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:17,746 INFO L225 Difference]: With dead ends: 60 [2021-08-27 07:50:17,746 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 07:50:17,746 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 235.1ms TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:50:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 07:50:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 07:50:17,747 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:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 07:50:17,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2021-08-27 07:50:17,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:17,747 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 07:50:17,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:50:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 07:50:17,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 07:50:17,750 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:50:17,751 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:50:17,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 07:50:17,758 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:50:17,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:50:17 BoogieIcfgContainer [2021-08-27 07:50:17,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:50:17,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:50:17,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:50:17,761 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:50:17,761 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:50:02" (3/4) ... [2021-08-27 07:50:17,764 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 07:50:17,770 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-08-27 07:50:17,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2021-08-27 07:50:17,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2021-08-27 07:50:17,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2021-08-27 07:50:17,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Power [2021-08-27 07:50:17,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2021-08-27 07:50:17,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-08-27 07:50:17,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-08-27 07:50:17,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-08-27 07:50:17,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-08-27 07:50:17,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2021-08-27 07:50:17,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-08-27 07:50:17,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_CreateClose [2021-08-27 07:50:17,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_InternIoCtl [2021-08-27 07:50:17,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-08-27 07:50:17,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-08-27 07:50:17,773 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_DispatchPassThrough [2021-08-27 07:50:17,773 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_PnP [2021-08-27 07:50:17,792 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 41 nodes and edges [2021-08-27 07:50:17,793 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-08-27 07:50:17,794 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-27 07:50:17,795 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-27 07:50:17,894 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 07:50:17,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:50:17,896 INFO L168 Benchmark]: Toolchain (without parser) took 16881.45 ms. Allocated memory was 50.3 MB in the beginning and 249.6 MB in the end (delta: 199.2 MB). Free memory was 27.0 MB in the beginning and 140.9 MB in the end (delta: -113.9 MB). Peak memory consumption was 84.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:17,896 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 50.3 MB. Free memory was 32.4 MB in the beginning and 32.3 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:50:17,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.37 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 26.7 MB in the beginning and 39.9 MB in the end (delta: -13.2 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:17,897 INFO L168 Benchmark]: Boogie Preprocessor took 55.90 ms. Allocated memory is still 60.8 MB. Free memory was 39.9 MB in the beginning and 36.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:17,897 INFO L168 Benchmark]: RCFGBuilder took 909.75 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 36.7 MB in the beginning and 45.4 MB in the end (delta: -8.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:17,898 INFO L168 Benchmark]: TraceAbstraction took 15386.12 ms. Allocated memory was 73.4 MB in the beginning and 249.6 MB in the end (delta: 176.2 MB). Free memory was 45.0 MB in the beginning and 155.5 MB in the end (delta: -110.6 MB). Peak memory consumption was 63.9 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:17,898 INFO L168 Benchmark]: Witness Printer took 133.28 ms. Allocated memory is still 249.6 MB. Free memory was 155.5 MB in the beginning and 140.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:17,900 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.11 ms. Allocated memory is still 50.3 MB. Free memory was 32.4 MB in the beginning and 32.3 MB in the end (delta: 38.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 388.37 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 26.7 MB in the beginning and 39.9 MB in the end (delta: -13.2 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.90 ms. Allocated memory is still 60.8 MB. Free memory was 39.9 MB in the beginning and 36.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 909.75 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 36.7 MB in the beginning and 45.4 MB in the end (delta: -8.6 MB). Peak memory consumption was 20.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15386.12 ms. Allocated memory was 73.4 MB in the beginning and 249.6 MB in the end (delta: 176.2 MB). Free memory was 45.0 MB in the beginning and 155.5 MB in the end (delta: -110.6 MB). Peak memory consumption was 63.9 MB. Max. memory is 16.1 GB. * Witness Printer took 133.28 ms. Allocated memory is still 249.6 MB. Free memory was 155.5 MB in the beginning and 140.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 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: 295]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1013]: 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 19 procedures, 243 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 15338.1ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 40.9ms, AutomataDifference: 10119.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3203 SDtfs, 5290 SDslu, 3440 SDs, 0 SdLazy, 6525 SolverSat, 1186 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6230.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 358 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 4662.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=341occurred in iteration=4, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 188.6ms AutomataMinimizationTime, 19 MinimizatonAttempts, 163 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 80.7ms SsaConstructionTime, 346.5ms SatisfiabilityAnalysisTime, 4264.2ms InterpolantComputationTime, 944 NumberOfCodeBlocks, 944 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 925 ConstructedInterpolants, 0 QuantifiedInterpolants, 4851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-08-27 07:50:17,938 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...