./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_11.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/locks/test_locks_11.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 a93221bc263791497331acd2a7a0150037c621aa ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:50:31,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:50:31,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:50:31,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:50:31,712 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:50:31,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:50:31,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:50:31,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:50:31,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:50:31,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:50:31,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:50:31,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:50:31,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:50:31,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:50:31,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:50:31,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:50:31,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:50:31,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:50:31,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:50:31,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:50:31,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:50:31,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:50:31,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:50:31,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:50:31,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:50:31,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:50:31,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:50:31,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:50:31,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:50:31,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:50:31,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:50:31,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:50:31,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:50:31,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:50:31,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:50:31,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:50:31,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:50:31,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:50:31,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:50:31,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:50:31,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:50:31,773 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:50:31,795 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:50:31,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:50:31,796 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:50:31,796 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:50:31,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:50:31,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:50:31,798 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:50:31,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:50:31,798 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:50:31,798 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:50:31,798 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:50:31,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:50:31,799 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:50:31,799 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:50:31,799 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:50:31,799 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:50:31,800 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:50:31,800 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:50:31,800 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:50:31,800 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:50:31,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:50:31,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:50:31,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:50:31,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:50:31,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:50:31,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:50:31,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:50:31,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:50:31,802 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:50:31,802 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 -> a93221bc263791497331acd2a7a0150037c621aa [2021-08-27 07:50:32,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:50:32,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:50:32,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:50:32,111 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:50:32,112 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:50:32,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2021-08-27 07:50:32,171 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade42cecf/6c7d8b5566e74b009a47528c48fa20bb/FLAGf6c876031 [2021-08-27 07:50:32,578 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:50:32,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2021-08-27 07:50:32,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade42cecf/6c7d8b5566e74b009a47528c48fa20bb/FLAGf6c876031 [2021-08-27 07:50:32,603 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ade42cecf/6c7d8b5566e74b009a47528c48fa20bb [2021-08-27 07:50:32,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:50:32,607 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:50:32,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:50:32,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:50:32,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:50:32,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:50:32" (1/1) ... [2021-08-27 07:50:32,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63efb4d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:32, skipping insertion in model container [2021-08-27 07:50:32,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:50:32" (1/1) ... [2021-08-27 07:50:32,623 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:50:32,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:50:32,826 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/locks/test_locks_11.c[4246,4259] [2021-08-27 07:50:32,833 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:50:32,842 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:50:32,886 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/locks/test_locks_11.c[4246,4259] [2021-08-27 07:50:32,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:50:32,914 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:50:32,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:32 WrapperNode [2021-08-27 07:50:32,915 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:50:32,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:50:32,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:50:32,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:50:32,928 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:32" (1/1) ... [2021-08-27 07:50:32,928 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:32" (1/1) ... [2021-08-27 07:50:32,942 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:32" (1/1) ... [2021-08-27 07:50:32,942 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:32" (1/1) ... [2021-08-27 07:50:32,954 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:32" (1/1) ... [2021-08-27 07:50:32,965 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:32" (1/1) ... [2021-08-27 07:50:32,969 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:32" (1/1) ... [2021-08-27 07:50:32,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:50:32,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:50:32,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:50:32,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:50:32,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:32" (1/1) ... [2021-08-27 07:50:32,985 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:50:32,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:50:33,006 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:33,034 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:33,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:50:33,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:50:33,052 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:50:33,052 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:50:33,052 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:50:33,053 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:50:33,053 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:50:33,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:50:33,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 07:50:33,054 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:50:33,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:50:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:50:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:50:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:50:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:50:33,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:50:33,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:50:33,490 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-27 07:50:33,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:50:33 BoogieIcfgContainer [2021-08-27 07:50:33,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:50:33,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:50:33,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:50:33,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:50:33,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:50:32" (1/3) ... [2021-08-27 07:50:33,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501eec32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:50:33, skipping insertion in model container [2021-08-27 07:50:33,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:50:32" (2/3) ... [2021-08-27 07:50:33,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@501eec32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:50:33, skipping insertion in model container [2021-08-27 07:50:33,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:50:33" (3/3) ... [2021-08-27 07:50:33,501 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2021-08-27 07:50:33,508 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:50:33,509 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-27 07:50:33,549 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:50:33,556 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:33,557 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-27 07:50:33,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 44 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-08-27 07:50:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-27 07:50:33,577 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:33,577 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:33,578 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:33,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:33,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1865055063, now seen corresponding path program 1 times [2021-08-27 07:50:33,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:33,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725877618] [2021-08-27 07:50:33,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:33,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:33,836 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:33,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:33,837 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725877618] [2021-08-27 07:50:33,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725877618] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:33,838 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:33,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:50:33,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203989580] [2021-08-27 07:50:33,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 07:50:33,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:33,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 07:50:33,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:33,856 INFO L87 Difference]: Start difference. First operand has 49 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 44 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:33,885 INFO L93 Difference]: Finished difference Result 48 states and 80 transitions. [2021-08-27 07:50:33,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 07:50:33,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2021-08-27 07:50:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:33,893 INFO L225 Difference]: With dead ends: 48 [2021-08-27 07:50:33,893 INFO L226 Difference]: Without dead ends: 43 [2021-08-27 07:50:33,894 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 07:50:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2021-08-27 07:50:33,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2021-08-27 07:50:33,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2021-08-27 07:50:33,922 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 75 transitions. Word has length 9 [2021-08-27 07:50:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:33,923 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 75 transitions. [2021-08-27 07:50:33,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:33,923 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 75 transitions. [2021-08-27 07:50:33,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 07:50:33,924 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:33,924 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] [2021-08-27 07:50:33,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:50:33,925 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:33,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:33,925 INFO L82 PathProgramCache]: Analyzing trace with hash 699996050, now seen corresponding path program 1 times [2021-08-27 07:50:33,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:33,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473831565] [2021-08-27 07:50:33,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:33,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,052 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:34,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:34,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473831565] [2021-08-27 07:50:34,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473831565] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:34,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:34,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:34,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181315507] [2021-08-27 07:50:34,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:34,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:34,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:34,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:34,065 INFO L87 Difference]: Start difference. First operand 43 states and 75 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:34,237 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2021-08-27 07:50:34,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:34,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 07:50:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:34,239 INFO L225 Difference]: With dead ends: 79 [2021-08-27 07:50:34,249 INFO L226 Difference]: Without dead ends: 79 [2021-08-27 07:50:34,250 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:34,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-08-27 07:50:34,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2021-08-27 07:50:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2021-08-27 07:50:34,258 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2021-08-27 07:50:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:34,259 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2021-08-27 07:50:34,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2021-08-27 07:50:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 07:50:34,260 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:34,260 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] [2021-08-27 07:50:34,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:50:34,260 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:34,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash -311121200, now seen corresponding path program 1 times [2021-08-27 07:50:34,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:34,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273298117] [2021-08-27 07:50:34,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:34,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:34,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,376 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:34,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:34,377 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273298117] [2021-08-27 07:50:34,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273298117] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:34,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:34,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:34,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728841791] [2021-08-27 07:50:34,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:34,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:34,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:34,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:34,379 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:34,572 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2021-08-27 07:50:34,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:34,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-08-27 07:50:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:34,579 INFO L225 Difference]: With dead ends: 79 [2021-08-27 07:50:34,580 INFO L226 Difference]: Without dead ends: 79 [2021-08-27 07:50:34,581 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 57.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:34,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-08-27 07:50:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2021-08-27 07:50:34,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 138 transitions. [2021-08-27 07:50:34,596 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 138 transitions. Word has length 22 [2021-08-27 07:50:34,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:34,596 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 138 transitions. [2021-08-27 07:50:34,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 138 transitions. [2021-08-27 07:50:34,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 07:50:34,597 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:34,597 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:34,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:50:34,598 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:34,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:34,598 INFO L82 PathProgramCache]: Analyzing trace with hash 225254129, now seen corresponding path program 1 times [2021-08-27 07:50:34,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:34,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045446612] [2021-08-27 07:50:34,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:34,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,671 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:34,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:34,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045446612] [2021-08-27 07:50:34,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045446612] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:34,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:34,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:34,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720763853] [2021-08-27 07:50:34,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:34,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:34,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:34,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:34,673 INFO L87 Difference]: Start difference. First operand 77 states and 138 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:34,806 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2021-08-27 07:50:34,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:34,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 07:50:34,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:34,807 INFO L225 Difference]: With dead ends: 82 [2021-08-27 07:50:34,807 INFO L226 Difference]: Without dead ends: 82 [2021-08-27 07:50:34,808 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:34,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-08-27 07:50:34,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2021-08-27 07:50:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 140 transitions. [2021-08-27 07:50:34,814 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 140 transitions. Word has length 23 [2021-08-27 07:50:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:34,814 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 140 transitions. [2021-08-27 07:50:34,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 140 transitions. [2021-08-27 07:50:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 07:50:34,815 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:34,815 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:34,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:50:34,815 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:34,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:34,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1054609549, now seen corresponding path program 1 times [2021-08-27 07:50:34,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:34,816 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065327888] [2021-08-27 07:50:34,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:34,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:34,881 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:34,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:34,882 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065327888] [2021-08-27 07:50:34,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065327888] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:34,882 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:34,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:34,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555465709] [2021-08-27 07:50:34,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:34,883 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:34,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:34,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:34,884 INFO L87 Difference]: Start difference. First operand 80 states and 140 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:35,014 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2021-08-27 07:50:35,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:35,014 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 07:50:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:35,015 INFO L225 Difference]: With dead ends: 149 [2021-08-27 07:50:35,015 INFO L226 Difference]: Without dead ends: 149 [2021-08-27 07:50:35,016 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-08-27 07:50:35,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2021-08-27 07:50:35,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 261 transitions. [2021-08-27 07:50:35,027 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 261 transitions. Word has length 23 [2021-08-27 07:50:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:35,028 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 261 transitions. [2021-08-27 07:50:35,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 261 transitions. [2021-08-27 07:50:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 07:50:35,029 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:35,029 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:35,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:50:35,029 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:35,030 INFO L82 PathProgramCache]: Analyzing trace with hash -43492299, now seen corresponding path program 1 times [2021-08-27 07:50:35,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:35,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527694125] [2021-08-27 07:50:35,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:35,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,101 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:35,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:35,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527694125] [2021-08-27 07:50:35,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527694125] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:35,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:35,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:35,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385729198] [2021-08-27 07:50:35,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:35,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:35,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:35,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:35,104 INFO L87 Difference]: Start difference. First operand 147 states and 261 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:35,243 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2021-08-27 07:50:35,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:35,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2021-08-27 07:50:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:35,245 INFO L225 Difference]: With dead ends: 189 [2021-08-27 07:50:35,245 INFO L226 Difference]: Without dead ends: 189 [2021-08-27 07:50:35,246 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-08-27 07:50:35,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 147. [2021-08-27 07:50:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 259 transitions. [2021-08-27 07:50:35,267 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 259 transitions. Word has length 23 [2021-08-27 07:50:35,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:35,268 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 259 transitions. [2021-08-27 07:50:35,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 259 transitions. [2021-08-27 07:50:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:50:35,274 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:35,274 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:35,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 07:50:35,275 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:35,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:35,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1667055749, now seen corresponding path program 1 times [2021-08-27 07:50:35,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:35,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746909220] [2021-08-27 07:50:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:35,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:35,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:35,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746909220] [2021-08-27 07:50:35,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746909220] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:35,365 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:35,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:35,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474438501] [2021-08-27 07:50:35,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:35,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:35,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:35,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:35,367 INFO L87 Difference]: Start difference. First operand 147 states and 259 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:35,505 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2021-08-27 07:50:35,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:35,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 07:50:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:35,507 INFO L225 Difference]: With dead ends: 273 [2021-08-27 07:50:35,507 INFO L226 Difference]: Without dead ends: 273 [2021-08-27 07:50:35,508 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:35,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-08-27 07:50:35,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 199. [2021-08-27 07:50:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 349 transitions. [2021-08-27 07:50:35,518 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 349 transitions. Word has length 24 [2021-08-27 07:50:35,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:35,518 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 349 transitions. [2021-08-27 07:50:35,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,521 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 349 transitions. [2021-08-27 07:50:35,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-08-27 07:50:35,523 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:35,523 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:35,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 07:50:35,523 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:35,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:35,528 INFO L82 PathProgramCache]: Analyzing trace with hash 655938499, now seen corresponding path program 1 times [2021-08-27 07:50:35,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:35,529 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858891769] [2021-08-27 07:50:35,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:35,529 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,608 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:35,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:35,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858891769] [2021-08-27 07:50:35,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858891769] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:35,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:35,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:35,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79523029] [2021-08-27 07:50:35,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:35,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:35,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:35,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:35,612 INFO L87 Difference]: Start difference. First operand 199 states and 349 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:35,726 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2021-08-27 07:50:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:35,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2021-08-27 07:50:35,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:35,728 INFO L225 Difference]: With dead ends: 281 [2021-08-27 07:50:35,728 INFO L226 Difference]: Without dead ends: 281 [2021-08-27 07:50:35,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:35,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-08-27 07:50:35,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2021-08-27 07:50:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 487 transitions. [2021-08-27 07:50:35,738 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 487 transitions. Word has length 24 [2021-08-27 07:50:35,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:35,739 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 487 transitions. [2021-08-27 07:50:35,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 487 transitions. [2021-08-27 07:50:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:50:35,742 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:35,742 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:35,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:50:35,743 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:35,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:35,745 INFO L82 PathProgramCache]: Analyzing trace with hash 139334408, now seen corresponding path program 1 times [2021-08-27 07:50:35,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:35,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386278439] [2021-08-27 07:50:35,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:35,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:35,815 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:35,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:35,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386278439] [2021-08-27 07:50:35,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386278439] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:35,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:35,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:35,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97553880] [2021-08-27 07:50:35,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:35,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:35,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:35,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:35,818 INFO L87 Difference]: Start difference. First operand 279 states and 487 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:35,930 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2021-08-27 07:50:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:35,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 07:50:35,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:35,933 INFO L225 Difference]: With dead ends: 287 [2021-08-27 07:50:35,933 INFO L226 Difference]: Without dead ends: 287 [2021-08-27 07:50:35,934 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 43.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:35,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-08-27 07:50:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2021-08-27 07:50:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 491 transitions. [2021-08-27 07:50:35,945 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 491 transitions. Word has length 25 [2021-08-27 07:50:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:35,945 INFO L470 AbstractCegarLoop]: Abstraction has 285 states and 491 transitions. [2021-08-27 07:50:35,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 491 transitions. [2021-08-27 07:50:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:50:35,946 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:35,947 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:35,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 07:50:35,947 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:35,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1140529270, now seen corresponding path program 1 times [2021-08-27 07:50:35,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:35,948 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534075487] [2021-08-27 07:50:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:35,948 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,011 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:36,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:36,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534075487] [2021-08-27 07:50:36,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534075487] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:36,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:36,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:36,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026000300] [2021-08-27 07:50:36,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:36,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:36,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:36,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:36,013 INFO L87 Difference]: Start difference. First operand 285 states and 491 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:36,139 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2021-08-27 07:50:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:36,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 07:50:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:36,141 INFO L225 Difference]: With dead ends: 523 [2021-08-27 07:50:36,142 INFO L226 Difference]: Without dead ends: 523 [2021-08-27 07:50:36,142 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 49.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-08-27 07:50:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 393. [2021-08-27 07:50:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 667 transitions. [2021-08-27 07:50:36,150 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 667 transitions. Word has length 25 [2021-08-27 07:50:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:36,150 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 667 transitions. [2021-08-27 07:50:36,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,150 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 667 transitions. [2021-08-27 07:50:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:50:36,151 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:36,151 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:36,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 07:50:36,151 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:36,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2143320776, now seen corresponding path program 1 times [2021-08-27 07:50:36,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:36,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495027820] [2021-08-27 07:50:36,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:36,152 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,192 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:36,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:36,192 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495027820] [2021-08-27 07:50:36,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495027820] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:36,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:36,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:36,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269505669] [2021-08-27 07:50:36,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:36,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:36,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:36,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:36,194 INFO L87 Difference]: Start difference. First operand 393 states and 667 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:36,300 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2021-08-27 07:50:36,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:36,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2021-08-27 07:50:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:36,302 INFO L225 Difference]: With dead ends: 547 [2021-08-27 07:50:36,302 INFO L226 Difference]: Without dead ends: 547 [2021-08-27 07:50:36,303 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-08-27 07:50:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2021-08-27 07:50:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 919 transitions. [2021-08-27 07:50:36,313 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 919 transitions. Word has length 25 [2021-08-27 07:50:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:36,314 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 919 transitions. [2021-08-27 07:50:36,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 919 transitions. [2021-08-27 07:50:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:50:36,315 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:36,315 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:36,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:50:36,315 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:36,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:36,316 INFO L82 PathProgramCache]: Analyzing trace with hash -996454920, now seen corresponding path program 1 times [2021-08-27 07:50:36,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:36,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047029420] [2021-08-27 07:50:36,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:36,316 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,360 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:36,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:36,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047029420] [2021-08-27 07:50:36,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047029420] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:36,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:36,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:36,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54740073] [2021-08-27 07:50:36,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:36,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:36,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:36,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:36,361 INFO L87 Difference]: Start difference. First operand 545 states and 919 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:36,473 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2021-08-27 07:50:36,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:36,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 07:50:36,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:36,477 INFO L225 Difference]: With dead ends: 555 [2021-08-27 07:50:36,477 INFO L226 Difference]: Without dead ends: 555 [2021-08-27 07:50:36,477 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-08-27 07:50:36,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 553. [2021-08-27 07:50:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 919 transitions. [2021-08-27 07:50:36,487 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 919 transitions. Word has length 26 [2021-08-27 07:50:36,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:36,487 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 919 transitions. [2021-08-27 07:50:36,487 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 919 transitions. [2021-08-27 07:50:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:50:36,488 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:36,488 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:36,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:50:36,489 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:36,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:36,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2018648698, now seen corresponding path program 1 times [2021-08-27 07:50:36,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:36,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866521475] [2021-08-27 07:50:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:36,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,542 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:36,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:36,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866521475] [2021-08-27 07:50:36,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866521475] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:36,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:36,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:36,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399708911] [2021-08-27 07:50:36,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:36,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:36,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:36,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:36,544 INFO L87 Difference]: Start difference. First operand 553 states and 919 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:36,660 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2021-08-27 07:50:36,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:36,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 07:50:36,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:36,665 INFO L225 Difference]: With dead ends: 1003 [2021-08-27 07:50:36,665 INFO L226 Difference]: Without dead ends: 1003 [2021-08-27 07:50:36,665 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:36,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2021-08-27 07:50:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 777. [2021-08-27 07:50:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1263 transitions. [2021-08-27 07:50:36,682 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1263 transitions. Word has length 26 [2021-08-27 07:50:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:36,682 INFO L470 AbstractCegarLoop]: Abstraction has 777 states and 1263 transitions. [2021-08-27 07:50:36,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1263 transitions. [2021-08-27 07:50:36,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 07:50:36,684 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:36,684 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:36,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 07:50:36,684 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:36,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:36,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1007531448, now seen corresponding path program 1 times [2021-08-27 07:50:36,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:36,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67620292] [2021-08-27 07:50:36,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:36,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,726 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:36,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:36,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67620292] [2021-08-27 07:50:36,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67620292] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:36,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:36,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:36,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415909942] [2021-08-27 07:50:36,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:36,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:36,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:36,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:36,729 INFO L87 Difference]: Start difference. First operand 777 states and 1263 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:36,839 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2021-08-27 07:50:36,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:36,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-08-27 07:50:36,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:36,844 INFO L225 Difference]: With dead ends: 1067 [2021-08-27 07:50:36,844 INFO L226 Difference]: Without dead ends: 1067 [2021-08-27 07:50:36,845 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:36,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2021-08-27 07:50:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1065. [2021-08-27 07:50:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1719 transitions. [2021-08-27 07:50:36,864 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1719 transitions. Word has length 26 [2021-08-27 07:50:36,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:36,864 INFO L470 AbstractCegarLoop]: Abstraction has 1065 states and 1719 transitions. [2021-08-27 07:50:36,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:36,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1719 transitions. [2021-08-27 07:50:36,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 07:50:36,866 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:36,866 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] [2021-08-27 07:50:36,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 07:50:36,866 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:36,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:36,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1846185379, now seen corresponding path program 1 times [2021-08-27 07:50:36,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:36,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203533499] [2021-08-27 07:50:36,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:36,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:36,904 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:36,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:36,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203533499] [2021-08-27 07:50:36,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203533499] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:36,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:36,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:36,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177168008] [2021-08-27 07:50:36,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:36,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:36,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:36,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:36,906 INFO L87 Difference]: Start difference. First operand 1065 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:37,009 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2021-08-27 07:50:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:37,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 07:50:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:37,013 INFO L225 Difference]: With dead ends: 1083 [2021-08-27 07:50:37,013 INFO L226 Difference]: Without dead ends: 1083 [2021-08-27 07:50:37,014 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2021-08-27 07:50:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1081. [2021-08-27 07:50:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1719 transitions. [2021-08-27 07:50:37,039 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1719 transitions. Word has length 27 [2021-08-27 07:50:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:37,040 INFO L470 AbstractCegarLoop]: Abstraction has 1081 states and 1719 transitions. [2021-08-27 07:50:37,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1719 transitions. [2021-08-27 07:50:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 07:50:37,041 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:37,041 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:37,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 07:50:37,042 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:37,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:37,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1168918239, now seen corresponding path program 1 times [2021-08-27 07:50:37,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:37,043 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409092903] [2021-08-27 07:50:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:37,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,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:37,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:37,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409092903] [2021-08-27 07:50:37,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409092903] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:37,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:37,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:37,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507450143] [2021-08-27 07:50:37,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:37,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:37,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:37,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:37,087 INFO L87 Difference]: Start difference. First operand 1081 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:37,190 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2021-08-27 07:50:37,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:37,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 07:50:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:37,196 INFO L225 Difference]: With dead ends: 1931 [2021-08-27 07:50:37,197 INFO L226 Difference]: Without dead ends: 1931 [2021-08-27 07:50:37,197 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:37,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2021-08-27 07:50:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1545. [2021-08-27 07:50:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2391 transitions. [2021-08-27 07:50:37,226 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2391 transitions. Word has length 27 [2021-08-27 07:50:37,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:37,226 INFO L470 AbstractCegarLoop]: Abstraction has 1545 states and 2391 transitions. [2021-08-27 07:50:37,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2391 transitions. [2021-08-27 07:50:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-27 07:50:37,229 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:37,229 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:37,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 07:50:37,229 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:37,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:37,230 INFO L82 PathProgramCache]: Analyzing trace with hash 157800989, now seen corresponding path program 1 times [2021-08-27 07:50:37,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:37,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601185403] [2021-08-27 07:50:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:37,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:37,268 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:37,268 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601185403] [2021-08-27 07:50:37,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601185403] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:37,268 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:37,268 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:37,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369687698] [2021-08-27 07:50:37,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:37,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:37,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:37,270 INFO L87 Difference]: Start difference. First operand 1545 states and 2391 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:37,389 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2021-08-27 07:50:37,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:37,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2021-08-27 07:50:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:37,397 INFO L225 Difference]: With dead ends: 2091 [2021-08-27 07:50:37,397 INFO L226 Difference]: Without dead ends: 2091 [2021-08-27 07:50:37,397 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:37,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2021-08-27 07:50:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2089. [2021-08-27 07:50:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 3207 transitions. [2021-08-27 07:50:37,436 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 3207 transitions. Word has length 27 [2021-08-27 07:50:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:37,436 INFO L470 AbstractCegarLoop]: Abstraction has 2089 states and 3207 transitions. [2021-08-27 07:50:37,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3207 transitions. [2021-08-27 07:50:37,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:50:37,438 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:37,438 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:37,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 07:50:37,439 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:37,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:37,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1876941805, now seen corresponding path program 1 times [2021-08-27 07:50:37,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:37,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187738230] [2021-08-27 07:50:37,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:37,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,475 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:37,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:37,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187738230] [2021-08-27 07:50:37,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187738230] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:37,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:37,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:37,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650396184] [2021-08-27 07:50:37,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:37,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:37,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:37,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:37,477 INFO L87 Difference]: Start difference. First operand 2089 states and 3207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:37,581 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2021-08-27 07:50:37,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:37,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 07:50:37,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:37,595 INFO L225 Difference]: With dead ends: 2123 [2021-08-27 07:50:37,595 INFO L226 Difference]: Without dead ends: 2123 [2021-08-27 07:50:37,596 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2021-08-27 07:50:37,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121. [2021-08-27 07:50:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3207 transitions. [2021-08-27 07:50:37,631 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3207 transitions. Word has length 28 [2021-08-27 07:50:37,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:37,632 INFO L470 AbstractCegarLoop]: Abstraction has 2121 states and 3207 transitions. [2021-08-27 07:50:37,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3207 transitions. [2021-08-27 07:50:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:50:37,634 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:37,635 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:37,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:50:37,635 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:37,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:37,635 INFO L82 PathProgramCache]: Analyzing trace with hash 597078127, now seen corresponding path program 1 times [2021-08-27 07:50:37,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:37,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262214741] [2021-08-27 07:50:37,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:37,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,670 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:37,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:37,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262214741] [2021-08-27 07:50:37,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262214741] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:37,671 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:37,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:37,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200216335] [2021-08-27 07:50:37,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:37,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:37,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:37,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:37,673 INFO L87 Difference]: Start difference. First operand 2121 states and 3207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:37,782 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2021-08-27 07:50:37,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:37,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 07:50:37,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:37,793 INFO L225 Difference]: With dead ends: 3723 [2021-08-27 07:50:37,794 INFO L226 Difference]: Without dead ends: 3723 [2021-08-27 07:50:37,794 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2021-08-27 07:50:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3081. [2021-08-27 07:50:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4519 transitions. [2021-08-27 07:50:37,865 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4519 transitions. Word has length 28 [2021-08-27 07:50:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:37,865 INFO L470 AbstractCegarLoop]: Abstraction has 3081 states and 4519 transitions. [2021-08-27 07:50:37,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4519 transitions. [2021-08-27 07:50:37,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 07:50:37,869 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:37,869 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:37,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 07:50:37,869 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:37,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash -414039123, now seen corresponding path program 1 times [2021-08-27 07:50:37,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:37,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727952534] [2021-08-27 07:50:37,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:37,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:37,905 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:37,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:37,906 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727952534] [2021-08-27 07:50:37,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727952534] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:37,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:37,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:37,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953500454] [2021-08-27 07:50:37,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:37,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:37,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:37,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:37,908 INFO L87 Difference]: Start difference. First operand 3081 states and 4519 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:38,017 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2021-08-27 07:50:38,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:38,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-08-27 07:50:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:38,029 INFO L225 Difference]: With dead ends: 4107 [2021-08-27 07:50:38,030 INFO L226 Difference]: Without dead ends: 4107 [2021-08-27 07:50:38,030 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2021-08-27 07:50:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 4105. [2021-08-27 07:50:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 5959 transitions. [2021-08-27 07:50:38,126 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 5959 transitions. Word has length 28 [2021-08-27 07:50:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:38,127 INFO L470 AbstractCegarLoop]: Abstraction has 4105 states and 5959 transitions. [2021-08-27 07:50:38,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 5959 transitions. [2021-08-27 07:50:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 07:50:38,131 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:38,131 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:38,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 07:50:38,131 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:38,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1329767858, now seen corresponding path program 1 times [2021-08-27 07:50:38,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:38,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23660400] [2021-08-27 07:50:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:38,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:38,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:38,165 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:38,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:38,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23660400] [2021-08-27 07:50:38,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23660400] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:38,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:38,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:38,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987110002] [2021-08-27 07:50:38,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:38,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:38,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:38,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:38,167 INFO L87 Difference]: Start difference. First operand 4105 states and 5959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:38,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:38,274 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2021-08-27 07:50:38,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:38,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 07:50:38,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:38,287 INFO L225 Difference]: With dead ends: 4171 [2021-08-27 07:50:38,287 INFO L226 Difference]: Without dead ends: 4171 [2021-08-27 07:50:38,287 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2021-08-27 07:50:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 4169. [2021-08-27 07:50:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 5959 transitions. [2021-08-27 07:50:38,382 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 5959 transitions. Word has length 29 [2021-08-27 07:50:38,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:38,383 INFO L470 AbstractCegarLoop]: Abstraction has 4169 states and 5959 transitions. [2021-08-27 07:50:38,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 5959 transitions. [2021-08-27 07:50:38,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 07:50:38,387 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:38,387 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:38,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 07:50:38,388 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:38,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:38,388 INFO L82 PathProgramCache]: Analyzing trace with hash 49904180, now seen corresponding path program 1 times [2021-08-27 07:50:38,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:38,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118206249] [2021-08-27 07:50:38,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:38,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:38,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:38,426 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:38,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:38,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118206249] [2021-08-27 07:50:38,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118206249] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:38,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:38,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:38,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007635927] [2021-08-27 07:50:38,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:38,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:38,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:38,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:38,429 INFO L87 Difference]: Start difference. First operand 4169 states and 5959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:38,545 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2021-08-27 07:50:38,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:38,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 07:50:38,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:38,558 INFO L225 Difference]: With dead ends: 7179 [2021-08-27 07:50:38,559 INFO L226 Difference]: Without dead ends: 7179 [2021-08-27 07:50:38,559 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:38,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2021-08-27 07:50:38,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6153. [2021-08-27 07:50:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8519 transitions. [2021-08-27 07:50:38,700 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8519 transitions. Word has length 29 [2021-08-27 07:50:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:38,700 INFO L470 AbstractCegarLoop]: Abstraction has 6153 states and 8519 transitions. [2021-08-27 07:50:38,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8519 transitions. [2021-08-27 07:50:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 07:50:38,709 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:38,709 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] [2021-08-27 07:50:38,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 07:50:38,710 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:38,710 INFO L82 PathProgramCache]: Analyzing trace with hash -961213070, now seen corresponding path program 1 times [2021-08-27 07:50:38,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:38,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842012617] [2021-08-27 07:50:38,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:38,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:38,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:38,758 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:38,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:38,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842012617] [2021-08-27 07:50:38,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842012617] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:38,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:38,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:38,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94610682] [2021-08-27 07:50:38,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:38,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:38,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:38,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:38,760 INFO L87 Difference]: Start difference. First operand 6153 states and 8519 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:38,872 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2021-08-27 07:50:38,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:38,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2021-08-27 07:50:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:38,887 INFO L225 Difference]: With dead ends: 8075 [2021-08-27 07:50:38,887 INFO L226 Difference]: Without dead ends: 8075 [2021-08-27 07:50:38,887 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:38,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2021-08-27 07:50:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8073. [2021-08-27 07:50:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 11015 transitions. [2021-08-27 07:50:39,026 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 11015 transitions. Word has length 29 [2021-08-27 07:50:39,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:39,026 INFO L470 AbstractCegarLoop]: Abstraction has 8073 states and 11015 transitions. [2021-08-27 07:50:39,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 11015 transitions. [2021-08-27 07:50:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:50:39,035 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:39,035 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] [2021-08-27 07:50:39,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 07:50:39,036 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:39,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:39,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1547245026, now seen corresponding path program 1 times [2021-08-27 07:50:39,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:39,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157037647] [2021-08-27 07:50:39,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:39,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:39,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:39,070 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:39,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:39,070 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157037647] [2021-08-27 07:50:39,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157037647] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:39,070 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:39,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:39,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599033745] [2021-08-27 07:50:39,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:39,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:39,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:39,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:39,072 INFO L87 Difference]: Start difference. First operand 8073 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:39,177 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2021-08-27 07:50:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:39,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-08-27 07:50:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:39,191 INFO L225 Difference]: With dead ends: 8203 [2021-08-27 07:50:39,191 INFO L226 Difference]: Without dead ends: 8203 [2021-08-27 07:50:39,192 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:39,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2021-08-27 07:50:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 8201. [2021-08-27 07:50:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 11015 transitions. [2021-08-27 07:50:39,318 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 11015 transitions. Word has length 30 [2021-08-27 07:50:39,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:39,319 INFO L470 AbstractCegarLoop]: Abstraction has 8201 states and 11015 transitions. [2021-08-27 07:50:39,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:39,319 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 11015 transitions. [2021-08-27 07:50:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:50:39,326 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:39,327 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] [2021-08-27 07:50:39,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 07:50:39,327 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:39,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:39,328 INFO L82 PathProgramCache]: Analyzing trace with hash 267381348, now seen corresponding path program 1 times [2021-08-27 07:50:39,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:39,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978873283] [2021-08-27 07:50:39,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:39,328 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:39,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:39,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:39,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978873283] [2021-08-27 07:50:39,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978873283] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:39,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:39,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:39,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686918137] [2021-08-27 07:50:39,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:39,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:39,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:39,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:39,375 INFO L87 Difference]: Start difference. First operand 8201 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:39,532 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2021-08-27 07:50:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:39,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-08-27 07:50:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:39,552 INFO L225 Difference]: With dead ends: 13835 [2021-08-27 07:50:39,552 INFO L226 Difference]: Without dead ends: 13835 [2021-08-27 07:50:39,553 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2021-08-27 07:50:39,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 12297. [2021-08-27 07:50:39,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 16007 transitions. [2021-08-27 07:50:39,764 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 16007 transitions. Word has length 30 [2021-08-27 07:50:39,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:39,765 INFO L470 AbstractCegarLoop]: Abstraction has 12297 states and 16007 transitions. [2021-08-27 07:50:39,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 16007 transitions. [2021-08-27 07:50:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:50:39,781 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:39,781 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] [2021-08-27 07:50:39,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 07:50:39,781 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash -743735902, now seen corresponding path program 1 times [2021-08-27 07:50:39,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:39,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103446627] [2021-08-27 07:50:39,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:39,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:39,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:39,824 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:39,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:39,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103446627] [2021-08-27 07:50:39,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103446627] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:39,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:39,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:39,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723667599] [2021-08-27 07:50:39,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:39,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:39,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:39,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:39,828 INFO L87 Difference]: Start difference. First operand 12297 states and 16007 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:39,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:39,970 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2021-08-27 07:50:39,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:39,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2021-08-27 07:50:39,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:40,001 INFO L225 Difference]: With dead ends: 15883 [2021-08-27 07:50:40,002 INFO L226 Difference]: Without dead ends: 15883 [2021-08-27 07:50:40,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2021-08-27 07:50:40,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 15881. [2021-08-27 07:50:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15881 states to 15881 states and 20231 transitions. [2021-08-27 07:50:40,252 INFO L78 Accepts]: Start accepts. Automaton has 15881 states and 20231 transitions. Word has length 30 [2021-08-27 07:50:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:40,253 INFO L470 AbstractCegarLoop]: Abstraction has 15881 states and 20231 transitions. [2021-08-27 07:50:40,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 15881 states and 20231 transitions. [2021-08-27 07:50:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:50:40,274 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:40,274 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:40,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 07:50:40,274 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:40,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:40,276 INFO L82 PathProgramCache]: Analyzing trace with hash -300897017, now seen corresponding path program 1 times [2021-08-27 07:50:40,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:40,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443957694] [2021-08-27 07:50:40,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:40,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:40,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:40,310 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443957694] [2021-08-27 07:50:40,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443957694] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:40,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:40,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:40,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591007310] [2021-08-27 07:50:40,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:40,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:40,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:40,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:40,312 INFO L87 Difference]: Start difference. First operand 15881 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:40,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:40,437 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2021-08-27 07:50:40,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:40,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 07:50:40,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:40,471 INFO L225 Difference]: With dead ends: 16139 [2021-08-27 07:50:40,472 INFO L226 Difference]: Without dead ends: 16139 [2021-08-27 07:50:40,472 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16139 states. [2021-08-27 07:50:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16139 to 16137. [2021-08-27 07:50:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:40,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 20231 transitions. [2021-08-27 07:50:40,747 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 20231 transitions. Word has length 31 [2021-08-27 07:50:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:40,747 INFO L470 AbstractCegarLoop]: Abstraction has 16137 states and 20231 transitions. [2021-08-27 07:50:40,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 20231 transitions. [2021-08-27 07:50:40,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:50:40,769 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:40,769 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:40,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 07:50:40,769 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1580760695, now seen corresponding path program 1 times [2021-08-27 07:50:40,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:40,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856805555] [2021-08-27 07:50:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:40,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:40,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:40,811 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:40,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:40,811 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856805555] [2021-08-27 07:50:40,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856805555] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:40,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:40,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:40,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887990570] [2021-08-27 07:50:40,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:40,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:40,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:40,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:40,813 INFO L87 Difference]: Start difference. First operand 16137 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:40,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:40,981 INFO L93 Difference]: Finished difference Result 31243 states and 37384 transitions. [2021-08-27 07:50:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:40,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 07:50:40,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:41,131 INFO L225 Difference]: With dead ends: 31243 [2021-08-27 07:50:41,131 INFO L226 Difference]: Without dead ends: 31243 [2021-08-27 07:50:41,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:41,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31243 states. [2021-08-27 07:50:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31243 to 31241. [2021-08-27 07:50:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 37383 transitions. [2021-08-27 07:50:41,570 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 37383 transitions. Word has length 31 [2021-08-27 07:50:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:41,570 INFO L470 AbstractCegarLoop]: Abstraction has 31241 states and 37383 transitions. [2021-08-27 07:50:41,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 37383 transitions. [2021-08-27 07:50:41,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:50:41,603 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:41,603 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:41,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-27 07:50:41,604 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:41,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:41,604 INFO L82 PathProgramCache]: Analyzing trace with hash -569643445, now seen corresponding path program 1 times [2021-08-27 07:50:41,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:41,605 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232065956] [2021-08-27 07:50:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:41,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:41,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:41,650 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:41,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:41,651 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232065956] [2021-08-27 07:50:41,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232065956] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:41,651 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:41,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:41,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341515260] [2021-08-27 07:50:41,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:41,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:41,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:41,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:41,653 INFO L87 Difference]: Start difference. First operand 31241 states and 37383 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:41,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:41,853 INFO L93 Difference]: Finished difference Result 33291 states and 39944 transitions. [2021-08-27 07:50:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:41,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2021-08-27 07:50:41,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:41,914 INFO L225 Difference]: With dead ends: 33291 [2021-08-27 07:50:41,914 INFO L226 Difference]: Without dead ends: 33291 [2021-08-27 07:50:41,915 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33291 states. [2021-08-27 07:50:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33291 to 31241. [2021-08-27 07:50:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31241 states, 31237 states have (on average 1.1802669910682844) internal successors, (36868), 31237 states have internal predecessors, (36868), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:42,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 36871 transitions. [2021-08-27 07:50:42,479 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 36871 transitions. Word has length 31 [2021-08-27 07:50:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:42,480 INFO L470 AbstractCegarLoop]: Abstraction has 31241 states and 36871 transitions. [2021-08-27 07:50:42,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 36871 transitions. [2021-08-27 07:50:42,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 07:50:42,647 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:42,647 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] [2021-08-27 07:50:42,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 07:50:42,647 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:42,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:42,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1758725161, now seen corresponding path program 1 times [2021-08-27 07:50:42,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:42,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508598111] [2021-08-27 07:50:42,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:42,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:42,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:42,687 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:42,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:42,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508598111] [2021-08-27 07:50:42,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508598111] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:42,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:42,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:42,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472981950] [2021-08-27 07:50:42,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:42,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:42,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:42,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:42,689 INFO L87 Difference]: Start difference. First operand 31241 states and 36871 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:42,902 INFO L93 Difference]: Finished difference Result 50697 states and 58375 transitions. [2021-08-27 07:50:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:42,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-27 07:50:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:42,980 INFO L225 Difference]: With dead ends: 50697 [2021-08-27 07:50:42,980 INFO L226 Difference]: Without dead ends: 50697 [2021-08-27 07:50:42,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50697 states. [2021-08-27 07:50:43,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50697 to 48649. [2021-08-27 07:50:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48649 states, 48645 states have (on average 1.1578579504573954) internal successors, (56324), 48645 states have internal predecessors, (56324), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48649 states to 48649 states and 56327 transitions. [2021-08-27 07:50:43,798 INFO L78 Accepts]: Start accepts. Automaton has 48649 states and 56327 transitions. Word has length 32 [2021-08-27 07:50:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:43,799 INFO L470 AbstractCegarLoop]: Abstraction has 48649 states and 56327 transitions. [2021-08-27 07:50:43,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 48649 states and 56327 transitions. [2021-08-27 07:50:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 07:50:43,850 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:43,851 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] [2021-08-27 07:50:43,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-27 07:50:43,851 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:43,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:43,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1525124885, now seen corresponding path program 1 times [2021-08-27 07:50:43,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:43,852 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546484493] [2021-08-27 07:50:43,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:43,852 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:43,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:43,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:43,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:43,897 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546484493] [2021-08-27 07:50:43,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546484493] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:43,898 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:43,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 07:50:43,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221730087] [2021-08-27 07:50:43,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:50:43,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:43,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:50:43,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:50:43,899 INFO L87 Difference]: Start difference. First operand 48649 states and 56327 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:44,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:44,178 INFO L93 Difference]: Finished difference Result 60935 states and 67590 transitions. [2021-08-27 07:50:44,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:50:44,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2021-08-27 07:50:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:44,179 INFO L225 Difference]: With dead ends: 60935 [2021-08-27 07:50:44,179 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 07:50:44,180 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:50:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 07:50:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 07:50:44,180 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:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 07:50:44,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2021-08-27 07:50:44,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:44,181 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 07:50:44,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-08-27 07:50:44,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 07:50:44,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 07:50:44,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:50:44,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:50:44,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 07:50:44,189 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:50:44,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:50:44 BoogieIcfgContainer [2021-08-27 07:50:44,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:50:44,197 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:50:44,197 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:50:44,197 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:50:44,198 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:33" (3/4) ... [2021-08-27 07:50:44,200 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 07:50:44,205 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-08-27 07:50:44,205 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-08-27 07:50:44,206 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-08-27 07:50:44,212 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-08-27 07:50:44,213 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-27 07:50:44,213 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-27 07:50:44,213 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-27 07:50:44,265 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 07:50:44,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:50:44,269 INFO L168 Benchmark]: Toolchain (without parser) took 11659.57 ms. Allocated memory was 50.3 MB in the beginning and 3.0 GB in the end (delta: 3.0 GB). Free memory was 26.4 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 529.9 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:44,270 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 50.3 MB. Free memory was 32.1 MB in the beginning and 32.0 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:50:44,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.58 ms. Allocated memory was 50.3 MB in the beginning and 65.0 MB in the end (delta: 14.7 MB). Free memory was 26.3 MB in the beginning and 48.3 MB in the end (delta: -22.1 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:44,271 INFO L168 Benchmark]: Boogie Preprocessor took 59.61 ms. Allocated memory is still 65.0 MB. Free memory was 48.3 MB in the beginning and 46.6 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:50:44,272 INFO L168 Benchmark]: RCFGBuilder took 514.25 ms. Allocated memory is still 65.0 MB. Free memory was 46.4 MB in the beginning and 39.8 MB in the end (delta: 6.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:44,272 INFO L168 Benchmark]: TraceAbstraction took 10700.39 ms. Allocated memory was 65.0 MB in the beginning and 3.0 GB in the end (delta: 3.0 GB). Free memory was 39.2 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 524.3 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:44,273 INFO L168 Benchmark]: Witness Printer took 68.67 ms. Allocated memory is still 3.0 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:44,274 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 50.3 MB. Free memory was 32.1 MB in the beginning and 32.0 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 306.58 ms. Allocated memory was 50.3 MB in the beginning and 65.0 MB in the end (delta: 14.7 MB). Free memory was 26.3 MB in the beginning and 48.3 MB in the end (delta: -22.1 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 59.61 ms. Allocated memory is still 65.0 MB. Free memory was 48.3 MB in the beginning and 46.6 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 514.25 ms. Allocated memory is still 65.0 MB. Free memory was 46.4 MB in the beginning and 39.8 MB in the end (delta: 6.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10700.39 ms. Allocated memory was 65.0 MB in the beginning and 3.0 GB in the end (delta: 3.0 GB). Free memory was 39.2 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 524.3 MB. Max. memory is 16.1 GB. * Witness Printer took 68.67 ms. Allocated memory is still 3.0 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 177]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: 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 4 procedures, 52 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 10641.7ms, OverallIterations: 31, TraceHistogramMax: 1, EmptinessCheckTime: 377.2ms, AutomataDifference: 4708.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2870 SDtfs, 4255 SDslu, 183 SDs, 0 SdLazy, 2029 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2056.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 214 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1204.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=48649occurred in iteration=30, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3523.1ms AutomataMinimizationTime, 31 MinimizatonAttempts, 8222 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 54.0ms SsaConstructionTime, 246.6ms SatisfiabilityAnalysisTime, 1394.7ms InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 791 ConstructedInterpolants, 0 QuantifiedInterpolants, 2491 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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:44,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...