./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY --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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 08:43:17,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 08:43:17,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 08:43:17,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 08:43:17,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 08:43:17,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 08:43:17,596 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 08:43:17,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 08:43:17,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 08:43:17,608 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 08:43:17,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 08:43:17,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 08:43:17,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 08:43:17,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 08:43:17,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 08:43:17,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 08:43:17,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 08:43:17,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 08:43:17,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 08:43:17,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 08:43:17,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 08:43:17,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 08:43:17,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 08:43:17,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 08:43:17,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 08:43:17,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 08:43:17,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 08:43:17,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 08:43:17,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 08:43:17,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 08:43:17,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 08:43:17,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 08:43:17,661 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 08:43:17,662 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 08:43:17,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 08:43:17,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 08:43:17,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 08:43:17,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 08:43:17,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 08:43:17,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 08:43:17,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 08:43:17,668 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-07 08:43:17,709 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 08:43:17,709 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 08:43:17,710 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 08:43:17,710 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 08:43:17,712 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 08:43:17,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 08:43:17,712 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 08:43:17,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 08:43:17,713 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 08:43:17,713 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 08:43:17,714 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 08:43:17,715 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 08:43:17,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 08:43:17,715 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 08:43:17,715 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 08:43:17,716 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-07 08:43:17,716 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 08:43:17,716 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 08:43:17,716 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 08:43:17,717 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 08:43:17,717 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 08:43:17,717 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 08:43:17,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 08:43:17,718 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:43:17,718 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 08:43:17,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 08:43:17,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 08:43:17,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 08:43:17,719 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 08:43:17,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY 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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2021-11-07 08:43:18,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 08:43:18,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 08:43:18,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 08:43:18,054 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 08:43:18,055 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 08:43:18,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/locks/test_locks_9.c [2021-11-07 08:43:18,134 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/data/f7eed42a1/2deb12d930aa45aabf0423494a369740/FLAG609d9fb74 [2021-11-07 08:43:18,696 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 08:43:18,700 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/sv-benchmarks/c/locks/test_locks_9.c [2021-11-07 08:43:18,714 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/data/f7eed42a1/2deb12d930aa45aabf0423494a369740/FLAG609d9fb74 [2021-11-07 08:43:19,060 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/data/f7eed42a1/2deb12d930aa45aabf0423494a369740 [2021-11-07 08:43:19,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 08:43:19,074 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-07 08:43:19,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 08:43:19,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 08:43:19,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 08:43:19,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:43:19" (1/1) ... [2021-11-07 08:43:19,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27863870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:19, skipping insertion in model container [2021-11-07 08:43:19,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:43:19" (1/1) ... [2021-11-07 08:43:19,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 08:43:19,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 08:43:19,273 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2021-11-07 08:43:19,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:43:19,285 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 08:43:19,308 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/sv-benchmarks/c/locks/test_locks_9.c[3555,3568] [2021-11-07 08:43:19,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 08:43:19,323 INFO L208 MainTranslator]: Completed translation [2021-11-07 08:43:19,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:19 WrapperNode [2021-11-07 08:43:19,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 08:43:19,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 08:43:19,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 08:43:19,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 08:43:19,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:19" (1/1) ... [2021-11-07 08:43:19,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:19" (1/1) ... [2021-11-07 08:43:19,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:19" (1/1) ... [2021-11-07 08:43:19,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:19" (1/1) ... [2021-11-07 08:43:19,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:19" (1/1) ... [2021-11-07 08:43:19,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:19" (1/1) ... [2021-11-07 08:43:19,358 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:19" (1/1) ... [2021-11-07 08:43:19,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 08:43:19,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 08:43:19,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 08:43:19,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 08:43:19,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:19" (1/1) ... [2021-11-07 08:43:19,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 08:43:19,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 08:43:19,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 08:43:19,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 08:43:19,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-07 08:43:19,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 08:43:19,456 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-07 08:43:19,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-07 08:43:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-07 08:43:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-07 08:43:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-07 08:43:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 08:43:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-11-07 08:43:19,461 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-07 08:43:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-07 08:43:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 08:43:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 08:43:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-07 08:43:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-07 08:43:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 08:43:19,808 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 08:43:19,808 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-07 08:43:19,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:43:19 BoogieIcfgContainer [2021-11-07 08:43:19,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 08:43:19,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 08:43:19,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 08:43:19,816 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 08:43:19,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:43:19" (1/3) ... [2021-11-07 08:43:19,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e8f89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:43:19, skipping insertion in model container [2021-11-07 08:43:19,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:43:19" (2/3) ... [2021-11-07 08:43:19,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e8f89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:43:19, skipping insertion in model container [2021-11-07 08:43:19,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:43:19" (3/3) ... [2021-11-07 08:43:19,819 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2021-11-07 08:43:19,824 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 08:43:19,824 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 08:43:19,892 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 08:43:19,901 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 08:43:19,901 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 08:43:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 38 states have internal predecessors, (68), 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-11-07 08:43:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-07 08:43:19,929 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:19,929 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:43:19,930 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr1ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1545970075, now seen corresponding path program 1 times [2021-11-07 08:43:19,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:19,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990040298] [2021-11-07 08:43:19,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:19,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:20,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:20,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:20,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:20,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:20,210 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990040298] [2021-11-07 08:43:20,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990040298] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:20,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:20,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 08:43:20,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118648844] [2021-11-07 08:43:20,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 08:43:20,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:20,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 08:43:20,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:43:20,243 INFO L87 Difference]: Start difference. First operand has 43 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 38 states have internal predecessors, (68), 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-11-07 08:43:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:20,296 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2021-11-07 08:43:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 08:43:20,298 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-11-07 08:43:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:20,307 INFO L225 Difference]: With dead ends: 42 [2021-11-07 08:43:20,308 INFO L226 Difference]: Without dead ends: 37 [2021-11-07 08:43:20,309 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 08:43:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-11-07 08:43:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-11-07 08:43:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 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-11-07 08:43:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2021-11-07 08:43:20,362 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 9 [2021-11-07 08:43:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:20,362 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2021-11-07 08:43:20,363 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-11-07 08:43:20,363 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2021-11-07 08:43:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 08:43:20,365 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:20,366 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:43:20,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 08:43:20,367 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:20,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1171509738, now seen corresponding path program 1 times [2021-11-07 08:43:20,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:20,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442585071] [2021-11-07 08:43:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:20,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:20,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:20,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:20,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:20,604 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442585071] [2021-11-07 08:43:20,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442585071] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:20,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:20,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:20,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451861507] [2021-11-07 08:43:20,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:20,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:20,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:20,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:20,608 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-11-07 08:43:20,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:20,841 INFO L93 Difference]: Finished difference Result 67 states and 117 transitions. [2021-11-07 08:43:20,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:20,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2021-11-07 08:43:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:20,846 INFO L225 Difference]: With dead ends: 67 [2021-11-07 08:43:20,846 INFO L226 Difference]: Without dead ends: 67 [2021-11-07 08:43:20,847 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-07 08:43:20,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2021-11-07 08:43:20,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 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-11-07 08:43:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2021-11-07 08:43:20,870 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2021-11-07 08:43:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:20,871 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2021-11-07 08:43:20,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-11-07 08:43:20,872 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2021-11-07 08:43:20,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-07 08:43:20,874 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:20,874 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:43:20,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 08:43:20,875 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:20,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:20,878 INFO L85 PathProgramCache]: Analyzing trace with hash -913344300, now seen corresponding path program 1 times [2021-11-07 08:43:20,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:20,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216440593] [2021-11-07 08:43:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:20,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:21,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:21,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:21,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216440593] [2021-11-07 08:43:21,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216440593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:21,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:21,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:21,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095972790] [2021-11-07 08:43:21,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:21,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:21,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:21,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:21,078 INFO L87 Difference]: Start difference. First operand 47 states and 82 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-11-07 08:43:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:21,293 INFO L93 Difference]: Finished difference Result 67 states and 115 transitions. [2021-11-07 08:43:21,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:21,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2021-11-07 08:43:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:21,300 INFO L225 Difference]: With dead ends: 67 [2021-11-07 08:43:21,300 INFO L226 Difference]: Without dead ends: 67 [2021-11-07 08:43:21,301 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:21,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-11-07 08:43:21,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2021-11-07 08:43:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 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-11-07 08:43:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2021-11-07 08:43:21,325 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 20 [2021-11-07 08:43:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:21,326 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2021-11-07 08:43:21,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-11-07 08:43:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2021-11-07 08:43:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 08:43:21,328 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:21,328 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:43:21,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 08:43:21,328 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:21,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1956849803, now seen corresponding path program 1 times [2021-11-07 08:43:21,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:21,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72801611] [2021-11-07 08:43:21,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:21,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:21,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:21,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:21,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72801611] [2021-11-07 08:43:21,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72801611] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:21,493 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:21,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:21,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434948400] [2021-11-07 08:43:21,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:21,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:21,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:21,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:21,495 INFO L87 Difference]: Start difference. First operand 65 states and 114 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-11-07 08:43:21,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:21,675 INFO L93 Difference]: Finished difference Result 70 states and 117 transitions. [2021-11-07 08:43:21,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:21,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2021-11-07 08:43:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:21,680 INFO L225 Difference]: With dead ends: 70 [2021-11-07 08:43:21,680 INFO L226 Difference]: Without dead ends: 70 [2021-11-07 08:43:21,681 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:21,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-11-07 08:43:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2021-11-07 08:43:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 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-11-07 08:43:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2021-11-07 08:43:21,701 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 21 [2021-11-07 08:43:21,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:21,702 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2021-11-07 08:43:21,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-11-07 08:43:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2021-11-07 08:43:21,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 08:43:21,704 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:21,704 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:43:21,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 08:43:21,705 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:21,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:21,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1751311479, now seen corresponding path program 1 times [2021-11-07 08:43:21,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:21,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108659309] [2021-11-07 08:43:21,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:21,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:21,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:21,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:21,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108659309] [2021-11-07 08:43:21,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108659309] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:21,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:21,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:21,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605431546] [2021-11-07 08:43:21,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:21,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:21,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:21,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:21,850 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-11-07 08:43:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:22,031 INFO L93 Difference]: Finished difference Result 125 states and 214 transitions. [2021-11-07 08:43:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:22,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2021-11-07 08:43:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:22,034 INFO L225 Difference]: With dead ends: 125 [2021-11-07 08:43:22,034 INFO L226 Difference]: Without dead ends: 125 [2021-11-07 08:43:22,035 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-11-07 08:43:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2021-11-07 08:43:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7647058823529411) internal successors, (210), 119 states have internal predecessors, (210), 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-11-07 08:43:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 213 transitions. [2021-11-07 08:43:22,058 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 213 transitions. Word has length 21 [2021-11-07 08:43:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:22,059 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 213 transitions. [2021-11-07 08:43:22,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-11-07 08:43:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 213 transitions. [2021-11-07 08:43:22,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-11-07 08:43:22,061 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:22,061 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 08:43:22,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 08:43:22,062 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:22,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1493146041, now seen corresponding path program 1 times [2021-11-07 08:43:22,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:22,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857813739] [2021-11-07 08:43:22,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:22,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:22,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:22,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:22,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857813739] [2021-11-07 08:43:22,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857813739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:22,189 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:22,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:22,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934590279] [2021-11-07 08:43:22,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:22,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:22,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:22,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:22,191 INFO L87 Difference]: Start difference. First operand 123 states and 213 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-11-07 08:43:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:22,365 INFO L93 Difference]: Finished difference Result 157 states and 272 transitions. [2021-11-07 08:43:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:22,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 21 [2021-11-07 08:43:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:22,368 INFO L225 Difference]: With dead ends: 157 [2021-11-07 08:43:22,368 INFO L226 Difference]: Without dead ends: 157 [2021-11-07 08:43:22,368 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:22,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-11-07 08:43:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 123. [2021-11-07 08:43:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 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-11-07 08:43:22,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 211 transitions. [2021-11-07 08:43:22,388 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 211 transitions. Word has length 21 [2021-11-07 08:43:22,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:22,389 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 211 transitions. [2021-11-07 08:43:22,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-11-07 08:43:22,389 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 211 transitions. [2021-11-07 08:43:22,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 08:43:22,396 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:22,396 INFO L513 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-11-07 08:43:22,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 08:43:22,396 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:22,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:22,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1543704951, now seen corresponding path program 1 times [2021-11-07 08:43:22,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:22,398 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306333254] [2021-11-07 08:43:22,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:22,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:22,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:22,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:22,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306333254] [2021-11-07 08:43:22,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306333254] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:22,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:22,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:22,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768023765] [2021-11-07 08:43:22,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:22,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:22,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:22,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:22,490 INFO L87 Difference]: Start difference. First operand 123 states and 211 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-11-07 08:43:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:22,625 INFO L93 Difference]: Finished difference Result 225 states and 390 transitions. [2021-11-07 08:43:22,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:22,626 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-11-07 08:43:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:22,629 INFO L225 Difference]: With dead ends: 225 [2021-11-07 08:43:22,629 INFO L226 Difference]: Without dead ends: 225 [2021-11-07 08:43:22,629 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:22,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-07 08:43:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 167. [2021-11-07 08:43:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 163 states have (on average 1.7300613496932515) internal successors, (282), 163 states have internal predecessors, (282), 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-11-07 08:43:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 285 transitions. [2021-11-07 08:43:22,638 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 285 transitions. Word has length 22 [2021-11-07 08:43:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:22,639 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 285 transitions. [2021-11-07 08:43:22,639 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-11-07 08:43:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 285 transitions. [2021-11-07 08:43:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-07 08:43:22,641 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:22,641 INFO L513 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-11-07 08:43:22,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 08:43:22,642 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:22,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1285539513, now seen corresponding path program 1 times [2021-11-07 08:43:22,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:22,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837966569] [2021-11-07 08:43:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:22,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:22,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:22,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:22,721 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837966569] [2021-11-07 08:43:22,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837966569] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:22,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:22,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:22,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144922281] [2021-11-07 08:43:22,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:22,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:22,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:22,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:22,724 INFO L87 Difference]: Start difference. First operand 167 states and 285 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-11-07 08:43:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:22,882 INFO L93 Difference]: Finished difference Result 233 states and 392 transitions. [2021-11-07 08:43:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:22,883 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-11-07 08:43:22,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:22,886 INFO L225 Difference]: With dead ends: 233 [2021-11-07 08:43:22,887 INFO L226 Difference]: Without dead ends: 233 [2021-11-07 08:43:22,887 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-07 08:43:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2021-11-07 08:43:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 227 states have (on average 1.7092511013215859) internal successors, (388), 227 states have internal predecessors, (388), 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-11-07 08:43:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 391 transitions. [2021-11-07 08:43:22,899 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 391 transitions. Word has length 22 [2021-11-07 08:43:22,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:22,899 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 391 transitions. [2021-11-07 08:43:22,900 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-11-07 08:43:22,900 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 391 transitions. [2021-11-07 08:43:22,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 08:43:22,902 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:22,903 INFO L513 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-11-07 08:43:22,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 08:43:22,903 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:22,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash -609998836, now seen corresponding path program 1 times [2021-11-07 08:43:22,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:22,905 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577062112] [2021-11-07 08:43:22,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:22,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:22,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:22,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:22,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577062112] [2021-11-07 08:43:22,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577062112] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:22,972 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:22,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:22,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275873686] [2021-11-07 08:43:22,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:22,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:22,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:22,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:22,976 INFO L87 Difference]: Start difference. First operand 231 states and 391 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-11-07 08:43:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:23,158 INFO L93 Difference]: Finished difference Result 239 states and 396 transitions. [2021-11-07 08:43:23,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:23,158 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-11-07 08:43:23,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:23,160 INFO L225 Difference]: With dead ends: 239 [2021-11-07 08:43:23,160 INFO L226 Difference]: Without dead ends: 239 [2021-11-07 08:43:23,161 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-11-07 08:43:23,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2021-11-07 08:43:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 233 states have (on average 1.6824034334763949) internal successors, (392), 233 states have internal predecessors, (392), 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-11-07 08:43:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 395 transitions. [2021-11-07 08:43:23,181 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 395 transitions. Word has length 23 [2021-11-07 08:43:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:23,182 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 395 transitions. [2021-11-07 08:43:23,182 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-11-07 08:43:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 395 transitions. [2021-11-07 08:43:23,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 08:43:23,183 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:23,183 INFO L513 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-11-07 08:43:23,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 08:43:23,184 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:23,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:23,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1196804850, now seen corresponding path program 1 times [2021-11-07 08:43:23,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:23,185 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343725249] [2021-11-07 08:43:23,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:23,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:23,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:23,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:23,297 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343725249] [2021-11-07 08:43:23,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343725249] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:23,297 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:23,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:23,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074388751] [2021-11-07 08:43:23,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:23,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:23,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:23,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:23,300 INFO L87 Difference]: Start difference. First operand 237 states and 395 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-11-07 08:43:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:23,450 INFO L93 Difference]: Finished difference Result 427 states and 716 transitions. [2021-11-07 08:43:23,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:23,451 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-11-07 08:43:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:23,454 INFO L225 Difference]: With dead ends: 427 [2021-11-07 08:43:23,454 INFO L226 Difference]: Without dead ends: 427 [2021-11-07 08:43:23,455 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:23,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-11-07 08:43:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 329. [2021-11-07 08:43:23,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 325 states have (on average 1.6492307692307693) internal successors, (536), 325 states have internal predecessors, (536), 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-11-07 08:43:23,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 539 transitions. [2021-11-07 08:43:23,468 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 539 transitions. Word has length 23 [2021-11-07 08:43:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:23,468 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 539 transitions. [2021-11-07 08:43:23,469 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-11-07 08:43:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 539 transitions. [2021-11-07 08:43:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-11-07 08:43:23,470 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:23,470 INFO L513 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-11-07 08:43:23,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 08:43:23,471 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:23,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash -938639412, now seen corresponding path program 1 times [2021-11-07 08:43:23,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:23,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708108651] [2021-11-07 08:43:23,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:23,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:23,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:23,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:23,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708108651] [2021-11-07 08:43:23,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708108651] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:23,525 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:23,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:23,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731109378] [2021-11-07 08:43:23,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:23,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:23,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:23,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:23,527 INFO L87 Difference]: Start difference. First operand 329 states and 539 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-11-07 08:43:23,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:23,656 INFO L93 Difference]: Finished difference Result 451 states and 728 transitions. [2021-11-07 08:43:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:23,657 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-11-07 08:43:23,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:23,661 INFO L225 Difference]: With dead ends: 451 [2021-11-07 08:43:23,661 INFO L226 Difference]: Without dead ends: 451 [2021-11-07 08:43:23,661 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:23,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2021-11-07 08:43:23,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 449. [2021-11-07 08:43:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 445 states have (on average 1.6269662921348316) internal successors, (724), 445 states have internal predecessors, (724), 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-11-07 08:43:23,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 727 transitions. [2021-11-07 08:43:23,677 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 727 transitions. Word has length 23 [2021-11-07 08:43:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:23,678 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 727 transitions. [2021-11-07 08:43:23,678 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-11-07 08:43:23,678 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 727 transitions. [2021-11-07 08:43:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 08:43:23,679 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:23,679 INFO L513 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-11-07 08:43:23,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 08:43:23,680 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1553970044, now seen corresponding path program 1 times [2021-11-07 08:43:23,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:23,681 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457801111] [2021-11-07 08:43:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:23,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:23,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:23,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:23,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457801111] [2021-11-07 08:43:23,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457801111] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:23,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:23,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:23,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189813705] [2021-11-07 08:43:23,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:23,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:23,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:23,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:23,745 INFO L87 Difference]: Start difference. First operand 449 states and 727 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-11-07 08:43:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:23,875 INFO L93 Difference]: Finished difference Result 459 states and 728 transitions. [2021-11-07 08:43:23,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:23,876 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-11-07 08:43:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:23,880 INFO L225 Difference]: With dead ends: 459 [2021-11-07 08:43:23,880 INFO L226 Difference]: Without dead ends: 459 [2021-11-07 08:43:23,880 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:23,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-11-07 08:43:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2021-11-07 08:43:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.598233995584989) internal successors, (724), 453 states have internal predecessors, (724), 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-11-07 08:43:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 727 transitions. [2021-11-07 08:43:23,896 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 727 transitions. Word has length 24 [2021-11-07 08:43:23,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:23,896 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 727 transitions. [2021-11-07 08:43:23,897 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-11-07 08:43:23,897 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 727 transitions. [2021-11-07 08:43:23,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 08:43:23,898 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:23,898 INFO L513 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-11-07 08:43:23,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 08:43:23,899 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:23,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash 967164030, now seen corresponding path program 1 times [2021-11-07 08:43:23,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:23,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88809046] [2021-11-07 08:43:23,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:23,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:23,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:23,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:23,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88809046] [2021-11-07 08:43:23,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88809046] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:23,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:23,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:23,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203297979] [2021-11-07 08:43:23,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:23,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:23,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:23,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:23,966 INFO L87 Difference]: Start difference. First operand 457 states and 727 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-11-07 08:43:24,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:24,098 INFO L93 Difference]: Finished difference Result 811 states and 1296 transitions. [2021-11-07 08:43:24,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:24,099 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-11-07 08:43:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:24,106 INFO L225 Difference]: With dead ends: 811 [2021-11-07 08:43:24,106 INFO L226 Difference]: Without dead ends: 811 [2021-11-07 08:43:24,107 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:24,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2021-11-07 08:43:24,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 649. [2021-11-07 08:43:24,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 645 states have (on average 1.5565891472868216) internal successors, (1004), 645 states have internal predecessors, (1004), 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-11-07 08:43:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1007 transitions. [2021-11-07 08:43:24,132 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1007 transitions. Word has length 24 [2021-11-07 08:43:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:24,132 INFO L470 AbstractCegarLoop]: Abstraction has 649 states and 1007 transitions. [2021-11-07 08:43:24,133 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-11-07 08:43:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1007 transitions. [2021-11-07 08:43:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 08:43:24,134 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:24,135 INFO L513 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-11-07 08:43:24,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 08:43:24,135 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:24,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:24,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1225329468, now seen corresponding path program 1 times [2021-11-07 08:43:24,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:24,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088210184] [2021-11-07 08:43:24,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:24,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:24,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:24,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:24,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:24,214 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088210184] [2021-11-07 08:43:24,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088210184] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:24,214 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:24,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:24,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700323764] [2021-11-07 08:43:24,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:24,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:24,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:24,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:24,216 INFO L87 Difference]: Start difference. First operand 649 states and 1007 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-11-07 08:43:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:24,362 INFO L93 Difference]: Finished difference Result 875 states and 1336 transitions. [2021-11-07 08:43:24,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:24,363 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-11-07 08:43:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:24,369 INFO L225 Difference]: With dead ends: 875 [2021-11-07 08:43:24,370 INFO L226 Difference]: Without dead ends: 875 [2021-11-07 08:43:24,371 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2021-11-07 08:43:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2021-11-07 08:43:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 869 states have (on average 1.532796317606444) internal successors, (1332), 869 states have internal predecessors, (1332), 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-11-07 08:43:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1335 transitions. [2021-11-07 08:43:24,399 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1335 transitions. Word has length 24 [2021-11-07 08:43:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:24,400 INFO L470 AbstractCegarLoop]: Abstraction has 873 states and 1335 transitions. [2021-11-07 08:43:24,400 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-11-07 08:43:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1335 transitions. [2021-11-07 08:43:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 08:43:24,402 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:24,403 INFO L513 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-11-07 08:43:24,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 08:43:24,403 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:24,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash -82471071, now seen corresponding path program 1 times [2021-11-07 08:43:24,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:24,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247477517] [2021-11-07 08:43:24,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:24,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:24,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:24,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:24,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247477517] [2021-11-07 08:43:24,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247477517] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:24,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:24,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:24,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097342991] [2021-11-07 08:43:24,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:24,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:24,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:24,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:24,473 INFO L87 Difference]: Start difference. First operand 873 states and 1335 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-11-07 08:43:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:24,624 INFO L93 Difference]: Finished difference Result 891 states and 1336 transitions. [2021-11-07 08:43:24,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:24,624 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-11-07 08:43:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:24,631 INFO L225 Difference]: With dead ends: 891 [2021-11-07 08:43:24,631 INFO L226 Difference]: Without dead ends: 891 [2021-11-07 08:43:24,634 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2021-11-07 08:43:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2021-11-07 08:43:24,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 885 states have (on average 1.505084745762712) internal successors, (1332), 885 states have internal predecessors, (1332), 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-11-07 08:43:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1335 transitions. [2021-11-07 08:43:24,669 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1335 transitions. Word has length 25 [2021-11-07 08:43:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:24,669 INFO L470 AbstractCegarLoop]: Abstraction has 889 states and 1335 transitions. [2021-11-07 08:43:24,670 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-11-07 08:43:24,670 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1335 transitions. [2021-11-07 08:43:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 08:43:24,672 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:24,672 INFO L513 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-11-07 08:43:24,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 08:43:24,672 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:24,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:24,675 INFO L85 PathProgramCache]: Analyzing trace with hash -669277085, now seen corresponding path program 1 times [2021-11-07 08:43:24,676 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:24,676 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195566945] [2021-11-07 08:43:24,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:24,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:24,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:24,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:24,733 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195566945] [2021-11-07 08:43:24,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195566945] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:24,736 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:24,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:24,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171682508] [2021-11-07 08:43:24,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:24,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:24,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:24,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:24,738 INFO L87 Difference]: Start difference. First operand 889 states and 1335 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-11-07 08:43:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:24,888 INFO L93 Difference]: Finished difference Result 1547 states and 2328 transitions. [2021-11-07 08:43:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:24,889 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-11-07 08:43:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:24,900 INFO L225 Difference]: With dead ends: 1547 [2021-11-07 08:43:24,900 INFO L226 Difference]: Without dead ends: 1547 [2021-11-07 08:43:24,900 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2021-11-07 08:43:24,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1289. [2021-11-07 08:43:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1285 states have (on average 1.4599221789883268) internal successors, (1876), 1285 states have internal predecessors, (1876), 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-11-07 08:43:24,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1879 transitions. [2021-11-07 08:43:24,944 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1879 transitions. Word has length 25 [2021-11-07 08:43:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:24,945 INFO L470 AbstractCegarLoop]: Abstraction has 1289 states and 1879 transitions. [2021-11-07 08:43:24,946 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-11-07 08:43:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1879 transitions. [2021-11-07 08:43:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 08:43:24,949 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:24,949 INFO L513 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-11-07 08:43:24,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 08:43:24,951 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:24,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:24,953 INFO L85 PathProgramCache]: Analyzing trace with hash -411111647, now seen corresponding path program 1 times [2021-11-07 08:43:24,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:24,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479044051] [2021-11-07 08:43:24,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:24,958 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:25,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:25,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:25,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479044051] [2021-11-07 08:43:25,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479044051] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:25,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:25,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:25,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927177913] [2021-11-07 08:43:25,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:25,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:25,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:25,022 INFO L87 Difference]: Start difference. First operand 1289 states and 1879 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-11-07 08:43:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:25,176 INFO L93 Difference]: Finished difference Result 1707 states and 2440 transitions. [2021-11-07 08:43:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:25,177 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-11-07 08:43:25,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:25,189 INFO L225 Difference]: With dead ends: 1707 [2021-11-07 08:43:25,189 INFO L226 Difference]: Without dead ends: 1707 [2021-11-07 08:43:25,190 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2021-11-07 08:43:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1705. [2021-11-07 08:43:25,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1701 states have (on average 1.4320987654320987) internal successors, (2436), 1701 states have internal predecessors, (2436), 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-11-07 08:43:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2439 transitions. [2021-11-07 08:43:25,256 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2439 transitions. Word has length 25 [2021-11-07 08:43:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:25,256 INFO L470 AbstractCegarLoop]: Abstraction has 1705 states and 2439 transitions. [2021-11-07 08:43:25,256 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-11-07 08:43:25,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2439 transitions. [2021-11-07 08:43:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 08:43:25,259 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:25,260 INFO L513 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-11-07 08:43:25,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 08:43:25,260 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:25,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:25,261 INFO L85 PathProgramCache]: Analyzing trace with hash 727462257, now seen corresponding path program 1 times [2021-11-07 08:43:25,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:25,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600904070] [2021-11-07 08:43:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:25,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:25,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:25,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:25,320 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600904070] [2021-11-07 08:43:25,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600904070] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:25,320 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:25,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:25,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056543491] [2021-11-07 08:43:25,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:25,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:25,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:25,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:25,324 INFO L87 Difference]: Start difference. First operand 1705 states and 2439 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-11-07 08:43:25,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:25,482 INFO L93 Difference]: Finished difference Result 1739 states and 2440 transitions. [2021-11-07 08:43:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:25,483 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-11-07 08:43:25,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:25,492 INFO L225 Difference]: With dead ends: 1739 [2021-11-07 08:43:25,492 INFO L226 Difference]: Without dead ends: 1739 [2021-11-07 08:43:25,493 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2021-11-07 08:43:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1737. [2021-11-07 08:43:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1733 states have (on average 1.4056549336410848) internal successors, (2436), 1733 states have internal predecessors, (2436), 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-11-07 08:43:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2439 transitions. [2021-11-07 08:43:25,541 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2439 transitions. Word has length 26 [2021-11-07 08:43:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:25,541 INFO L470 AbstractCegarLoop]: Abstraction has 1737 states and 2439 transitions. [2021-11-07 08:43:25,542 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-11-07 08:43:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2439 transitions. [2021-11-07 08:43:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 08:43:25,544 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:25,545 INFO L513 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-11-07 08:43:25,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 08:43:25,545 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:25,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:25,546 INFO L85 PathProgramCache]: Analyzing trace with hash 140656243, now seen corresponding path program 1 times [2021-11-07 08:43:25,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:25,546 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710395103] [2021-11-07 08:43:25,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:25,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:25,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:25,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:25,593 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710395103] [2021-11-07 08:43:25,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710395103] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:25,593 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:25,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:25,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211790271] [2021-11-07 08:43:25,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:25,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:25,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:25,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:25,595 INFO L87 Difference]: Start difference. First operand 1737 states and 2439 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-11-07 08:43:25,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:25,720 INFO L93 Difference]: Finished difference Result 2955 states and 4136 transitions. [2021-11-07 08:43:25,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:25,721 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-11-07 08:43:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:25,736 INFO L225 Difference]: With dead ends: 2955 [2021-11-07 08:43:25,736 INFO L226 Difference]: Without dead ends: 2955 [2021-11-07 08:43:25,737 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2021-11-07 08:43:25,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2569. [2021-11-07 08:43:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 2565 states have (on average 1.3614035087719298) internal successors, (3492), 2565 states have internal predecessors, (3492), 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-11-07 08:43:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3495 transitions. [2021-11-07 08:43:25,800 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3495 transitions. Word has length 26 [2021-11-07 08:43:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:25,801 INFO L470 AbstractCegarLoop]: Abstraction has 2569 states and 3495 transitions. [2021-11-07 08:43:25,801 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-11-07 08:43:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3495 transitions. [2021-11-07 08:43:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-07 08:43:25,805 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:25,805 INFO L513 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-11-07 08:43:25,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 08:43:25,806 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:25,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash 398821681, now seen corresponding path program 1 times [2021-11-07 08:43:25,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:25,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369443748] [2021-11-07 08:43:25,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:25,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:25,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:25,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:25,846 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369443748] [2021-11-07 08:43:25,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369443748] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:25,846 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:25,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:25,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745054550] [2021-11-07 08:43:25,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:25,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:25,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:25,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:25,848 INFO L87 Difference]: Start difference. First operand 2569 states and 3495 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-11-07 08:43:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:25,976 INFO L93 Difference]: Finished difference Result 3339 states and 4424 transitions. [2021-11-07 08:43:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:25,977 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-11-07 08:43:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:25,996 INFO L225 Difference]: With dead ends: 3339 [2021-11-07 08:43:25,996 INFO L226 Difference]: Without dead ends: 3339 [2021-11-07 08:43:25,996 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:26,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2021-11-07 08:43:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 3337. [2021-11-07 08:43:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3337 states, 3333 states have (on average 1.326132613261326) internal successors, (4420), 3333 states have internal predecessors, (4420), 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-11-07 08:43:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3337 states to 3337 states and 4423 transitions. [2021-11-07 08:43:26,122 INFO L78 Accepts]: Start accepts. Automaton has 3337 states and 4423 transitions. Word has length 26 [2021-11-07 08:43:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:26,122 INFO L470 AbstractCegarLoop]: Abstraction has 3337 states and 4423 transitions. [2021-11-07 08:43:26,123 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-11-07 08:43:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 3337 states and 4423 transitions. [2021-11-07 08:43:26,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 08:43:26,128 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:26,128 INFO L513 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-11-07 08:43:26,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-07 08:43:26,129 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:26,130 INFO L85 PathProgramCache]: Analyzing trace with hash 65591990, now seen corresponding path program 1 times [2021-11-07 08:43:26,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:26,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451543660] [2021-11-07 08:43:26,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:26,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:26,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:26,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:26,202 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451543660] [2021-11-07 08:43:26,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451543660] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:26,203 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:26,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:26,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061067221] [2021-11-07 08:43:26,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:26,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:26,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:26,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:26,206 INFO L87 Difference]: Start difference. First operand 3337 states and 4423 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-11-07 08:43:26,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:26,332 INFO L93 Difference]: Finished difference Result 3403 states and 4424 transitions. [2021-11-07 08:43:26,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:26,333 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-11-07 08:43:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:26,353 INFO L225 Difference]: With dead ends: 3403 [2021-11-07 08:43:26,353 INFO L226 Difference]: Without dead ends: 3403 [2021-11-07 08:43:26,354 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2021-11-07 08:43:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3401. [2021-11-07 08:43:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3401 states, 3397 states have (on average 1.3011480718280837) internal successors, (4420), 3397 states have internal predecessors, (4420), 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-11-07 08:43:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 4423 transitions. [2021-11-07 08:43:26,474 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 4423 transitions. Word has length 27 [2021-11-07 08:43:26,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:26,475 INFO L470 AbstractCegarLoop]: Abstraction has 3401 states and 4423 transitions. [2021-11-07 08:43:26,475 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-11-07 08:43:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 4423 transitions. [2021-11-07 08:43:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 08:43:26,483 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:26,483 INFO L513 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-11-07 08:43:26,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-07 08:43:26,483 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:26,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash -521214024, now seen corresponding path program 1 times [2021-11-07 08:43:26,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:26,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731774535] [2021-11-07 08:43:26,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:26,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:26,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:26,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:26,540 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731774535] [2021-11-07 08:43:26,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731774535] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:26,541 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:26,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:26,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085836221] [2021-11-07 08:43:26,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:26,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:26,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:26,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:26,543 INFO L87 Difference]: Start difference. First operand 3401 states and 4423 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-11-07 08:43:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:26,683 INFO L93 Difference]: Finished difference Result 5643 states and 7240 transitions. [2021-11-07 08:43:26,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:26,684 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-11-07 08:43:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:26,736 INFO L225 Difference]: With dead ends: 5643 [2021-11-07 08:43:26,736 INFO L226 Difference]: Without dead ends: 5643 [2021-11-07 08:43:26,737 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5643 states. [2021-11-07 08:43:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5643 to 5129. [2021-11-07 08:43:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5129 states, 5125 states have (on average 1.2620487804878049) internal successors, (6468), 5125 states have internal predecessors, (6468), 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-11-07 08:43:26,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5129 states to 5129 states and 6471 transitions. [2021-11-07 08:43:26,879 INFO L78 Accepts]: Start accepts. Automaton has 5129 states and 6471 transitions. Word has length 27 [2021-11-07 08:43:26,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:26,880 INFO L470 AbstractCegarLoop]: Abstraction has 5129 states and 6471 transitions. [2021-11-07 08:43:26,880 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-11-07 08:43:26,880 INFO L276 IsEmpty]: Start isEmpty. Operand 5129 states and 6471 transitions. [2021-11-07 08:43:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 08:43:26,889 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:26,890 INFO L513 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-11-07 08:43:26,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-07 08:43:26,890 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:26,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:26,891 INFO L85 PathProgramCache]: Analyzing trace with hash -263048586, now seen corresponding path program 1 times [2021-11-07 08:43:26,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:26,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551265441] [2021-11-07 08:43:26,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:26,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:26,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:26,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:26,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:26,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551265441] [2021-11-07 08:43:26,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551265441] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:26,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:26,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:26,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86758928] [2021-11-07 08:43:26,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:26,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:26,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:26,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:26,944 INFO L87 Difference]: Start difference. First operand 5129 states and 6471 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-11-07 08:43:27,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:27,135 INFO L93 Difference]: Finished difference Result 6539 states and 7944 transitions. [2021-11-07 08:43:27,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:27,136 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-11-07 08:43:27,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:27,165 INFO L225 Difference]: With dead ends: 6539 [2021-11-07 08:43:27,166 INFO L226 Difference]: Without dead ends: 6539 [2021-11-07 08:43:27,166 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6539 states. [2021-11-07 08:43:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6539 to 6537. [2021-11-07 08:43:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6537 states, 6533 states have (on average 1.2153681310270932) internal successors, (7940), 6533 states have internal predecessors, (7940), 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-11-07 08:43:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6537 states to 6537 states and 7943 transitions. [2021-11-07 08:43:27,338 INFO L78 Accepts]: Start accepts. Automaton has 6537 states and 7943 transitions. Word has length 27 [2021-11-07 08:43:27,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:27,339 INFO L470 AbstractCegarLoop]: Abstraction has 6537 states and 7943 transitions. [2021-11-07 08:43:27,340 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-11-07 08:43:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 6537 states and 7943 transitions. [2021-11-07 08:43:27,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 08:43:27,350 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:27,350 INFO L513 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-11-07 08:43:27,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-07 08:43:27,351 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:27,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:27,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1022450534, now seen corresponding path program 1 times [2021-11-07 08:43:27,353 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:27,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685773554] [2021-11-07 08:43:27,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:27,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:27,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:27,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:27,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685773554] [2021-11-07 08:43:27,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685773554] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:27,405 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:27,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:27,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599765696] [2021-11-07 08:43:27,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:27,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:27,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:27,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:27,407 INFO L87 Difference]: Start difference. First operand 6537 states and 7943 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-11-07 08:43:27,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:27,592 INFO L93 Difference]: Finished difference Result 6667 states and 7944 transitions. [2021-11-07 08:43:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:27,593 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-11-07 08:43:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:27,607 INFO L225 Difference]: With dead ends: 6667 [2021-11-07 08:43:27,607 INFO L226 Difference]: Without dead ends: 6667 [2021-11-07 08:43:27,608 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:27,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2021-11-07 08:43:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 6665. [2021-11-07 08:43:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6665 states, 6661 states have (on average 1.1920132112295452) internal successors, (7940), 6661 states have internal predecessors, (7940), 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-11-07 08:43:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6665 states to 6665 states and 7943 transitions. [2021-11-07 08:43:27,744 INFO L78 Accepts]: Start accepts. Automaton has 6665 states and 7943 transitions. Word has length 28 [2021-11-07 08:43:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:27,745 INFO L470 AbstractCegarLoop]: Abstraction has 6665 states and 7943 transitions. [2021-11-07 08:43:27,745 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-11-07 08:43:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 6665 states and 7943 transitions. [2021-11-07 08:43:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 08:43:27,755 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:27,755 INFO L513 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-11-07 08:43:27,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-07 08:43:27,756 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash 435644520, now seen corresponding path program 1 times [2021-11-07 08:43:27,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:27,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395346837] [2021-11-07 08:43:27,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:27,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:27,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:27,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-11-07 08:43:27,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:27,812 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395346837] [2021-11-07 08:43:27,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395346837] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:27,812 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:27,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:27,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709976731] [2021-11-07 08:43:27,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:27,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:27,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:27,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:27,814 INFO L87 Difference]: Start difference. First operand 6665 states and 7943 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-11-07 08:43:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:27,992 INFO L93 Difference]: Finished difference Result 10761 states and 12423 transitions. [2021-11-07 08:43:27,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:27,993 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-11-07 08:43:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:28,015 INFO L225 Difference]: With dead ends: 10761 [2021-11-07 08:43:28,015 INFO L226 Difference]: Without dead ends: 10761 [2021-11-07 08:43:28,016 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10761 states. [2021-11-07 08:43:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10761 to 10249. [2021-11-07 08:43:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10249 states, 10245 states have (on average 1.16232308443143) internal successors, (11908), 10245 states have internal predecessors, (11908), 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-11-07 08:43:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10249 states to 10249 states and 11911 transitions. [2021-11-07 08:43:28,291 INFO L78 Accepts]: Start accepts. Automaton has 10249 states and 11911 transitions. Word has length 28 [2021-11-07 08:43:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:28,292 INFO L470 AbstractCegarLoop]: Abstraction has 10249 states and 11911 transitions. [2021-11-07 08:43:28,292 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-11-07 08:43:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 10249 states and 11911 transitions. [2021-11-07 08:43:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-07 08:43:28,314 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 08:43:28,315 INFO L513 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-11-07 08:43:28,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-07 08:43:28,315 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr1ENSURES_VIOLATIONMEMORY_LEAK] === [2021-11-07 08:43:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 08:43:28,316 INFO L85 PathProgramCache]: Analyzing trace with hash 693809958, now seen corresponding path program 1 times [2021-11-07 08:43:28,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 08:43:28,316 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831083441] [2021-11-07 08:43:28,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 08:43:28,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 08:43:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:28,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-07 08:43:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 08:43:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 08:43:28,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 08:43:28,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831083441] [2021-11-07 08:43:28,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831083441] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 08:43:28,369 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 08:43:28,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 08:43:28,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89693286] [2021-11-07 08:43:28,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 08:43:28,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 08:43:28,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 08:43:28,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 08:43:28,375 INFO L87 Difference]: Start difference. First operand 10249 states and 11911 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-11-07 08:43:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 08:43:28,545 INFO L93 Difference]: Finished difference Result 12807 states and 14086 transitions. [2021-11-07 08:43:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 08:43:28,546 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-11-07 08:43:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 08:43:28,547 INFO L225 Difference]: With dead ends: 12807 [2021-11-07 08:43:28,547 INFO L226 Difference]: Without dead ends: 0 [2021-11-07 08:43:28,547 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 08:43:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-07 08:43:28,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-07 08:43:28,548 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-11-07 08:43:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-07 08:43:28,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2021-11-07 08:43:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 08:43:28,549 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-07 08:43:28,549 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-11-07 08:43:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-07 08:43:28,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-07 08:43:28,553 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 08:43:28,554 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr1ENSURES_VIOLATIONMEMORY_LEAK [2021-11-07 08:43:28,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-07 08:43:28,562 INFO L731 BasicCegarLoop]: Path program 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-11-07 08:43:28,567 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 08:43:28,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:43:28 BoogieIcfgContainer [2021-11-07 08:43:28,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 08:43:28,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 08:43:28,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 08:43:28,572 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 08:43:28,573 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:43:19" (3/4) ... [2021-11-07 08:43:28,576 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-07 08:43:28,585 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-11-07 08:43:28,585 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-11-07 08:43:28,586 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-11-07 08:43:28,600 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-11-07 08:43:28,600 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-07 08:43:28,601 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-07 08:43:28,601 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-07 08:43:28,677 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/witness.graphml [2021-11-07 08:43:28,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 08:43:28,680 INFO L168 Benchmark]: Toolchain (without parser) took 9605.61 ms. Allocated memory was 113.2 MB in the beginning and 243.3 MB in the end (delta: 130.0 MB). Free memory was 83.5 MB in the beginning and 126.4 MB in the end (delta: -42.9 MB). Peak memory consumption was 85.9 MB. Max. memory is 16.1 GB. [2021-11-07 08:43:28,681 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 113.2 MB. Free memory is still 66.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:43:28,681 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.12 ms. Allocated memory is still 113.2 MB. Free memory was 83.2 MB in the beginning and 87.1 MB in the end (delta: -3.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 08:43:28,682 INFO L168 Benchmark]: Boogie Preprocessor took 36.68 ms. Allocated memory is still 113.2 MB. Free memory was 87.1 MB in the beginning and 85.5 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 08:43:28,683 INFO L168 Benchmark]: RCFGBuilder took 448.47 ms. Allocated memory is still 113.2 MB. Free memory was 85.5 MB in the beginning and 73.3 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-07 08:43:28,683 INFO L168 Benchmark]: TraceAbstraction took 8757.65 ms. Allocated memory was 113.2 MB in the beginning and 243.3 MB in the end (delta: 130.0 MB). Free memory was 72.9 MB in the beginning and 130.6 MB in the end (delta: -57.7 MB). Peak memory consumption was 74.4 MB. Max. memory is 16.1 GB. [2021-11-07 08:43:28,684 INFO L168 Benchmark]: Witness Printer took 105.92 ms. Allocated memory is still 243.3 MB. Free memory was 130.6 MB in the beginning and 126.4 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 08:43:28,686 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.23 ms. Allocated memory is still 113.2 MB. Free memory is still 66.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 248.12 ms. Allocated memory is still 113.2 MB. Free memory was 83.2 MB in the beginning and 87.1 MB in the end (delta: -3.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.68 ms. Allocated memory is still 113.2 MB. Free memory was 87.1 MB in the beginning and 85.5 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 448.47 ms. Allocated memory is still 113.2 MB. Free memory was 85.5 MB in the beginning and 73.3 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8757.65 ms. Allocated memory was 113.2 MB in the beginning and 243.3 MB in the end (delta: 130.0 MB). Free memory was 72.9 MB in the beginning and 130.6 MB in the end (delta: -57.7 MB). Peak memory consumption was 74.4 MB. Max. memory is 16.1 GB. * Witness Printer took 105.92 ms. Allocated memory is still 243.3 MB. Free memory was 130.6 MB in the beginning and 126.4 MB 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: 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, 46 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2001 SDtfs, 2914 SDslu, 153 SDs, 0 SdLazy, 1413 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10249occurred in iteration=25, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 1900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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-11-07 08:43:28,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b0562b8f-4ac5-439c-9766-5fdee8fb0fe6/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE