./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX --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 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 09:51:28,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:51:28,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:51:28,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:51:28,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:51:28,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:51:28,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:51:28,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:51:28,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:51:28,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:51:28,320 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:51:28,322 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:51:28,323 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:51:28,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:51:28,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:51:28,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:51:28,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:51:28,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:51:28,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:51:28,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:51:28,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:51:28,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:51:28,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:51:28,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:51:28,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:51:28,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:51:28,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:51:28,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:51:28,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:51:28,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:51:28,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:51:28,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:51:28,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:51:28,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:51:28,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:51:28,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:51:28,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:51:28,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:51:28,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:51:28,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:51:28,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:51:28,411 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-11-09 09:51:28,470 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:51:28,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:51:28,475 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:51:28,475 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:51:28,477 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:51:28,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:51:28,478 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:51:28,478 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:51:28,478 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 09:51:28,479 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-09 09:51:28,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 09:51:28,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 09:51:28,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:51:28,481 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-09 09:51:28,481 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-09 09:51:28,481 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-11-09 09:51:28,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 09:51:28,482 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-09 09:51:28,482 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 09:51:28,482 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:51:28,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:51:28,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:51:28,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 09:51:28,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:51:28,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:51:28,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 09:51:28,484 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 09:51:28,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 09:51:28,484 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:51:28,486 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_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/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_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX 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 -> 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c [2021-11-09 09:51:28,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:51:28,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:51:28,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:51:28,832 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:51:28,833 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:51:28,834 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-11-09 09:51:28,920 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/data/16c7a6232/7eb0899988b74f27b3ff0f5b3364a7ba/FLAG53f6513b0 [2021-11-09 09:51:29,616 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:51:29,617 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-11-09 09:51:29,649 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/data/16c7a6232/7eb0899988b74f27b3ff0f5b3364a7ba/FLAG53f6513b0 [2021-11-09 09:51:29,908 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/data/16c7a6232/7eb0899988b74f27b3ff0f5b3364a7ba [2021-11-09 09:51:29,911 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:51:29,913 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-09 09:51:29,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:51:29,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:51:29,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:51:29,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:51:29" (1/1) ... [2021-11-09 09:51:29,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3198d41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:51:29, skipping insertion in model container [2021-11-09 09:51:29,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:51:29" (1/1) ... [2021-11-09 09:51:29,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:51:29,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:51:30,197 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_fbb91f27-420f-4016-86db-9c002d344778/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-11-09 09:51:30,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:51:30,465 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:51:30,498 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_fbb91f27-420f-4016-86db-9c002d344778/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2021-11-09 09:51:30,615 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:51:30,645 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:51:30,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:51:30 WrapperNode [2021-11-09 09:51:30,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:51:30,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:51:30,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:51:30,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:51:30,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:51:30" (1/1) ... [2021-11-09 09:51:30,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:51:30" (1/1) ... [2021-11-09 09:51:30,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:51:30" (1/1) ... [2021-11-09 09:51:30,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:51:30" (1/1) ... [2021-11-09 09:51:30,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:51:30" (1/1) ... [2021-11-09 09:51:30,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:51:30" (1/1) ... [2021-11-09 09:51:30,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:51:30" (1/1) ... [2021-11-09 09:51:30,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:51:30,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:51:30,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:51:30,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:51:30,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:51:30" (1/1) ... [2021-11-09 09:51:30,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:51:30,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:51:30,858 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 09:51:30,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 09:51:30,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-11-09 09:51:30,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:51:30,917 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-11-09 09:51:30,918 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-11-09 09:51:30,918 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-11-09 09:51:30,918 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2021-11-09 09:51:30,918 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2021-11-09 09:51:30,919 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2021-11-09 09:51:30,919 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2021-11-09 09:51:30,921 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2021-11-09 09:51:30,921 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2021-11-09 09:51:30,921 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2021-11-09 09:51:30,921 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2021-11-09 09:51:30,921 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2021-11-09 09:51:30,921 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2021-11-09 09:51:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2021-11-09 09:51:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2021-11-09 09:51:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2021-11-09 09:51:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2021-11-09 09:51:30,922 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-11-09 09:51:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-11-09 09:51:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-11-09 09:51:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-11-09 09:51:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-11-09 09:51:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-11-09 09:51:30,923 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-11-09 09:51:30,924 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-11-09 09:51:30,924 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2021-11-09 09:51:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-11-09 09:51:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-11-09 09:51:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-11-09 09:51:30,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:51:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-11-09 09:51:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-11-09 09:51:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-11-09 09:51:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2021-11-09 09:51:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2021-11-09 09:51:30,925 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2021-11-09 09:51:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2021-11-09 09:51:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2021-11-09 09:51:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2021-11-09 09:51:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2021-11-09 09:51:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2021-11-09 09:51:30,926 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2021-11-09 09:51:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2021-11-09 09:51:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2021-11-09 09:51:30,927 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2021-11-09 09:51:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-11-09 09:51:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-11-09 09:51:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-11-09 09:51:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-11-09 09:51:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2021-11-09 09:51:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-11-09 09:51:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-11-09 09:51:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-11-09 09:51:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2021-11-09 09:51:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2021-11-09 09:51:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-11-09 09:51:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-11-09 09:51:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-11-09 09:51:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-11-09 09:51:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 09:51:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:51:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-09 09:51:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-09 09:51:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-09 09:51:31,303 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 09:51:31,587 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-11-09 09:51:31,587 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-11-09 09:51:31,600 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 09:51:31,659 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2021-11-09 09:51:31,660 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2021-11-09 09:51:31,711 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 09:51:31,754 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-11-09 09:51:31,754 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-11-09 09:51:31,769 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 09:51:31,780 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-11-09 09:51:31,780 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-11-09 09:51:32,005 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 09:51:32,040 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-11-09 09:51:32,041 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-11-09 09:51:32,076 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-11-09 09:51:32,092 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2021-11-09 09:51:32,093 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2021-11-09 09:51:32,172 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:51:32,174 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-09 09:51:32,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:51:32 BoogieIcfgContainer [2021-11-09 09:51:32,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:51:32,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 09:51:32,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 09:51:32,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 09:51:32,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:51:29" (1/3) ... [2021-11-09 09:51:32,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da04535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:51:32, skipping insertion in model container [2021-11-09 09:51:32,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:51:30" (2/3) ... [2021-11-09 09:51:32,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da04535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:51:32, skipping insertion in model container [2021-11-09 09:51:32,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:51:32" (3/3) ... [2021-11-09 09:51:32,192 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2021-11-09 09:51:32,200 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 09:51:32,200 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-09 09:51:32,283 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 09:51:32,292 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-09 09:51:32,292 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-09 09:51:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 206 states have (on average 1.4320388349514563) internal successors, (295), 225 states have internal predecessors, (295), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) [2021-11-09 09:51:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-09 09:51:32,346 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:32,347 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:51:32,348 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:32,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1560408711, now seen corresponding path program 1 times [2021-11-09 09:51:32,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:32,368 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785581679] [2021-11-09 09:51:32,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:32,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:32,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:33,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:33,037 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-09 09:51:33,038 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:33,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785581679] [2021-11-09 09:51:33,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785581679] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:33,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:33,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:51:33,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059371798] [2021-11-09 09:51:33,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:51:33,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:33,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:51:33,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:51:33,080 INFO L87 Difference]: Start difference. First operand has 296 states, 206 states have (on average 1.4320388349514563) internal successors, (295), 225 states have internal predecessors, (295), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-09 09:51:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:34,211 INFO L93 Difference]: Finished difference Result 332 states and 459 transitions. [2021-11-09 09:51:34,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:51:34,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-11-09 09:51:34,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:34,243 INFO L225 Difference]: With dead ends: 332 [2021-11-09 09:51:34,245 INFO L226 Difference]: Without dead ends: 326 [2021-11-09 09:51:34,256 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:51:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-11-09 09:51:34,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2021-11-09 09:51:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 201 states have (on average 1.3781094527363185) internal successors, (277), 217 states have internal predecessors, (277), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-11-09 09:51:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 384 transitions. [2021-11-09 09:51:34,340 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 384 transitions. Word has length 15 [2021-11-09 09:51:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:34,341 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 384 transitions. [2021-11-09 09:51:34,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-09 09:51:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 384 transitions. [2021-11-09 09:51:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-11-09 09:51:34,343 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:34,343 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-09 09:51:34,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 09:51:34,344 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:34,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:34,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1302515818, now seen corresponding path program 1 times [2021-11-09 09:51:34,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:34,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592094603] [2021-11-09 09:51:34,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:34,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:34,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:34,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:34,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:51:34,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:34,628 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592094603] [2021-11-09 09:51:34,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592094603] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:34,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:34,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:51:34,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909803685] [2021-11-09 09:51:34,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 09:51:34,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:34,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:51:34,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:51:34,634 INFO L87 Difference]: Start difference. First operand 287 states and 384 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-09 09:51:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:35,919 INFO L93 Difference]: Finished difference Result 331 states and 451 transitions. [2021-11-09 09:51:35,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:51:35,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2021-11-09 09:51:35,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:35,924 INFO L225 Difference]: With dead ends: 331 [2021-11-09 09:51:35,924 INFO L226 Difference]: Without dead ends: 326 [2021-11-09 09:51:35,925 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:51:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-11-09 09:51:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2021-11-09 09:51:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 201 states have (on average 1.373134328358209) internal successors, (276), 217 states have internal predecessors, (276), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2021-11-09 09:51:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2021-11-09 09:51:35,975 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2021-11-09 09:51:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:35,976 INFO L470 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2021-11-09 09:51:35,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-11-09 09:51:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2021-11-09 09:51:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-09 09:51:35,978 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:35,978 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-09 09:51:35,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 09:51:35,979 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:35,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:35,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1551281276, now seen corresponding path program 1 times [2021-11-09 09:51:35,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:35,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602850074] [2021-11-09 09:51:35,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:35,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:36,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:36,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:36,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:51:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:36,286 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-09 09:51:36,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:36,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602850074] [2021-11-09 09:51:36,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602850074] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:36,288 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:36,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 09:51:36,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419815402] [2021-11-09 09:51:36,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:51:36,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:36,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:51:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:51:36,292 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-09 09:51:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:38,467 INFO L93 Difference]: Finished difference Result 508 states and 702 transitions. [2021-11-09 09:51:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:51:38,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2021-11-09 09:51:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:38,474 INFO L225 Difference]: With dead ends: 508 [2021-11-09 09:51:38,474 INFO L226 Difference]: Without dead ends: 507 [2021-11-09 09:51:38,474 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:51:38,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-11-09 09:51:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2021-11-09 09:51:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 318 states have (on average 1.3459119496855345) internal successors, (428), 329 states have internal predecessors, (428), 80 states have call successors, (80), 37 states have call predecessors, (80), 41 states have return successors, (100), 77 states have call predecessors, (100), 68 states have call successors, (100) [2021-11-09 09:51:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 608 transitions. [2021-11-09 09:51:38,522 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 608 transitions. Word has length 25 [2021-11-09 09:51:38,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:38,523 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 608 transitions. [2021-11-09 09:51:38,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-09 09:51:38,523 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2021-11-09 09:51:38,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-09 09:51:38,526 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:38,526 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, 1, 1, 1] [2021-11-09 09:51:38,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 09:51:38,527 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:38,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1085614475, now seen corresponding path program 1 times [2021-11-09 09:51:38,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:38,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958142036] [2021-11-09 09:51:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:38,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:38,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:38,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:38,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:51:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:38,837 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-09 09:51:38,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:38,838 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958142036] [2021-11-09 09:51:38,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958142036] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:38,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:38,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 09:51:38,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644678253] [2021-11-09 09:51:38,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:51:38,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:38,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:51:38,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:51:38,846 INFO L87 Difference]: Start difference. First operand 440 states and 608 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-09 09:51:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:40,892 INFO L93 Difference]: Finished difference Result 690 states and 979 transitions. [2021-11-09 09:51:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:51:40,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2021-11-09 09:51:40,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:40,902 INFO L225 Difference]: With dead ends: 690 [2021-11-09 09:51:40,902 INFO L226 Difference]: Without dead ends: 690 [2021-11-09 09:51:40,903 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:51:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2021-11-09 09:51:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 618. [2021-11-09 09:51:40,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.3560439560439561) internal successors, (617), 466 states have internal predecessors, (617), 109 states have call successors, (109), 49 states have call predecessors, (109), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2021-11-09 09:51:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 888 transitions. [2021-11-09 09:51:40,975 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 888 transitions. Word has length 31 [2021-11-09 09:51:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:40,976 INFO L470 AbstractCegarLoop]: Abstraction has 618 states and 888 transitions. [2021-11-09 09:51:40,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-09 09:51:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 888 transitions. [2021-11-09 09:51:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-09 09:51:40,988 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:40,989 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:51:40,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 09:51:40,989 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1025634350, now seen corresponding path program 1 times [2021-11-09 09:51:40,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:40,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158246155] [2021-11-09 09:51:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:40,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:41,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:41,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:41,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:51:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:41,283 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-09 09:51:41,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:41,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158246155] [2021-11-09 09:51:41,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158246155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:41,284 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:41,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 09:51:41,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952708771] [2021-11-09 09:51:41,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:51:41,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:41,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:51:41,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:51:41,288 INFO L87 Difference]: Start difference. First operand 618 states and 888 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-09 09:51:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:42,375 INFO L93 Difference]: Finished difference Result 661 states and 947 transitions. [2021-11-09 09:51:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:51:42,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2021-11-09 09:51:42,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:42,384 INFO L225 Difference]: With dead ends: 661 [2021-11-09 09:51:42,384 INFO L226 Difference]: Without dead ends: 661 [2021-11-09 09:51:42,385 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:51:42,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2021-11-09 09:51:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2021-11-09 09:51:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 466 states have (on average 1.354077253218884) internal successors, (631), 475 states have internal predecessors, (631), 108 states have call successors, (108), 50 states have call predecessors, (108), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2021-11-09 09:51:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 901 transitions. [2021-11-09 09:51:42,457 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 901 transitions. Word has length 36 [2021-11-09 09:51:42,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:42,458 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 901 transitions. [2021-11-09 09:51:42,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-09 09:51:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 901 transitions. [2021-11-09 09:51:42,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-11-09 09:51:42,460 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:42,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:51:42,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 09:51:42,461 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:42,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:42,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1273733766, now seen corresponding path program 1 times [2021-11-09 09:51:42,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:42,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292559164] [2021-11-09 09:51:42,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:42,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:42,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:42,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:42,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:51:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:42,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-09 09:51:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:42,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:51:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:42,864 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-09 09:51:42,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:42,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292559164] [2021-11-09 09:51:42,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292559164] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:42,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:42,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 09:51:42,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127362714] [2021-11-09 09:51:42,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 09:51:42,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:42,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 09:51:42,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:51:42,870 INFO L87 Difference]: Start difference. First operand 628 states and 901 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-09 09:51:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:44,674 INFO L93 Difference]: Finished difference Result 705 states and 1000 transitions. [2021-11-09 09:51:44,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-09 09:51:44,675 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2021-11-09 09:51:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:44,684 INFO L225 Difference]: With dead ends: 705 [2021-11-09 09:51:44,684 INFO L226 Difference]: Without dead ends: 705 [2021-11-09 09:51:44,685 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-11-09 09:51:44,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-11-09 09:51:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2021-11-09 09:51:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.348360655737705) internal successors, (658), 502 states have internal predecessors, (658), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2021-11-09 09:51:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 936 transitions. [2021-11-09 09:51:44,729 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 936 transitions. Word has length 39 [2021-11-09 09:51:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:44,730 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 936 transitions. [2021-11-09 09:51:44,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-09 09:51:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 936 transitions. [2021-11-09 09:51:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-09 09:51:44,736 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:44,736 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:51:44,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 09:51:44,737 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:44,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:44,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1267590478, now seen corresponding path program 1 times [2021-11-09 09:51:44,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:44,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823869099] [2021-11-09 09:51:44,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:44,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:44,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:45,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:45,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:51:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:45,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-09 09:51:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:45,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:51:45,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:45,160 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-09 09:51:45,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:45,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823869099] [2021-11-09 09:51:45,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823869099] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:45,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:45,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 09:51:45,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727978008] [2021-11-09 09:51:45,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 09:51:45,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:45,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 09:51:45,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:51:45,165 INFO L87 Difference]: Start difference. First operand 658 states and 936 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-09 09:51:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:47,830 INFO L93 Difference]: Finished difference Result 705 states and 999 transitions. [2021-11-09 09:51:47,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-09 09:51:47,831 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2021-11-09 09:51:47,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:47,838 INFO L225 Difference]: With dead ends: 705 [2021-11-09 09:51:47,839 INFO L226 Difference]: Without dead ends: 705 [2021-11-09 09:51:47,840 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-11-09 09:51:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2021-11-09 09:51:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2021-11-09 09:51:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.346311475409836) internal successors, (657), 502 states have internal predecessors, (657), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2021-11-09 09:51:47,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 935 transitions. [2021-11-09 09:51:47,884 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 935 transitions. Word has length 40 [2021-11-09 09:51:47,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:47,885 INFO L470 AbstractCegarLoop]: Abstraction has 658 states and 935 transitions. [2021-11-09 09:51:47,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-09 09:51:47,885 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 935 transitions. [2021-11-09 09:51:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-11-09 09:51:47,887 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:47,888 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:51:47,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 09:51:47,888 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:47,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:47,889 INFO L85 PathProgramCache]: Analyzing trace with hash -908144207, now seen corresponding path program 1 times [2021-11-09 09:51:47,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:47,889 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978191849] [2021-11-09 09:51:47,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:47,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:48,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:48,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:48,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:51:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:48,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-09 09:51:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:48,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:51:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:51:48,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:48,117 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978191849] [2021-11-09 09:51:48,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978191849] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:48,118 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:48,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 09:51:48,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373712130] [2021-11-09 09:51:48,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 09:51:48,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:48,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 09:51:48,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:51:48,120 INFO L87 Difference]: Start difference. First operand 658 states and 935 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:51:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:49,740 INFO L93 Difference]: Finished difference Result 1186 states and 1741 transitions. [2021-11-09 09:51:49,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 09:51:49,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2021-11-09 09:51:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:49,754 INFO L225 Difference]: With dead ends: 1186 [2021-11-09 09:51:49,754 INFO L226 Difference]: Without dead ends: 1186 [2021-11-09 09:51:49,754 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2021-11-09 09:51:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2021-11-09 09:51:49,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1085. [2021-11-09 09:51:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 817 states have (on average 1.3635250917992656) internal successors, (1114), 835 states have internal predecessors, (1114), 173 states have call successors, (173), 79 states have call predecessors, (173), 94 states have return successors, (315), 175 states have call predecessors, (315), 163 states have call successors, (315) [2021-11-09 09:51:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1602 transitions. [2021-11-09 09:51:49,825 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1602 transitions. Word has length 41 [2021-11-09 09:51:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:49,827 INFO L470 AbstractCegarLoop]: Abstraction has 1085 states and 1602 transitions. [2021-11-09 09:51:49,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:51:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1602 transitions. [2021-11-09 09:51:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-09 09:51:49,832 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:49,832 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:51:49,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 09:51:49,833 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:49,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:49,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1920333946, now seen corresponding path program 1 times [2021-11-09 09:51:49,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:49,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111927541] [2021-11-09 09:51:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:49,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:50,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:50,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:51:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:50,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-11-09 09:51:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:50,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:51:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:51:50,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:50,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111927541] [2021-11-09 09:51:50,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111927541] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:50,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:50,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-09 09:51:50,131 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83110612] [2021-11-09 09:51:50,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-09 09:51:50,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:50,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-09 09:51:50,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:51:50,141 INFO L87 Difference]: Start difference. First operand 1085 states and 1602 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:51:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:51,696 INFO L93 Difference]: Finished difference Result 1167 states and 1721 transitions. [2021-11-09 09:51:51,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 09:51:51,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2021-11-09 09:51:51,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:51,710 INFO L225 Difference]: With dead ends: 1167 [2021-11-09 09:51:51,710 INFO L226 Difference]: Without dead ends: 1148 [2021-11-09 09:51:51,711 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:51:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2021-11-09 09:51:51,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1078. [2021-11-09 09:51:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 813 states have (on average 1.3640836408364083) internal successors, (1109), 831 states have internal predecessors, (1109), 171 states have call successors, (171), 78 states have call predecessors, (171), 93 states have return successors, (313), 173 states have call predecessors, (313), 161 states have call successors, (313) [2021-11-09 09:51:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1593 transitions. [2021-11-09 09:51:51,774 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1593 transitions. Word has length 42 [2021-11-09 09:51:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:51,774 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1593 transitions. [2021-11-09 09:51:51,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:51:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1593 transitions. [2021-11-09 09:51:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-09 09:51:51,777 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:51,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:51:51,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 09:51:51,778 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:51,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:51,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1961075502, now seen corresponding path program 1 times [2021-11-09 09:51:51,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:51,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809157] [2021-11-09 09:51:51,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:51,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:51,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:52,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:52,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:51:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:52,039 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-09 09:51:52,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:52,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809157] [2021-11-09 09:51:52,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809157] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:52,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:52,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-09 09:51:52,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014298911] [2021-11-09 09:51:52,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:51:52,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:52,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:51:52,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:51:52,043 INFO L87 Difference]: Start difference. First operand 1078 states and 1593 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-09 09:51:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:53,141 INFO L93 Difference]: Finished difference Result 599 states and 851 transitions. [2021-11-09 09:51:53,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:51:53,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2021-11-09 09:51:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:53,148 INFO L225 Difference]: With dead ends: 599 [2021-11-09 09:51:53,148 INFO L226 Difference]: Without dead ends: 599 [2021-11-09 09:51:53,149 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:51:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2021-11-09 09:51:53,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2021-11-09 09:51:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 443 states have (on average 1.327313769751693) internal successors, (588), 455 states have internal predecessors, (588), 102 states have call successors, (102), 47 states have call predecessors, (102), 52 states have return successors, (160), 98 states have call predecessors, (160), 94 states have call successors, (160) [2021-11-09 09:51:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 850 transitions. [2021-11-09 09:51:53,181 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 850 transitions. Word has length 45 [2021-11-09 09:51:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:53,182 INFO L470 AbstractCegarLoop]: Abstraction has 598 states and 850 transitions. [2021-11-09 09:51:53,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-11-09 09:51:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 850 transitions. [2021-11-09 09:51:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-09 09:51:53,185 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:53,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:51:53,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-09 09:51:53,186 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:53,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:53,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1047559429, now seen corresponding path program 1 times [2021-11-09 09:51:53,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:53,190 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984728677] [2021-11-09 09:51:53,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:53,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:53,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:53,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:53,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:51:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-09 09:51:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:53,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:51:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:53,485 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-09 09:51:53,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:53,486 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984728677] [2021-11-09 09:51:53,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984728677] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:53,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:53,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-09 09:51:53,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034512106] [2021-11-09 09:51:53,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-09 09:51:53,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:53,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-09 09:51:53,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:51:53,489 INFO L87 Difference]: Start difference. First operand 598 states and 850 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:51:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:54,464 INFO L93 Difference]: Finished difference Result 625 states and 884 transitions. [2021-11-09 09:51:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:51:54,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2021-11-09 09:51:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:54,471 INFO L225 Difference]: With dead ends: 625 [2021-11-09 09:51:54,471 INFO L226 Difference]: Without dead ends: 608 [2021-11-09 09:51:54,472 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:51:54,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-11-09 09:51:54,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2021-11-09 09:51:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.3257918552036199) internal successors, (586), 454 states have internal predecessors, (586), 101 states have call successors, (101), 47 states have call predecessors, (101), 52 states have return successors, (159), 97 states have call predecessors, (159), 93 states have call successors, (159) [2021-11-09 09:51:54,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 846 transitions. [2021-11-09 09:51:54,505 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 846 transitions. Word has length 46 [2021-11-09 09:51:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:54,506 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 846 transitions. [2021-11-09 09:51:54,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:51:54,506 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 846 transitions. [2021-11-09 09:51:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-09 09:51:54,508 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:54,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:51:54,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 09:51:54,508 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:54,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:54,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1630521075, now seen corresponding path program 1 times [2021-11-09 09:51:54,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:54,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446814325] [2021-11-09 09:51:54,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:54,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:54,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:54,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:51:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:54,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-09 09:51:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:54,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:51:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:54,821 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-09 09:51:54,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:54,822 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446814325] [2021-11-09 09:51:54,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446814325] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:54,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:54,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-09 09:51:54,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452810498] [2021-11-09 09:51:54,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-09 09:51:54,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:54,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-09 09:51:54,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-09 09:51:54,825 INFO L87 Difference]: Start difference. First operand 596 states and 846 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-09 09:51:56,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:56,262 INFO L93 Difference]: Finished difference Result 626 states and 884 transitions. [2021-11-09 09:51:56,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 09:51:56,263 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2021-11-09 09:51:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:56,269 INFO L225 Difference]: With dead ends: 626 [2021-11-09 09:51:56,269 INFO L226 Difference]: Without dead ends: 608 [2021-11-09 09:51:56,270 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-11-09 09:51:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2021-11-09 09:51:56,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2021-11-09 09:51:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.3235294117647058) internal successors, (585), 454 states have internal predecessors, (585), 101 states have call successors, (101), 47 states have call predecessors, (101), 52 states have return successors, (159), 97 states have call predecessors, (159), 93 states have call successors, (159) [2021-11-09 09:51:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 845 transitions. [2021-11-09 09:51:56,299 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 845 transitions. Word has length 46 [2021-11-09 09:51:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:56,300 INFO L470 AbstractCegarLoop]: Abstraction has 596 states and 845 transitions. [2021-11-09 09:51:56,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-09 09:51:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 845 transitions. [2021-11-09 09:51:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-09 09:51:56,303 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:56,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:51:56,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 09:51:56,304 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:56,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:56,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1014081090, now seen corresponding path program 1 times [2021-11-09 09:51:56,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:56,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070550606] [2021-11-09 09:51:56,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:56,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:56,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:56,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:56,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:51:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:56,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-09 09:51:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:56,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 09:51:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:56,615 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-09 09:51:56,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:56,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070550606] [2021-11-09 09:51:56,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070550606] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:56,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:56,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 09:51:56,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285148676] [2021-11-09 09:51:56,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 09:51:56,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:56,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 09:51:56,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:51:56,620 INFO L87 Difference]: Start difference. First operand 596 states and 845 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:51:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:51:58,664 INFO L93 Difference]: Finished difference Result 826 states and 1225 transitions. [2021-11-09 09:51:58,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 09:51:58,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2021-11-09 09:51:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:51:58,673 INFO L225 Difference]: With dead ends: 826 [2021-11-09 09:51:58,673 INFO L226 Difference]: Without dead ends: 826 [2021-11-09 09:51:58,674 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:51:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2021-11-09 09:51:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 665. [2021-11-09 09:51:58,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 495 states have (on average 1.3232323232323233) internal successors, (655), 508 states have internal predecessors, (655), 109 states have call successors, (109), 50 states have call predecessors, (109), 60 states have return successors, (184), 110 states have call predecessors, (184), 101 states have call successors, (184) [2021-11-09 09:51:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 948 transitions. [2021-11-09 09:51:58,730 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 948 transitions. Word has length 46 [2021-11-09 09:51:58,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:51:58,731 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 948 transitions. [2021-11-09 09:51:58,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:51:58,731 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 948 transitions. [2021-11-09 09:51:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-09 09:51:58,733 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:51:58,733 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:51:58,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 09:51:58,734 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:51:58,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:51:58,734 INFO L85 PathProgramCache]: Analyzing trace with hash -74200962, now seen corresponding path program 1 times [2021-11-09 09:51:58,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:51:58,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49740348] [2021-11-09 09:51:58,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:51:58,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:51:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:51:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:58,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:51:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:51:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:58,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-09 09:51:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:51:58,987 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-09 09:51:58,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:51:58,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49740348] [2021-11-09 09:51:58,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49740348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:51:58,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:51:58,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 09:51:58,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58040671] [2021-11-09 09:51:58,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 09:51:58,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:51:58,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 09:51:58,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:51:58,990 INFO L87 Difference]: Start difference. First operand 665 states and 948 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-09 09:52:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:00,571 INFO L93 Difference]: Finished difference Result 462 states and 599 transitions. [2021-11-09 09:52:00,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:52:00,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2021-11-09 09:52:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:00,576 INFO L225 Difference]: With dead ends: 462 [2021-11-09 09:52:00,576 INFO L226 Difference]: Without dead ends: 462 [2021-11-09 09:52:00,577 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:52:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2021-11-09 09:52:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 441. [2021-11-09 09:52:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 327 states have (on average 1.27217125382263) internal successors, (416), 338 states have internal predecessors, (416), 69 states have call successors, (69), 38 states have call predecessors, (69), 44 states have return successors, (93), 68 states have call predecessors, (93), 61 states have call successors, (93) [2021-11-09 09:52:00,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 578 transitions. [2021-11-09 09:52:00,597 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 578 transitions. Word has length 49 [2021-11-09 09:52:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:00,599 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 578 transitions. [2021-11-09 09:52:00,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-09 09:52:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 578 transitions. [2021-11-09 09:52:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-09 09:52:00,601 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:00,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:52:00,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 09:52:00,602 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1824745018, now seen corresponding path program 1 times [2021-11-09 09:52:00,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:00,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959734043] [2021-11-09 09:52:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:00,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:00,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:00,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:00,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:00,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-09 09:52:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:00,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 09:52:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:00,958 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-09 09:52:00,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:00,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959734043] [2021-11-09 09:52:00,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959734043] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:00,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:00,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-09 09:52:00,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192801069] [2021-11-09 09:52:00,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-09 09:52:00,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:00,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-09 09:52:00,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-09 09:52:00,962 INFO L87 Difference]: Start difference. First operand 441 states and 578 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:02,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:02,259 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2021-11-09 09:52:02,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-09 09:52:02,260 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2021-11-09 09:52:02,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:02,264 INFO L225 Difference]: With dead ends: 454 [2021-11-09 09:52:02,264 INFO L226 Difference]: Without dead ends: 453 [2021-11-09 09:52:02,264 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-11-09 09:52:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2021-11-09 09:52:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2021-11-09 09:52:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 334 states have (on average 1.2724550898203593) internal successors, (425), 346 states have internal predecessors, (425), 70 states have call successors, (70), 38 states have call predecessors, (70), 44 states have return successors, (94), 69 states have call predecessors, (94), 62 states have call successors, (94) [2021-11-09 09:52:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2021-11-09 09:52:02,287 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2021-11-09 09:52:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:02,287 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2021-11-09 09:52:02,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2021-11-09 09:52:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-09 09:52:02,290 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:02,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:52:02,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 09:52:02,291 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:02,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:02,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1824468188, now seen corresponding path program 1 times [2021-11-09 09:52:02,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:02,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891822461] [2021-11-09 09:52:02,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:02,295 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:02,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:02,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:02,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:02,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-09 09:52:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:02,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 09:52:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:02,648 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-09 09:52:02,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:02,649 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891822461] [2021-11-09 09:52:02,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891822461] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:02,652 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:02,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-09 09:52:02,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154207995] [2021-11-09 09:52:02,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-09 09:52:02,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:02,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-09 09:52:02,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-09 09:52:02,655 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:03,578 INFO L93 Difference]: Finished difference Result 487 states and 652 transitions. [2021-11-09 09:52:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 09:52:03,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2021-11-09 09:52:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:03,582 INFO L225 Difference]: With dead ends: 487 [2021-11-09 09:52:03,583 INFO L226 Difference]: Without dead ends: 472 [2021-11-09 09:52:03,583 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-11-09 09:52:03,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2021-11-09 09:52:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 459. [2021-11-09 09:52:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 343 states have (on average 1.2769679300291545) internal successors, (438), 356 states have internal predecessors, (438), 70 states have call successors, (70), 38 states have call predecessors, (70), 45 states have return successors, (96), 69 states have call predecessors, (96), 62 states have call successors, (96) [2021-11-09 09:52:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2021-11-09 09:52:03,605 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 47 [2021-11-09 09:52:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:03,606 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2021-11-09 09:52:03,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2021-11-09 09:52:03,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-09 09:52:03,608 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:03,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:52:03,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 09:52:03,609 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:03,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:03,609 INFO L85 PathProgramCache]: Analyzing trace with hash 463036434, now seen corresponding path program 1 times [2021-11-09 09:52:03,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:03,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498091259] [2021-11-09 09:52:03,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:03,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:03,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:03,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:03,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:03,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-09 09:52:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:03,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 09:52:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:03,909 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-09 09:52:03,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:03,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498091259] [2021-11-09 09:52:03,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498091259] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:03,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:03,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-11-09 09:52:03,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525125180] [2021-11-09 09:52:03,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-09 09:52:03,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:03,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-09 09:52:03,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-11-09 09:52:03,913 INFO L87 Difference]: Start difference. First operand 459 states and 604 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-09 09:52:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:06,388 INFO L93 Difference]: Finished difference Result 590 states and 807 transitions. [2021-11-09 09:52:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-09 09:52:06,389 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2021-11-09 09:52:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:06,394 INFO L225 Difference]: With dead ends: 590 [2021-11-09 09:52:06,394 INFO L226 Difference]: Without dead ends: 575 [2021-11-09 09:52:06,395 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2021-11-09 09:52:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-11-09 09:52:06,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 444. [2021-11-09 09:52:06,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 332 states have (on average 1.2771084337349397) internal successors, (424), 343 states have internal predecessors, (424), 68 states have call successors, (68), 38 states have call predecessors, (68), 43 states have return successors, (91), 66 states have call predecessors, (91), 60 states have call successors, (91) [2021-11-09 09:52:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 583 transitions. [2021-11-09 09:52:06,417 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 583 transitions. Word has length 48 [2021-11-09 09:52:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:06,418 INFO L470 AbstractCegarLoop]: Abstraction has 444 states and 583 transitions. [2021-11-09 09:52:06,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-09 09:52:06,418 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 583 transitions. [2021-11-09 09:52:06,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-09 09:52:06,419 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:06,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:52:06,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-09 09:52:06,420 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash -97212758, now seen corresponding path program 1 times [2021-11-09 09:52:06,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:06,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752438789] [2021-11-09 09:52:06,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:06,422 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:06,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-11-09 09:52:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:06,727 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-09 09:52:06,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:06,728 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752438789] [2021-11-09 09:52:06,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752438789] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:06,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:06,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 09:52:06,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424171245] [2021-11-09 09:52:06,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 09:52:06,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:06,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 09:52:06,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:52:06,733 INFO L87 Difference]: Start difference. First operand 444 states and 583 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:07,890 INFO L93 Difference]: Finished difference Result 455 states and 596 transitions. [2021-11-09 09:52:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-09 09:52:07,891 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2021-11-09 09:52:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:07,894 INFO L225 Difference]: With dead ends: 455 [2021-11-09 09:52:07,894 INFO L226 Difference]: Without dead ends: 427 [2021-11-09 09:52:07,895 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-09 09:52:07,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-11-09 09:52:07,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2021-11-09 09:52:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 318 states have (on average 1.279874213836478) internal successors, (407), 330 states have internal predecessors, (407), 66 states have call successors, (66), 36 states have call predecessors, (66), 42 states have return successors, (89), 64 states have call predecessors, (89), 58 states have call successors, (89) [2021-11-09 09:52:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 562 transitions. [2021-11-09 09:52:07,914 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 562 transitions. Word has length 49 [2021-11-09 09:52:07,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:07,914 INFO L470 AbstractCegarLoop]: Abstraction has 427 states and 562 transitions. [2021-11-09 09:52:07,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 562 transitions. [2021-11-09 09:52:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-09 09:52:07,916 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:07,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:52:07,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-09 09:52:07,917 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:07,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:07,917 INFO L85 PathProgramCache]: Analyzing trace with hash 193438818, now seen corresponding path program 1 times [2021-11-09 09:52:07,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:07,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599293518] [2021-11-09 09:52:07,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:07,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:08,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:08,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:08,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-11-09 09:52:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-11-09 09:52:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:08,197 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-09 09:52:08,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:08,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599293518] [2021-11-09 09:52:08,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599293518] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:08,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:08,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-09 09:52:08,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057970899] [2021-11-09 09:52:08,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-09 09:52:08,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:08,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-09 09:52:08,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-11-09 09:52:08,201 INFO L87 Difference]: Start difference. First operand 427 states and 562 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-09 09:52:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:09,327 INFO L93 Difference]: Finished difference Result 453 states and 597 transitions. [2021-11-09 09:52:09,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-09 09:52:09,328 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2021-11-09 09:52:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:09,333 INFO L225 Difference]: With dead ends: 453 [2021-11-09 09:52:09,333 INFO L226 Difference]: Without dead ends: 423 [2021-11-09 09:52:09,333 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-11-09 09:52:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2021-11-09 09:52:09,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 409. [2021-11-09 09:52:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 316 states have internal predecessors, (391), 64 states have call successors, (64), 34 states have call predecessors, (64), 40 states have return successors, (87), 62 states have call predecessors, (87), 56 states have call successors, (87) [2021-11-09 09:52:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 542 transitions. [2021-11-09 09:52:09,352 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 542 transitions. Word has length 50 [2021-11-09 09:52:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:09,352 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 542 transitions. [2021-11-09 09:52:09,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-09 09:52:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 542 transitions. [2021-11-09 09:52:09,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-11-09 09:52:09,359 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:09,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:52:09,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-09 09:52:09,360 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:09,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:09,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1006860761, now seen corresponding path program 1 times [2021-11-09 09:52:09,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:09,361 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077026145] [2021-11-09 09:52:09,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:09,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:09,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:09,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:09,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:09,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-09 09:52:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:09,663 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-09 09:52:09,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:09,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077026145] [2021-11-09 09:52:09,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077026145] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:09,665 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:09,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-09 09:52:09,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955552796] [2021-11-09 09:52:09,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-09 09:52:09,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:09,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-09 09:52:09,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-09 09:52:09,667 INFO L87 Difference]: Start difference. First operand 409 states and 542 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-09 09:52:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:12,188 INFO L93 Difference]: Finished difference Result 600 states and 867 transitions. [2021-11-09 09:52:12,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-09 09:52:12,189 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2021-11-09 09:52:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:12,194 INFO L225 Difference]: With dead ends: 600 [2021-11-09 09:52:12,195 INFO L226 Difference]: Without dead ends: 600 [2021-11-09 09:52:12,195 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2021-11-09 09:52:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2021-11-09 09:52:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2021-11-09 09:52:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 399 states have (on average 1.3433583959899749) internal successors, (536), 410 states have internal predecessors, (536), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2021-11-09 09:52:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 769 transitions. [2021-11-09 09:52:12,221 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 769 transitions. Word has length 50 [2021-11-09 09:52:12,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:12,222 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 769 transitions. [2021-11-09 09:52:12,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-09 09:52:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 769 transitions. [2021-11-09 09:52:12,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-09 09:52:12,223 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:12,224 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, 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-09 09:52:12,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-09 09:52:12,224 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:12,225 INFO L85 PathProgramCache]: Analyzing trace with hash 645881872, now seen corresponding path program 1 times [2021-11-09 09:52:12,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:12,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111334192] [2021-11-09 09:52:12,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:12,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:12,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:12,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:12,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:12,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-09 09:52:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:12,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:12,442 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-09 09:52:12,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:12,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111334192] [2021-11-09 09:52:12,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111334192] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:12,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:12,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-09 09:52:12,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217346098] [2021-11-09 09:52:12,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-09 09:52:12,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:12,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-09 09:52:12,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:52:12,448 INFO L87 Difference]: Start difference. First operand 534 states and 769 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:13,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:13,417 INFO L93 Difference]: Finished difference Result 740 states and 1128 transitions. [2021-11-09 09:52:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-09 09:52:13,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2021-11-09 09:52:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:13,426 INFO L225 Difference]: With dead ends: 740 [2021-11-09 09:52:13,426 INFO L226 Difference]: Without dead ends: 740 [2021-11-09 09:52:13,427 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:52:13,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-11-09 09:52:13,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 561. [2021-11-09 09:52:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 419 states have (on average 1.3293556085918854) internal successors, (557), 431 states have internal predecessors, (557), 93 states have call successors, (93), 38 states have call predecessors, (93), 48 states have return successors, (147), 94 states have call predecessors, (147), 85 states have call successors, (147) [2021-11-09 09:52:13,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 797 transitions. [2021-11-09 09:52:13,459 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 797 transitions. Word has length 51 [2021-11-09 09:52:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:13,460 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 797 transitions. [2021-11-09 09:52:13,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 797 transitions. [2021-11-09 09:52:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-09 09:52:13,461 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:13,462 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, 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-09 09:52:13,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-09 09:52:13,462 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:13,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:13,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1801633520, now seen corresponding path program 1 times [2021-11-09 09:52:13,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:13,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456038643] [2021-11-09 09:52:13,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:13,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:13,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:13,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:13,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-09 09:52:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:13,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:13,709 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-09 09:52:13,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:13,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456038643] [2021-11-09 09:52:13,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456038643] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:13,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:13,711 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 09:52:13,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074075202] [2021-11-09 09:52:13,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 09:52:13,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:13,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 09:52:13,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:52:13,713 INFO L87 Difference]: Start difference. First operand 561 states and 797 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:14,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:14,338 INFO L93 Difference]: Finished difference Result 579 states and 821 transitions. [2021-11-09 09:52:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-09 09:52:14,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2021-11-09 09:52:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:14,346 INFO L225 Difference]: With dead ends: 579 [2021-11-09 09:52:14,346 INFO L226 Difference]: Without dead ends: 579 [2021-11-09 09:52:14,347 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-11-09 09:52:14,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-11-09 09:52:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 564. [2021-11-09 09:52:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 422 states have (on average 1.3293838862559242) internal successors, (561), 434 states have internal predecessors, (561), 93 states have call successors, (93), 38 states have call predecessors, (93), 48 states have return successors, (147), 94 states have call predecessors, (147), 85 states have call successors, (147) [2021-11-09 09:52:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 801 transitions. [2021-11-09 09:52:14,372 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 801 transitions. Word has length 51 [2021-11-09 09:52:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:14,373 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 801 transitions. [2021-11-09 09:52:14,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 801 transitions. [2021-11-09 09:52:14,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-09 09:52:14,374 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:14,375 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, 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-09 09:52:14,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-09 09:52:14,375 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:14,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:14,376 INFO L85 PathProgramCache]: Analyzing trace with hash 499189070, now seen corresponding path program 1 times [2021-11-09 09:52:14,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:14,376 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92484095] [2021-11-09 09:52:14,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:14,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:14,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:14,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:14,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:14,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-09 09:52:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:14,669 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-09 09:52:14,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:14,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92484095] [2021-11-09 09:52:14,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92484095] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:14,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:14,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-11-09 09:52:14,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928122038] [2021-11-09 09:52:14,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-09 09:52:14,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:14,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-09 09:52:14,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-11-09 09:52:14,674 INFO L87 Difference]: Start difference. First operand 564 states and 801 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-09 09:52:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:16,171 INFO L93 Difference]: Finished difference Result 619 states and 929 transitions. [2021-11-09 09:52:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-09 09:52:16,172 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2021-11-09 09:52:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:16,176 INFO L225 Difference]: With dead ends: 619 [2021-11-09 09:52:16,177 INFO L226 Difference]: Without dead ends: 619 [2021-11-09 09:52:16,177 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2021-11-09 09:52:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2021-11-09 09:52:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 524. [2021-11-09 09:52:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 390 states have (on average 1.3307692307692307) internal successors, (519), 400 states have internal predecessors, (519), 91 states have call successors, (91), 37 states have call predecessors, (91), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2021-11-09 09:52:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 751 transitions. [2021-11-09 09:52:16,203 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 751 transitions. Word has length 51 [2021-11-09 09:52:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:16,204 INFO L470 AbstractCegarLoop]: Abstraction has 524 states and 751 transitions. [2021-11-09 09:52:16,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 7 states have internal predecessors, (39), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-11-09 09:52:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 751 transitions. [2021-11-09 09:52:16,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-09 09:52:16,205 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:16,206 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, 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-09 09:52:16,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-09 09:52:16,206 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:16,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash -999496148, now seen corresponding path program 1 times [2021-11-09 09:52:16,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:16,207 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692457354] [2021-11-09 09:52:16,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:16,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:16,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:16,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:16,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-09 09:52:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:16,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:16,480 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-09 09:52:16,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:16,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692457354] [2021-11-09 09:52:16,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692457354] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:16,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:16,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 09:52:16,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50713203] [2021-11-09 09:52:16,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 09:52:16,483 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:16,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 09:52:16,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:52:16,484 INFO L87 Difference]: Start difference. First operand 524 states and 751 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:17,520 INFO L93 Difference]: Finished difference Result 544 states and 778 transitions. [2021-11-09 09:52:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 09:52:17,521 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-11-09 09:52:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:17,526 INFO L225 Difference]: With dead ends: 544 [2021-11-09 09:52:17,526 INFO L226 Difference]: Without dead ends: 543 [2021-11-09 09:52:17,527 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-11-09 09:52:17,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2021-11-09 09:52:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 531. [2021-11-09 09:52:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 396 states have (on average 1.3282828282828283) internal successors, (526), 407 states have internal predecessors, (526), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2021-11-09 09:52:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 760 transitions. [2021-11-09 09:52:17,550 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 760 transitions. Word has length 52 [2021-11-09 09:52:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:17,551 INFO L470 AbstractCegarLoop]: Abstraction has 531 states and 760 transitions. [2021-11-09 09:52:17,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 760 transitions. [2021-11-09 09:52:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-09 09:52:17,552 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:17,553 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, 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-09 09:52:17,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-09 09:52:17,553 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:17,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:17,554 INFO L85 PathProgramCache]: Analyzing trace with hash -999772978, now seen corresponding path program 1 times [2021-11-09 09:52:17,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:17,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467818057] [2021-11-09 09:52:17,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:17,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:17,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:17,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:17,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-09 09:52:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:17,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:52:17,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:17,892 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467818057] [2021-11-09 09:52:17,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467818057] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:17,892 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:17,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 09:52:17,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457200242] [2021-11-09 09:52:17,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 09:52:17,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:17,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 09:52:17,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:52:17,895 INFO L87 Difference]: Start difference. First operand 531 states and 760 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:18,732 INFO L93 Difference]: Finished difference Result 559 states and 794 transitions. [2021-11-09 09:52:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-09 09:52:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-11-09 09:52:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:18,737 INFO L225 Difference]: With dead ends: 559 [2021-11-09 09:52:18,737 INFO L226 Difference]: Without dead ends: 538 [2021-11-09 09:52:18,738 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-11-09 09:52:18,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-11-09 09:52:18,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 530. [2021-11-09 09:52:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 395 states have (on average 1.3265822784810126) internal successors, (524), 406 states have internal predecessors, (524), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2021-11-09 09:52:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 758 transitions. [2021-11-09 09:52:18,760 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 758 transitions. Word has length 52 [2021-11-09 09:52:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:18,761 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 758 transitions. [2021-11-09 09:52:18,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-11-09 09:52:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 758 transitions. [2021-11-09 09:52:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-09 09:52:18,763 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:18,763 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, 1, 1, 1, 1, 1, 1, 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-09 09:52:18,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-09 09:52:18,764 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash -639415020, now seen corresponding path program 1 times [2021-11-09 09:52:18,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:18,765 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556155033] [2021-11-09 09:52:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:18,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:18,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:18,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:18,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:18,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-11-09 09:52:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:18,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:18,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-09 09:52:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:18,993 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-09 09:52:18,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:18,994 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556155033] [2021-11-09 09:52:18,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556155033] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:18,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:18,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-09 09:52:18,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916327033] [2021-11-09 09:52:18,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-09 09:52:18,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-09 09:52:18,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-09 09:52:18,997 INFO L87 Difference]: Start difference. First operand 530 states and 758 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-09 09:52:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:19,695 INFO L93 Difference]: Finished difference Result 549 states and 800 transitions. [2021-11-09 09:52:19,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 09:52:19,695 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2021-11-09 09:52:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:19,700 INFO L225 Difference]: With dead ends: 549 [2021-11-09 09:52:19,701 INFO L226 Difference]: Without dead ends: 549 [2021-11-09 09:52:19,701 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:52:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2021-11-09 09:52:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 529. [2021-11-09 09:52:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 394 states have (on average 1.3197969543147208) internal successors, (520), 405 states have internal predecessors, (520), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2021-11-09 09:52:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 754 transitions. [2021-11-09 09:52:19,724 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 754 transitions. Word has length 58 [2021-11-09 09:52:19,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:19,724 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 754 transitions. [2021-11-09 09:52:19,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-09 09:52:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 754 transitions. [2021-11-09 09:52:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-09 09:52:19,726 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:19,726 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, 1, 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-09 09:52:19,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-11-09 09:52:19,727 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:19,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1490997952, now seen corresponding path program 1 times [2021-11-09 09:52:19,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:19,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229485592] [2021-11-09 09:52:19,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:19,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:19,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:19,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:19,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:19,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-11-09 09:52:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:19,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:19,985 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-09 09:52:19,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:19,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229485592] [2021-11-09 09:52:19,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229485592] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:19,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:19,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 09:52:19,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561301006] [2021-11-09 09:52:19,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 09:52:19,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:19,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 09:52:19,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:52:19,988 INFO L87 Difference]: Start difference. First operand 529 states and 754 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-09 09:52:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:21,662 INFO L93 Difference]: Finished difference Result 671 states and 995 transitions. [2021-11-09 09:52:21,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 09:52:21,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 53 [2021-11-09 09:52:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:21,668 INFO L225 Difference]: With dead ends: 671 [2021-11-09 09:52:21,668 INFO L226 Difference]: Without dead ends: 639 [2021-11-09 09:52:21,669 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2021-11-09 09:52:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2021-11-09 09:52:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 560. [2021-11-09 09:52:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 415 states have (on average 1.344578313253012) internal successors, (558), 426 states have internal predecessors, (558), 101 states have call successors, (101), 37 states have call predecessors, (101), 43 states have return successors, (165), 98 states have call predecessors, (165), 94 states have call successors, (165) [2021-11-09 09:52:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 824 transitions. [2021-11-09 09:52:21,695 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 824 transitions. Word has length 53 [2021-11-09 09:52:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:21,696 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 824 transitions. [2021-11-09 09:52:21,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-11-09 09:52:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 824 transitions. [2021-11-09 09:52:21,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-11-09 09:52:21,698 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:21,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:21,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-11-09 09:52:21,699 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:21,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:21,699 INFO L85 PathProgramCache]: Analyzing trace with hash -538464897, now seen corresponding path program 1 times [2021-11-09 09:52:21,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:21,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15415779] [2021-11-09 09:52:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:21,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:21,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:21,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:21,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:21,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-09 09:52:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:22,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:22,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:22,118 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-09 09:52:22,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:22,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15415779] [2021-11-09 09:52:22,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15415779] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:22,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:22,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-09 09:52:22,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695378847] [2021-11-09 09:52:22,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-09 09:52:22,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:22,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-09 09:52:22,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-11-09 09:52:22,123 INFO L87 Difference]: Start difference. First operand 560 states and 824 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-09 09:52:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:22,856 INFO L93 Difference]: Finished difference Result 390 states and 522 transitions. [2021-11-09 09:52:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-09 09:52:22,857 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-11-09 09:52:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:22,862 INFO L225 Difference]: With dead ends: 390 [2021-11-09 09:52:22,862 INFO L226 Difference]: Without dead ends: 390 [2021-11-09 09:52:22,862 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-11-09 09:52:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-11-09 09:52:22,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 338. [2021-11-09 09:52:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.2560975609756098) internal successors, (309), 254 states have internal predecessors, (309), 59 states have call successors, (59), 31 states have call predecessors, (59), 32 states have return successors, (74), 54 states have call predecessors, (74), 53 states have call successors, (74) [2021-11-09 09:52:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2021-11-09 09:52:22,878 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 63 [2021-11-09 09:52:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:22,879 INFO L470 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2021-11-09 09:52:22,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-09 09:52:22,880 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2021-11-09 09:52:22,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-11-09 09:52:22,881 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:22,881 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, 1, 1, 1, 1, 1, 1, 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-09 09:52:22,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-11-09 09:52:22,882 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:22,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1094959805, now seen corresponding path program 1 times [2021-11-09 09:52:22,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:22,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500549431] [2021-11-09 09:52:22,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:22,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:23,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:23,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:23,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-09 09:52:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:23,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:23,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:23,220 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-09 09:52:23,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:23,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500549431] [2021-11-09 09:52:23,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500549431] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:23,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:23,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-09 09:52:23,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87744240] [2021-11-09 09:52:23,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-09 09:52:23,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:23,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-09 09:52:23,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-11-09 09:52:23,224 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-09 09:52:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:24,321 INFO L93 Difference]: Finished difference Result 343 states and 451 transitions. [2021-11-09 09:52:24,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 09:52:24,322 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2021-11-09 09:52:24,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:24,325 INFO L225 Difference]: With dead ends: 343 [2021-11-09 09:52:24,325 INFO L226 Difference]: Without dead ends: 304 [2021-11-09 09:52:24,327 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-11-09 09:52:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-11-09 09:52:24,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2021-11-09 09:52:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.2757009345794392) internal successors, (273), 220 states have internal predecessors, (273), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2021-11-09 09:52:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2021-11-09 09:52:24,340 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 58 [2021-11-09 09:52:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:24,341 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2021-11-09 09:52:24,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-11-09 09:52:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2021-11-09 09:52:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-09 09:52:24,343 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:24,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:24,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-09 09:52:24,344 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:24,345 INFO L85 PathProgramCache]: Analyzing trace with hash -703797032, now seen corresponding path program 1 times [2021-11-09 09:52:24,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:24,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181438289] [2021-11-09 09:52:24,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:24,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:24,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:24,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:24,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:24,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-09 09:52:24,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:24,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:24,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:24,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:24,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:52:24,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:24,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181438289] [2021-11-09 09:52:24,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181438289] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:24,704 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:24,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 09:52:24,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237746777] [2021-11-09 09:52:24,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 09:52:24,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:24,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 09:52:24,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:52:24,708 INFO L87 Difference]: Start difference. First operand 298 states and 398 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-09 09:52:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:25,583 INFO L93 Difference]: Finished difference Result 316 states and 429 transitions. [2021-11-09 09:52:25,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-09 09:52:25,584 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2021-11-09 09:52:25,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:25,587 INFO L225 Difference]: With dead ends: 316 [2021-11-09 09:52:25,587 INFO L226 Difference]: Without dead ends: 316 [2021-11-09 09:52:25,588 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-11-09 09:52:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-11-09 09:52:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 298. [2021-11-09 09:52:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.266355140186916) internal successors, (271), 220 states have internal predecessors, (271), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2021-11-09 09:52:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 396 transitions. [2021-11-09 09:52:25,602 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 396 transitions. Word has length 67 [2021-11-09 09:52:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:25,602 INFO L470 AbstractCegarLoop]: Abstraction has 298 states and 396 transitions. [2021-11-09 09:52:25,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-09 09:52:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 396 transitions. [2021-11-09 09:52:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-09 09:52:25,604 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:25,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:25,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-11-09 09:52:25,605 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:25,606 INFO L85 PathProgramCache]: Analyzing trace with hash -194321691, now seen corresponding path program 1 times [2021-11-09 09:52:25,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:25,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508475782] [2021-11-09 09:52:25,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:25,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:25,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:25,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:25,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:25,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-09 09:52:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:25,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:25,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:25,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:25,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:52:25,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:25,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508475782] [2021-11-09 09:52:25,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508475782] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:25,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:25,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 09:52:25,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401554919] [2021-11-09 09:52:25,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 09:52:25,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:25,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 09:52:25,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:52:25,932 INFO L87 Difference]: Start difference. First operand 298 states and 396 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-09 09:52:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:26,377 INFO L93 Difference]: Finished difference Result 330 states and 453 transitions. [2021-11-09 09:52:26,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 09:52:26,378 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2021-11-09 09:52:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:26,381 INFO L225 Difference]: With dead ends: 330 [2021-11-09 09:52:26,381 INFO L226 Difference]: Without dead ends: 330 [2021-11-09 09:52:26,382 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-11-09 09:52:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-11-09 09:52:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 303. [2021-11-09 09:52:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 218 states have (on average 1.261467889908257) internal successors, (275), 224 states have internal predecessors, (275), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2021-11-09 09:52:26,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 409 transitions. [2021-11-09 09:52:26,395 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 409 transitions. Word has length 68 [2021-11-09 09:52:26,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:26,396 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 409 transitions. [2021-11-09 09:52:26,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-09 09:52:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 409 transitions. [2021-11-09 09:52:26,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-09 09:52:26,398 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:26,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:26,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-11-09 09:52:26,398 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:26,399 INFO L85 PathProgramCache]: Analyzing trace with hash -198191505, now seen corresponding path program 1 times [2021-11-09 09:52:26,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:26,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181126741] [2021-11-09 09:52:26,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:26,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:26,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:26,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:26,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:26,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-11-09 09:52:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:26,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:26,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:26,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:26,637 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-09 09:52:26,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:26,638 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181126741] [2021-11-09 09:52:26,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181126741] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:26,638 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:26,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 09:52:26,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104410307] [2021-11-09 09:52:26,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 09:52:26,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:26,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 09:52:26,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:52:26,641 INFO L87 Difference]: Start difference. First operand 303 states and 409 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-09 09:52:27,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:27,262 INFO L93 Difference]: Finished difference Result 474 states and 674 transitions. [2021-11-09 09:52:27,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 09:52:27,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2021-11-09 09:52:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:27,268 INFO L225 Difference]: With dead ends: 474 [2021-11-09 09:52:27,268 INFO L226 Difference]: Without dead ends: 474 [2021-11-09 09:52:27,268 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:52:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-11-09 09:52:27,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 307. [2021-11-09 09:52:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 222 states have (on average 1.2657657657657657) internal successors, (281), 228 states have internal predecessors, (281), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2021-11-09 09:52:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 415 transitions. [2021-11-09 09:52:27,286 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 415 transitions. Word has length 69 [2021-11-09 09:52:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:27,286 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 415 transitions. [2021-11-09 09:52:27,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2021-11-09 09:52:27,287 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 415 transitions. [2021-11-09 09:52:27,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-11-09 09:52:27,288 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:27,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:27,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-11-09 09:52:27,289 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:27,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:27,290 INFO L85 PathProgramCache]: Analyzing trace with hash 392199007, now seen corresponding path program 1 times [2021-11-09 09:52:27,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:27,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998884525] [2021-11-09 09:52:27,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:27,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:27,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:27,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:27,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:27,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-11-09 09:52:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:27,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:27,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:27,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:52:27,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:27,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998884525] [2021-11-09 09:52:27,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998884525] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:27,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:27,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-11-09 09:52:27,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575237340] [2021-11-09 09:52:27,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-09 09:52:27,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:27,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-09 09:52:27,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-11-09 09:52:27,546 INFO L87 Difference]: Start difference. First operand 307 states and 415 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-09 09:52:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:28,563 INFO L93 Difference]: Finished difference Result 529 states and 764 transitions. [2021-11-09 09:52:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 09:52:28,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2021-11-09 09:52:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:28,568 INFO L225 Difference]: With dead ends: 529 [2021-11-09 09:52:28,569 INFO L226 Difference]: Without dead ends: 529 [2021-11-09 09:52:28,569 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2021-11-09 09:52:28,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-11-09 09:52:28,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 490. [2021-11-09 09:52:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 366 states have internal predecessors, (461), 89 states have call successors, (89), 35 states have call predecessors, (89), 43 states have return successors, (153), 89 states have call predecessors, (153), 85 states have call successors, (153) [2021-11-09 09:52:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 703 transitions. [2021-11-09 09:52:28,592 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 703 transitions. Word has length 71 [2021-11-09 09:52:28,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:28,593 INFO L470 AbstractCegarLoop]: Abstraction has 490 states and 703 transitions. [2021-11-09 09:52:28,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-11-09 09:52:28,593 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 703 transitions. [2021-11-09 09:52:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-11-09 09:52:28,595 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:28,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:28,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-11-09 09:52:28,595 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:28,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:28,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1252090646, now seen corresponding path program 1 times [2021-11-09 09:52:28,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:28,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379617154] [2021-11-09 09:52:28,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:28,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:28,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:28,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:28,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:28,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-09 09:52:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:28,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:28,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:28,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:28,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:28,959 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-09 09:52:28,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:28,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379617154] [2021-11-09 09:52:28,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379617154] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:28,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:28,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-11-09 09:52:28,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811889727] [2021-11-09 09:52:28,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-09 09:52:28,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:28,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-09 09:52:28,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-11-09 09:52:28,963 INFO L87 Difference]: Start difference. First operand 490 states and 703 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-09 09:52:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:29,504 INFO L93 Difference]: Finished difference Result 493 states and 705 transitions. [2021-11-09 09:52:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 09:52:29,507 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2021-11-09 09:52:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:29,511 INFO L225 Difference]: With dead ends: 493 [2021-11-09 09:52:29,512 INFO L226 Difference]: Without dead ends: 493 [2021-11-09 09:52:29,512 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-11-09 09:52:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2021-11-09 09:52:29,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 484. [2021-11-09 09:52:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 353 states have (on average 1.2832861189801699) internal successors, (453), 361 states have internal predecessors, (453), 88 states have call successors, (88), 35 states have call predecessors, (88), 42 states have return successors, (146), 88 states have call predecessors, (146), 84 states have call successors, (146) [2021-11-09 09:52:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 687 transitions. [2021-11-09 09:52:29,532 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 687 transitions. Word has length 72 [2021-11-09 09:52:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:29,532 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 687 transitions. [2021-11-09 09:52:29,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-11-09 09:52:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 687 transitions. [2021-11-09 09:52:29,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-09 09:52:29,535 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:29,535 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:29,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-11-09 09:52:29,535 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:29,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:29,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1761504416, now seen corresponding path program 1 times [2021-11-09 09:52:29,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:29,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114171225] [2021-11-09 09:52:29,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:29,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:29,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:29,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:29,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-11-09 09:52:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:29,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:29,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:29,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:29,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:29,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-09 09:52:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:29,900 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-09 09:52:29,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:29,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114171225] [2021-11-09 09:52:29,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114171225] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:29,901 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:29,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 09:52:29,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94660492] [2021-11-09 09:52:29,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 09:52:29,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:29,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 09:52:29,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:52:29,904 INFO L87 Difference]: Start difference. First operand 484 states and 687 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-09 09:52:31,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:31,063 INFO L93 Difference]: Finished difference Result 450 states and 629 transitions. [2021-11-09 09:52:31,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-09 09:52:31,064 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2021-11-09 09:52:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:31,068 INFO L225 Difference]: With dead ends: 450 [2021-11-09 09:52:31,069 INFO L226 Difference]: Without dead ends: 450 [2021-11-09 09:52:31,069 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2021-11-09 09:52:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-11-09 09:52:31,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 436. [2021-11-09 09:52:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 320 states have (on average 1.296875) internal successors, (415), 329 states have internal predecessors, (415), 79 states have call successors, (79), 33 states have call predecessors, (79), 36 states have return successors, (110), 74 states have call predecessors, (110), 75 states have call successors, (110) [2021-11-09 09:52:31,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 604 transitions. [2021-11-09 09:52:31,092 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 604 transitions. Word has length 83 [2021-11-09 09:52:31,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:31,093 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 604 transitions. [2021-11-09 09:52:31,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-11-09 09:52:31,094 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 604 transitions. [2021-11-09 09:52:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-11-09 09:52:31,095 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:31,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:31,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-11-09 09:52:31,096 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:31,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:31,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1176411851, now seen corresponding path program 1 times [2021-11-09 09:52:31,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:31,097 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460717675] [2021-11-09 09:52:31,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:31,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:31,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:31,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:31,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:31,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-09 09:52:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:31,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:31,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:31,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:31,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-09 09:52:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:52:31,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:31,773 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460717675] [2021-11-09 09:52:31,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460717675] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:31,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:31,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-11-09 09:52:31,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785813732] [2021-11-09 09:52:31,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-09 09:52:31,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:31,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-09 09:52:31,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-11-09 09:52:31,776 INFO L87 Difference]: Start difference. First operand 436 states and 604 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-09 09:52:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:32,698 INFO L93 Difference]: Finished difference Result 483 states and 678 transitions. [2021-11-09 09:52:32,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-09 09:52:32,699 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2021-11-09 09:52:32,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:32,704 INFO L225 Difference]: With dead ends: 483 [2021-11-09 09:52:32,704 INFO L226 Difference]: Without dead ends: 461 [2021-11-09 09:52:32,707 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2021-11-09 09:52:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2021-11-09 09:52:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2021-11-09 09:52:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 329 states have (on average 1.2887537993920972) internal successors, (424), 339 states have internal predecessors, (424), 79 states have call successors, (79), 33 states have call predecessors, (79), 38 states have return successors, (116), 75 states have call predecessors, (116), 75 states have call successors, (116) [2021-11-09 09:52:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 619 transitions. [2021-11-09 09:52:32,756 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 619 transitions. Word has length 92 [2021-11-09 09:52:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:32,757 INFO L470 AbstractCegarLoop]: Abstraction has 447 states and 619 transitions. [2021-11-09 09:52:32,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-09 09:52:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 619 transitions. [2021-11-09 09:52:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-11-09 09:52:32,768 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:32,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:32,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-11-09 09:52:32,768 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:32,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash 702793907, now seen corresponding path program 1 times [2021-11-09 09:52:32,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:32,769 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277134009] [2021-11-09 09:52:32,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:32,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:32,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:32,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:32,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:32,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-09 09:52:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:33,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:33,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:33,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:33,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:33,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-09 09:52:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:33,421 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-09 09:52:33,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:33,422 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277134009] [2021-11-09 09:52:33,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277134009] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:33,423 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:33,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-11-09 09:52:33,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205145211] [2021-11-09 09:52:33,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-09 09:52:33,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:33,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-09 09:52:33,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2021-11-09 09:52:33,430 INFO L87 Difference]: Start difference. First operand 447 states and 619 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-09 09:52:34,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:34,563 INFO L93 Difference]: Finished difference Result 481 states and 674 transitions. [2021-11-09 09:52:34,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-11-09 09:52:34,564 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2021-11-09 09:52:34,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:34,567 INFO L225 Difference]: With dead ends: 481 [2021-11-09 09:52:34,568 INFO L226 Difference]: Without dead ends: 459 [2021-11-09 09:52:34,568 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2021-11-09 09:52:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-11-09 09:52:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 434. [2021-11-09 09:52:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 319 states have (on average 1.297805642633229) internal successors, (414), 328 states have internal predecessors, (414), 78 states have call successors, (78), 33 states have call predecessors, (78), 36 states have return successors, (108), 73 states have call predecessors, (108), 74 states have call successors, (108) [2021-11-09 09:52:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 600 transitions. [2021-11-09 09:52:34,585 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 600 transitions. Word has length 93 [2021-11-09 09:52:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:34,586 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 600 transitions. [2021-11-09 09:52:34,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2021-11-09 09:52:34,587 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 600 transitions. [2021-11-09 09:52:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-09 09:52:34,589 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:34,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:34,589 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-11-09 09:52:34,589 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:34,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:34,590 INFO L85 PathProgramCache]: Analyzing trace with hash 940384513, now seen corresponding path program 1 times [2021-11-09 09:52:34,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:34,591 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988243845] [2021-11-09 09:52:34,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:34,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:34,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:34,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:34,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:34,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-09 09:52:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:34,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:35,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:35,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:35,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:35,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:35,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:35,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-09 09:52:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:35,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-09 09:52:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:35,245 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-09 09:52:35,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:35,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988243845] [2021-11-09 09:52:35,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988243845] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:35,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:35,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-11-09 09:52:35,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073358319] [2021-11-09 09:52:35,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-09 09:52:35,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:35,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-09 09:52:35,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-11-09 09:52:35,249 INFO L87 Difference]: Start difference. First operand 434 states and 600 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-09 09:52:37,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:37,961 INFO L93 Difference]: Finished difference Result 860 states and 1205 transitions. [2021-11-09 09:52:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-11-09 09:52:37,962 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2021-11-09 09:52:37,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:37,969 INFO L225 Difference]: With dead ends: 860 [2021-11-09 09:52:37,969 INFO L226 Difference]: Without dead ends: 827 [2021-11-09 09:52:37,971 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=289, Invalid=2261, Unknown=0, NotChecked=0, Total=2550 [2021-11-09 09:52:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-11-09 09:52:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 805. [2021-11-09 09:52:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 596 states have (on average 1.3120805369127517) internal successors, (782), 614 states have internal predecessors, (782), 143 states have call successors, (143), 57 states have call predecessors, (143), 65 states have return successors, (208), 134 states have call predecessors, (208), 139 states have call successors, (208) [2021-11-09 09:52:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1133 transitions. [2021-11-09 09:52:38,032 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1133 transitions. Word has length 103 [2021-11-09 09:52:38,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:38,033 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1133 transitions. [2021-11-09 09:52:38,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-09 09:52:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1133 transitions. [2021-11-09 09:52:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-09 09:52:38,036 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:38,036 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:38,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-11-09 09:52:38,037 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:38,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:38,038 INFO L85 PathProgramCache]: Analyzing trace with hash 911884223, now seen corresponding path program 1 times [2021-11-09 09:52:38,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:38,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533135370] [2021-11-09 09:52:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:38,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-09 09:52:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-09 09:52:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-09 09:52:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:38,667 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-09 09:52:38,667 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:38,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533135370] [2021-11-09 09:52:38,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533135370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:38,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:38,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-11-09 09:52:38,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243019597] [2021-11-09 09:52:38,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-09 09:52:38,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:38,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-09 09:52:38,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2021-11-09 09:52:38,671 INFO L87 Difference]: Start difference. First operand 805 states and 1133 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-09 09:52:42,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:42,256 INFO L93 Difference]: Finished difference Result 847 states and 1189 transitions. [2021-11-09 09:52:42,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-09 09:52:42,256 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2021-11-09 09:52:42,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:42,262 INFO L225 Difference]: With dead ends: 847 [2021-11-09 09:52:42,262 INFO L226 Difference]: Without dead ends: 814 [2021-11-09 09:52:42,263 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=257, Invalid=1723, Unknown=0, NotChecked=0, Total=1980 [2021-11-09 09:52:42,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-11-09 09:52:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 424. [2021-11-09 09:52:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 313 states have (on average 1.3003194888178913) internal successors, (407), 322 states have internal predecessors, (407), 75 states have call successors, (75), 32 states have call predecessors, (75), 35 states have return successors, (105), 70 states have call predecessors, (105), 71 states have call successors, (105) [2021-11-09 09:52:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 587 transitions. [2021-11-09 09:52:42,285 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 587 transitions. Word has length 103 [2021-11-09 09:52:42,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:42,286 INFO L470 AbstractCegarLoop]: Abstraction has 424 states and 587 transitions. [2021-11-09 09:52:42,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2021-11-09 09:52:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 587 transitions. [2021-11-09 09:52:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-11-09 09:52:42,288 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:42,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:42,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-11-09 09:52:42,289 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:42,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:42,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1426002147, now seen corresponding path program 1 times [2021-11-09 09:52:42,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:42,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081315398] [2021-11-09 09:52:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:42,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:42,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:42,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:42,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:42,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-09 09:52:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 09:52:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:42,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:42,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:42,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:42,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:42,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:42,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-11-09 09:52:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:42,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-11-09 09:52:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:43,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:43,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-11-09 09:52:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:43,010 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-09 09:52:43,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:43,011 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081315398] [2021-11-09 09:52:43,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081315398] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:43,011 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:43,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-11-09 09:52:43,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974964490] [2021-11-09 09:52:43,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-09 09:52:43,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:43,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-09 09:52:43,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-11-09 09:52:43,014 INFO L87 Difference]: Start difference. First operand 424 states and 587 transitions. Second operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-09 09:52:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:44,088 INFO L93 Difference]: Finished difference Result 478 states and 676 transitions. [2021-11-09 09:52:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-09 09:52:44,089 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2021-11-09 09:52:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:44,092 INFO L225 Difference]: With dead ends: 478 [2021-11-09 09:52:44,092 INFO L226 Difference]: Without dead ends: 454 [2021-11-09 09:52:44,093 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2021-11-09 09:52:44,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2021-11-09 09:52:44,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2021-11-09 09:52:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 324 states have (on average 1.2901234567901234) internal successors, (418), 334 states have internal predecessors, (418), 78 states have call successors, (78), 32 states have call predecessors, (78), 37 states have return successors, (114), 74 states have call predecessors, (114), 73 states have call successors, (114) [2021-11-09 09:52:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 610 transitions. [2021-11-09 09:52:44,110 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 610 transitions. Word has length 108 [2021-11-09 09:52:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:44,110 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 610 transitions. [2021-11-09 09:52:44,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-09 09:52:44,111 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 610 transitions. [2021-11-09 09:52:44,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-09 09:52:44,113 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:44,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:44,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-11-09 09:52:44,114 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:44,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:44,114 INFO L85 PathProgramCache]: Analyzing trace with hash 986627049, now seen corresponding path program 1 times [2021-11-09 09:52:44,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:44,115 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744295496] [2021-11-09 09:52:44,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:44,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-09 09:52:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 09:52:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-09 09:52:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-11-09 09:52:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-11-09 09:52:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:44,830 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-09 09:52:44,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:44,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744295496] [2021-11-09 09:52:44,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744295496] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:44,831 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:44,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-11-09 09:52:44,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628108065] [2021-11-09 09:52:44,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-09 09:52:44,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:44,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-09 09:52:44,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-11-09 09:52:44,834 INFO L87 Difference]: Start difference. First operand 440 states and 610 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-09 09:52:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:46,242 INFO L93 Difference]: Finished difference Result 480 states and 674 transitions. [2021-11-09 09:52:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-11-09 09:52:46,242 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2021-11-09 09:52:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:46,247 INFO L225 Difference]: With dead ends: 480 [2021-11-09 09:52:46,247 INFO L226 Difference]: Without dead ends: 443 [2021-11-09 09:52:46,248 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2021-11-09 09:52:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2021-11-09 09:52:46,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 413. [2021-11-09 09:52:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 304 states have (on average 1.2664473684210527) internal successors, (385), 312 states have internal predecessors, (385), 75 states have call successors, (75), 32 states have call predecessors, (75), 33 states have return successors, (97), 69 states have call predecessors, (97), 70 states have call successors, (97) [2021-11-09 09:52:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2021-11-09 09:52:46,264 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 109 [2021-11-09 09:52:46,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:46,265 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2021-11-09 09:52:46,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-09 09:52:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2021-11-09 09:52:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-11-09 09:52:46,268 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:46,268 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:52:46,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-11-09 09:52:46,269 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:46,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash 358552163, now seen corresponding path program 1 times [2021-11-09 09:52:46,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:46,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691647500] [2021-11-09 09:52:46,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:46,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-09 09:52:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-09 09:52:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-09 09:52:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-09 09:52:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-09 09:52:46,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:46,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691647500] [2021-11-09 09:52:46,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691647500] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:46,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:46,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-09 09:52:46,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328075794] [2021-11-09 09:52:46,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-09 09:52:46,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:46,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-09 09:52:46,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-11-09 09:52:46,678 INFO L87 Difference]: Start difference. First operand 413 states and 557 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-09 09:52:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:47,638 INFO L93 Difference]: Finished difference Result 420 states and 559 transitions. [2021-11-09 09:52:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-09 09:52:47,638 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2021-11-09 09:52:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:47,642 INFO L225 Difference]: With dead ends: 420 [2021-11-09 09:52:47,642 INFO L226 Difference]: Without dead ends: 420 [2021-11-09 09:52:47,643 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-11-09 09:52:47,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-11-09 09:52:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 408. [2021-11-09 09:52:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 302 states have (on average 1.2483443708609272) internal successors, (377), 309 states have internal predecessors, (377), 71 states have call successors, (71), 32 states have call predecessors, (71), 34 states have return successors, (92), 67 states have call predecessors, (92), 66 states have call successors, (92) [2021-11-09 09:52:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 540 transitions. [2021-11-09 09:52:47,657 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 540 transitions. Word has length 121 [2021-11-09 09:52:47,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:47,658 INFO L470 AbstractCegarLoop]: Abstraction has 408 states and 540 transitions. [2021-11-09 09:52:47,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-09 09:52:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 540 transitions. [2021-11-09 09:52:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-11-09 09:52:47,660 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:47,660 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:52:47,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-11-09 09:52:47,661 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:47,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash -618619876, now seen corresponding path program 1 times [2021-11-09 09:52:47,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:47,662 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563160612] [2021-11-09 09:52:47,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:47,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:47,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:47,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:47,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:47,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-09 09:52:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:47,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:47,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:47,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:47,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:47,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-09 09:52:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:47,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-09 09:52:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:48,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:48,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-09 09:52:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:48,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:48,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-11-09 09:52:48,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:48,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563160612] [2021-11-09 09:52:48,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563160612] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:48,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:48,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-09 09:52:48,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811350209] [2021-11-09 09:52:48,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-09 09:52:48,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:48,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-09 09:52:48,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-11-09 09:52:48,131 INFO L87 Difference]: Start difference. First operand 408 states and 540 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-09 09:52:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:49,080 INFO L93 Difference]: Finished difference Result 547 states and 788 transitions. [2021-11-09 09:52:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-09 09:52:49,081 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2021-11-09 09:52:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:49,086 INFO L225 Difference]: With dead ends: 547 [2021-11-09 09:52:49,086 INFO L226 Difference]: Without dead ends: 547 [2021-11-09 09:52:49,086 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-11-09 09:52:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-11-09 09:52:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 399. [2021-11-09 09:52:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 294 states have (on average 1.248299319727891) internal successors, (367), 301 states have internal predecessors, (367), 71 states have call successors, (71), 32 states have call predecessors, (71), 33 states have return successors, (91), 66 states have call predecessors, (91), 66 states have call successors, (91) [2021-11-09 09:52:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 529 transitions. [2021-11-09 09:52:49,103 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 529 transitions. Word has length 122 [2021-11-09 09:52:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:49,104 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 529 transitions. [2021-11-09 09:52:49,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2021-11-09 09:52:49,104 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 529 transitions. [2021-11-09 09:52:49,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-09 09:52:49,106 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:49,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:49,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-11-09 09:52:49,107 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:49,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:49,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1613788965, now seen corresponding path program 1 times [2021-11-09 09:52:49,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:49,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006358383] [2021-11-09 09:52:49,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:49,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-09 09:52:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 09:52:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-09 09:52:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-09 09:52:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-09 09:52:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-09 09:52:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:49,834 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-09 09:52:49,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:49,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006358383] [2021-11-09 09:52:49,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006358383] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:49,835 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:49,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-11-09 09:52:49,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887014205] [2021-11-09 09:52:49,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-09 09:52:49,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:49,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-09 09:52:49,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-11-09 09:52:49,838 INFO L87 Difference]: Start difference. First operand 399 states and 529 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-09 09:52:52,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:52,715 INFO L93 Difference]: Finished difference Result 800 states and 1072 transitions. [2021-11-09 09:52:52,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-11-09 09:52:52,716 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2021-11-09 09:52:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:52,721 INFO L225 Difference]: With dead ends: 800 [2021-11-09 09:52:52,721 INFO L226 Difference]: Without dead ends: 743 [2021-11-09 09:52:52,723 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=377, Invalid=2929, Unknown=0, NotChecked=0, Total=3306 [2021-11-09 09:52:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2021-11-09 09:52:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 724. [2021-11-09 09:52:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 536 states have (on average 1.2182835820895523) internal successors, (653), 547 states have internal predecessors, (653), 130 states have call successors, (130), 57 states have call predecessors, (130), 57 states have return successors, (166), 120 states have call predecessors, (166), 122 states have call successors, (166) [2021-11-09 09:52:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 949 transitions. [2021-11-09 09:52:52,747 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 949 transitions. Word has length 119 [2021-11-09 09:52:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:52,748 INFO L470 AbstractCegarLoop]: Abstraction has 724 states and 949 transitions. [2021-11-09 09:52:52,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-09 09:52:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 949 transitions. [2021-11-09 09:52:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-11-09 09:52:52,751 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:52,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:52:52,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-11-09 09:52:52,752 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:52,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:52,753 INFO L85 PathProgramCache]: Analyzing trace with hash 708012953, now seen corresponding path program 1 times [2021-11-09 09:52:52,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:52,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025900659] [2021-11-09 09:52:52,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:52,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:52,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:52,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:52,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-11-09 09:52:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-11-09 09:52:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-11-09 09:52:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-11-09 09:52:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-11-09 09:52:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-09 09:52:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:53,497 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-09 09:52:53,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:53,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025900659] [2021-11-09 09:52:53,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025900659] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:53,498 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:53,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-11-09 09:52:53,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434387377] [2021-11-09 09:52:53,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-09 09:52:53,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:53,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-09 09:52:53,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2021-11-09 09:52:53,500 INFO L87 Difference]: Start difference. First operand 724 states and 949 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-09 09:52:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:56,499 INFO L93 Difference]: Finished difference Result 741 states and 977 transitions. [2021-11-09 09:52:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-09 09:52:56,499 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2021-11-09 09:52:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:56,502 INFO L225 Difference]: With dead ends: 741 [2021-11-09 09:52:56,503 INFO L226 Difference]: Without dead ends: 684 [2021-11-09 09:52:56,504 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=341, Invalid=2209, Unknown=0, NotChecked=0, Total=2550 [2021-11-09 09:52:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-11-09 09:52:56,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 341. [2021-11-09 09:52:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 250 states have (on average 1.18) internal successors, (295), 255 states have internal predecessors, (295), 64 states have call successors, (64), 29 states have call predecessors, (64), 26 states have return successors, (77), 56 states have call predecessors, (77), 58 states have call successors, (77) [2021-11-09 09:52:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 436 transitions. [2021-11-09 09:52:56,518 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 436 transitions. Word has length 119 [2021-11-09 09:52:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:56,519 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 436 transitions. [2021-11-09 09:52:56,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-11-09 09:52:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 436 transitions. [2021-11-09 09:52:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-11-09 09:52:56,521 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:56,522 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:52:56,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-11-09 09:52:56,522 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:56,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash -292170069, now seen corresponding path program 1 times [2021-11-09 09:52:56,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:56,523 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508319211] [2021-11-09 09:52:56,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:56,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-09 09:52:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-09 09:52:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-09 09:52:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-09 09:52:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-11-09 09:52:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-11-09 09:52:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-11-09 09:52:56,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:56,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508319211] [2021-11-09 09:52:56,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508319211] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:52:56,961 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355212991] [2021-11-09 09:52:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:56,962 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:52:56,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:52:56,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:52:56,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-09 09:52:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:57,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-09 09:52:57,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:52:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-09 09:52:57,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355212991] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:57,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-11-09 09:52:57,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 15 [2021-11-09 09:52:57,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701759135] [2021-11-09 09:52:57,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:52:57,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:57,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:52:57,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-11-09 09:52:57,940 INFO L87 Difference]: Start difference. First operand 341 states and 436 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-09 09:52:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:58,003 INFO L93 Difference]: Finished difference Result 374 states and 483 transitions. [2021-11-09 09:52:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:52:58,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 163 [2021-11-09 09:52:58,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:58,007 INFO L225 Difference]: With dead ends: 374 [2021-11-09 09:52:58,008 INFO L226 Difference]: Without dead ends: 372 [2021-11-09 09:52:58,008 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-11-09 09:52:58,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2021-11-09 09:52:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 361. [2021-11-09 09:52:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 268 states have (on average 1.1679104477611941) internal successors, (313), 273 states have internal predecessors, (313), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2021-11-09 09:52:58,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 465 transitions. [2021-11-09 09:52:58,028 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 465 transitions. Word has length 163 [2021-11-09 09:52:58,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:58,028 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 465 transitions. [2021-11-09 09:52:58,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2021-11-09 09:52:58,029 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 465 transitions. [2021-11-09 09:52:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-11-09 09:52:58,032 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:58,032 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:52:58,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-09 09:52:58,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-11-09 09:52:58,247 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:58,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:58,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1488612663, now seen corresponding path program 1 times [2021-11-09 09:52:58,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:58,247 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829567623] [2021-11-09 09:52:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:58,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-09 09:52:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-09 09:52:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-09 09:52:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-09 09:52:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-09 09:52:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-09 09:52:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-11-09 09:52:58,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:52:58,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829567623] [2021-11-09 09:52:58,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829567623] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:52:58,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:52:58,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-09 09:52:58,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511052733] [2021-11-09 09:52:58,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-09 09:52:58,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:52:58,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-09 09:52:58,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-11-09 09:52:58,680 INFO L87 Difference]: Start difference. First operand 361 states and 465 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2021-11-09 09:52:59,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:52:59,591 INFO L93 Difference]: Finished difference Result 388 states and 505 transitions. [2021-11-09 09:52:59,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-09 09:52:59,592 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) Word has length 164 [2021-11-09 09:52:59,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:52:59,595 INFO L225 Difference]: With dead ends: 388 [2021-11-09 09:52:59,595 INFO L226 Difference]: Without dead ends: 388 [2021-11-09 09:52:59,595 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-11-09 09:52:59,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-11-09 09:52:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 363. [2021-11-09 09:52:59,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 270 states have (on average 1.1666666666666667) internal successors, (315), 275 states have internal predecessors, (315), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2021-11-09 09:52:59,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 467 transitions. [2021-11-09 09:52:59,607 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 467 transitions. Word has length 164 [2021-11-09 09:52:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:52:59,608 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 467 transitions. [2021-11-09 09:52:59,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2021-11-09 09:52:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 467 transitions. [2021-11-09 09:52:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-11-09 09:52:59,611 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:52:59,611 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:52:59,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-11-09 09:52:59,612 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:52:59,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:52:59,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1456464136, now seen corresponding path program 1 times [2021-11-09 09:52:59,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:52:59,613 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224544966] [2021-11-09 09:52:59,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:52:59,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:52:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:52:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:52:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:52:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-09 09:52:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:52:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-09 09:52:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-09 09:52:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-09 09:52:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:52:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:52:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:52:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:52:59,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-09 09:52:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-09 09:53:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:53:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:53:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,022 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2021-11-09 09:53:00,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:53:00,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224544966] [2021-11-09 09:53:00,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224544966] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:53:00,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:53:00,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-11-09 09:53:00,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415748417] [2021-11-09 09:53:00,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-11-09 09:53:00,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:53:00,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-11-09 09:53:00,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2021-11-09 09:53:00,025 INFO L87 Difference]: Start difference. First operand 363 states and 467 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (19), 11 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-09 09:53:00,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:53:00,446 INFO L93 Difference]: Finished difference Result 369 states and 477 transitions. [2021-11-09 09:53:00,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 09:53:00,447 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (19), 11 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2021-11-09 09:53:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:53:00,450 INFO L225 Difference]: With dead ends: 369 [2021-11-09 09:53:00,450 INFO L226 Difference]: Without dead ends: 369 [2021-11-09 09:53:00,450 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2021-11-09 09:53:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2021-11-09 09:53:00,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2021-11-09 09:53:00,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 270 states have (on average 1.1592592592592592) internal successors, (313), 275 states have internal predecessors, (313), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2021-11-09 09:53:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 465 transitions. [2021-11-09 09:53:00,461 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 465 transitions. Word has length 164 [2021-11-09 09:53:00,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:53:00,462 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 465 transitions. [2021-11-09 09:53:00,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (19), 11 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2021-11-09 09:53:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 465 transitions. [2021-11-09 09:53:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2021-11-09 09:53:00,465 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:53:00,466 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:53:00,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-11-09 09:53:00,466 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:53:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:53:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1734693448, now seen corresponding path program 1 times [2021-11-09 09:53:00,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:53:00,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369207452] [2021-11-09 09:53:00,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:53:00,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:53:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:53:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:53:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:53:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-09 09:53:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:53:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:53:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:53:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-09 09:53:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-09 09:53:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-09 09:53:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:53:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:53:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-09 09:53:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-09 09:53:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:53:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:53:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-11-09 09:53:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-09 09:53:00,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:53:00,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369207452] [2021-11-09 09:53:00,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369207452] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:53:00,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:53:00,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-09 09:53:00,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156612900] [2021-11-09 09:53:00,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-09 09:53:00,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:53:00,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-09 09:53:00,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-11-09 09:53:00,971 INFO L87 Difference]: Start difference. First operand 363 states and 465 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-09 09:53:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:53:01,520 INFO L93 Difference]: Finished difference Result 428 states and 566 transitions. [2021-11-09 09:53:01,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-09 09:53:01,521 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 172 [2021-11-09 09:53:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:53:01,524 INFO L225 Difference]: With dead ends: 428 [2021-11-09 09:53:01,524 INFO L226 Difference]: Without dead ends: 428 [2021-11-09 09:53:01,525 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-11-09 09:53:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-11-09 09:53:01,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 345. [2021-11-09 09:53:01,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 256 states have (on average 1.14453125) internal successors, (293), 260 states have internal predecessors, (293), 60 states have call successors, (60), 29 states have call predecessors, (60), 28 states have return successors, (80), 55 states have call predecessors, (80), 54 states have call successors, (80) [2021-11-09 09:53:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 433 transitions. [2021-11-09 09:53:01,537 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 433 transitions. Word has length 172 [2021-11-09 09:53:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:53:01,538 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 433 transitions. [2021-11-09 09:53:01,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 5 states have internal predecessors, (83), 2 states have call successors, (20), 11 states have call predecessors, (20), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-11-09 09:53:01,538 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 433 transitions. [2021-11-09 09:53:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2021-11-09 09:53:01,542 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:53:01,542 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:53:01,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-11-09 09:53:01,543 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:53:01,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:53:01,543 INFO L85 PathProgramCache]: Analyzing trace with hash 405901981, now seen corresponding path program 1 times [2021-11-09 09:53:01,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:53:01,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279170299] [2021-11-09 09:53:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:53:01,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:53:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:53:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:53:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:53:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-09 09:53:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:53:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:53:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:53:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-09 09:53:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-09 09:53:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-09 09:53:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:53:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:53:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-09 09:53:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-09 09:53:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:53:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:53:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-09 09:53:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:01,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-09 09:53:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:53:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:53:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-11-09 09:53:02,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:53:02,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279170299] [2021-11-09 09:53:02,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279170299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:53:02,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:53:02,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-09 09:53:02,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696487104] [2021-11-09 09:53:02,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-09 09:53:02,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:53:02,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-09 09:53:02,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-11-09 09:53:02,057 INFO L87 Difference]: Start difference. First operand 345 states and 433 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-11-09 09:53:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:53:02,564 INFO L93 Difference]: Finished difference Result 354 states and 451 transitions. [2021-11-09 09:53:02,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-09 09:53:02,565 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 204 [2021-11-09 09:53:02,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:53:02,567 INFO L225 Difference]: With dead ends: 354 [2021-11-09 09:53:02,567 INFO L226 Difference]: Without dead ends: 354 [2021-11-09 09:53:02,568 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-11-09 09:53:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-11-09 09:53:02,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 309. [2021-11-09 09:53:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 231 states have (on average 1.1255411255411256) internal successors, (260), 234 states have internal predecessors, (260), 52 states have call successors, (52), 24 states have call predecessors, (52), 25 states have return successors, (73), 50 states have call predecessors, (73), 47 states have call successors, (73) [2021-11-09 09:53:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 385 transitions. [2021-11-09 09:53:02,578 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 385 transitions. Word has length 204 [2021-11-09 09:53:02,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:53:02,579 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 385 transitions. [2021-11-09 09:53:02,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-11-09 09:53:02,580 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 385 transitions. [2021-11-09 09:53:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2021-11-09 09:53:02,583 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:53:02,584 INFO L513 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:53:02,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-11-09 09:53:02,584 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-11-09 09:53:02,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:53:02,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2083081796, now seen corresponding path program 1 times [2021-11-09 09:53:02,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:53:02,585 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510720908] [2021-11-09 09:53:02,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:53:02,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:53:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-11-09 09:53:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-11-09 09:53:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-11-09 09:53:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2021-11-09 09:53:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-11-09 09:53:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:53:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:53:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-11-09 09:53:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-11-09 09:53:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-11-09 09:53:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:02,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:53:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:53:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-11-09 09:53:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-11-09 09:53:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:53:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:53:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-11-09 09:53:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-11-09 09:53:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-11-09 09:53:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-11-09 09:53:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-11-09 09:53:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:53:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-11-09 09:53:03,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:53:03,096 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510720908] [2021-11-09 09:53:03,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510720908] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:53:03,096 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:53:03,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-09 09:53:03,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176571674] [2021-11-09 09:53:03,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-09 09:53:03,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:53:03,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-09 09:53:03,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-11-09 09:53:03,100 INFO L87 Difference]: Start difference. First operand 309 states and 385 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-11-09 09:53:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:53:03,944 INFO L93 Difference]: Finished difference Result 290 states and 362 transitions. [2021-11-09 09:53:03,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-11-09 09:53:03,945 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 207 [2021-11-09 09:53:03,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:53:03,946 INFO L225 Difference]: With dead ends: 290 [2021-11-09 09:53:03,946 INFO L226 Difference]: Without dead ends: 0 [2021-11-09 09:53:03,946 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2021-11-09 09:53:03,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-09 09:53:03,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-09 09:53:03,947 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-09 09:53:03,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-09 09:53:03,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2021-11-09 09:53:03,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:53:03,947 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-09 09:53:03,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2021-11-09 09:53:03,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-09 09:53:03,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-09 09:53:03,950 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-11-09 09:53:03,950 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-11-09 09:53:03,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-11-09 09:53:03,954 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, 1, 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-09 09:53:03,956 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 09:53:03,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:53:03 BoogieIcfgContainer [2021-11-09 09:53:03,959 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 09:53:03,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 09:53:03,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 09:53:03,959 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 09:53:03,960 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:51:32" (3/4) ... [2021-11-09 09:53:03,963 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-09 09:53:03,971 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-11-09 09:53:03,971 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2021-11-09 09:53:03,971 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2021-11-09 09:53:03,972 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2021-11-09 09:53:03,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-11-09 09:53:03,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2021-11-09 09:53:03,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2021-11-09 09:53:03,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2021-11-09 09:53:03,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2021-11-09 09:53:03,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-11-09 09:53:03,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2021-11-09 09:53:03,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2021-11-09 09:53:03,973 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-11-09 09:53:03,974 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2021-11-09 09:53:04,000 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2021-11-09 09:53:04,003 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2021-11-09 09:53:04,006 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-09 09:53:04,009 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-09 09:53:04,244 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 09:53:04,246 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 09:53:04,250 INFO L168 Benchmark]: Toolchain (without parser) took 94336.11 ms. Allocated memory was 107.0 MB in the beginning and 281.0 MB in the end (delta: 174.1 MB). Free memory was 78.5 MB in the beginning and 236.1 MB in the end (delta: -157.7 MB). Peak memory consumption was 27.9 MB. Max. memory is 16.1 GB. [2021-11-09 09:53:04,250 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 81.8 MB. Free memory was 50.1 MB in the beginning and 50.1 MB in the end (delta: 37.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:53:04,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.08 ms. Allocated memory is still 107.0 MB. Free memory was 78.2 MB in the beginning and 58.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-11-09 09:53:04,251 INFO L168 Benchmark]: Boogie Preprocessor took 168.94 ms. Allocated memory is still 107.0 MB. Free memory was 57.9 MB in the beginning and 54.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-09 09:53:04,252 INFO L168 Benchmark]: RCFGBuilder took 1362.94 ms. Allocated memory is still 107.0 MB. Free memory was 54.4 MB in the beginning and 59.4 MB in the end (delta: -4.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 16.1 GB. [2021-11-09 09:53:04,252 INFO L168 Benchmark]: TraceAbstraction took 91775.91 ms. Allocated memory was 107.0 MB in the beginning and 281.0 MB in the end (delta: 174.1 MB). Free memory was 59.0 MB in the beginning and 231.3 MB in the end (delta: -172.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 16.1 GB. [2021-11-09 09:53:04,253 INFO L168 Benchmark]: Witness Printer took 289.07 ms. Allocated memory is still 281.0 MB. Free memory was 231.3 MB in the beginning and 236.1 MB in the end (delta: -4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-09 09:53:04,255 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 81.8 MB. Free memory was 50.1 MB in the beginning and 50.1 MB in the end (delta: 37.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 731.08 ms. Allocated memory is still 107.0 MB. Free memory was 78.2 MB in the beginning and 58.0 MB in the end (delta: 20.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 168.94 ms. Allocated memory is still 107.0 MB. Free memory was 57.9 MB in the beginning and 54.4 MB in the end (delta: 3.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1362.94 ms. Allocated memory is still 107.0 MB. Free memory was 54.4 MB in the beginning and 59.4 MB in the end (delta: -4.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 91775.91 ms. Allocated memory was 107.0 MB in the beginning and 281.0 MB in the end (delta: 174.1 MB). Free memory was 59.0 MB in the beginning and 231.3 MB in the end (delta: -172.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 16.1 GB. * Witness Printer took 289.07 ms. Allocated memory is still 281.0 MB. Free memory was 231.3 MB in the beginning and 236.1 MB in the end (delta: -4.9 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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: 647]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 56]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 28 procedures, 299 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 91.6s, OverallIterations: 51, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 68.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 14077 SDtfs, 15533 SDslu, 43568 SDs, 0 SdLazy, 55785 SolverSat, 7497 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1756 GetRequests, 927 SyntacticMatches, 0 SemanticMatches, 829 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2875 ImplicationChecksByTransitivity, 20.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1085occurred in iteration=8, InterpolantAutomatonStates: 656, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 51 MinimizatonAttempts, 2877 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 4057 NumberOfCodeBlocks, 4057 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 4005 ConstructedInterpolants, 0 QuantifiedInterpolants, 17077 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1359 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 52 InterpolantComputations, 51 PerfectInterpolantSequences, 851/857 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-11-09 09:53:04,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbb91f27-420f-4016-86db-9c002d344778/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE