./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg --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 b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:15:16,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:15:16,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:15:16,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:15:16,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:15:16,789 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:15:16,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:15:16,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:15:16,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:15:16,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:15:16,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:15:16,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:15:16,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:15:16,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:15:16,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:15:16,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:15:16,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:15:16,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:15:16,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:15:16,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:15:16,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:15:16,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:15:16,853 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:15:16,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:15:16,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:15:16,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:15:16,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:15:16,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:15:16,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:15:16,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:15:16,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:15:16,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:15:16,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:15:16,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:15:16,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:15:16,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:15:16,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:15:16,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:15:16,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:15:16,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:15:16,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:15:16,877 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-10-28 09:15:16,928 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:15:16,928 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:15:16,929 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:15:16,929 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:15:16,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:15:16,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:15:16,931 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:15:16,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:15:16,932 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:15:16,932 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-28 09:15:16,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:15:16,933 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:15:16,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:15:16,934 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-28 09:15:16,934 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-28 09:15:16,934 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-28 09:15:16,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:15:16,935 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-28 09:15:16,935 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:15:16,935 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:15:16,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:15:16,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:15:16,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:15:16,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:15:16,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:15:16,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:15:16,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:15:16,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:15:16,937 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:15:16,939 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_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/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_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg 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 -> b15a3429ae983cb571408e453cffd56861eca4f5fc7e760aad97ad24a44474ad [2021-10-28 09:15:17,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:15:17,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:15:17,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:15:17,327 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:15:17,328 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:15:17,329 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-28 09:15:17,423 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/data/1cd70b39a/63adf1f993704c6f87c0015c4da1ac66/FLAG3f59ebc75 [2021-10-28 09:15:18,068 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:15:18,069 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c [2021-10-28 09:15:18,109 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/data/1cd70b39a/63adf1f993704c6f87c0015c4da1ac66/FLAG3f59ebc75 [2021-10-28 09:15:18,321 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/data/1cd70b39a/63adf1f993704c6f87c0015c4da1ac66 [2021-10-28 09:15:18,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:15:18,326 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-10-28 09:15:18,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:15:18,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:15:18,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:15:18,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:15:18" (1/1) ... [2021-10-28 09:15:18,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653df6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:15:18, skipping insertion in model container [2021-10-28 09:15:18,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:15:18" (1/1) ... [2021-10-28 09:15:18,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:15:18,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:15:18,800 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_78caf3dd-4515-4882-9b1f-6364aa2ee593/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-28 09:15:18,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:15:18,819 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:15:18,968 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_78caf3dd-4515-4882-9b1f-6364aa2ee593/sv-benchmarks/c/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2021-10-28 09:15:18,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:15:18,997 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:15:18,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:15:18 WrapperNode [2021-10-28 09:15:18,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:15:19,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:15:19,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:15:19,002 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:15:19,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:15:18" (1/1) ... [2021-10-28 09:15:19,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:15:18" (1/1) ... [2021-10-28 09:15:19,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:15:18" (1/1) ... [2021-10-28 09:15:19,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:15:18" (1/1) ... [2021-10-28 09:15:19,104 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:15:18" (1/1) ... [2021-10-28 09:15:19,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:15:18" (1/1) ... [2021-10-28 09:15:19,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:15:18" (1/1) ... [2021-10-28 09:15:19,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:15:19,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:15:19,140 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:15:19,140 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:15:19,141 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:15:18" (1/1) ... [2021-10-28 09:15:19,149 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:15:19,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:15:19,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:15:19,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:15:19,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-10-28 09:15:19,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:15:19,256 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-10-28 09:15:19,257 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-10-28 09:15:19,257 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2021-10-28 09:15:19,257 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2021-10-28 09:15:19,257 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2021-10-28 09:15:19,257 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2021-10-28 09:15:19,257 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2021-10-28 09:15:19,258 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2021-10-28 09:15:19,258 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2021-10-28 09:15:19,258 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-10-28 09:15:19,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-10-28 09:15:19,258 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-10-28 09:15:19,258 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2021-10-28 09:15:19,258 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2021-10-28 09:15:19,259 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2021-10-28 09:15:19,259 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2021-10-28 09:15:19,259 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-10-28 09:15:19,259 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-10-28 09:15:19,259 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-10-28 09:15:19,259 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-10-28 09:15:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-10-28 09:15:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2021-10-28 09:15:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2021-10-28 09:15:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2021-10-28 09:15:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2021-10-28 09:15:19,260 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2021-10-28 09:15:19,261 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2021-10-28 09:15:19,261 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2021-10-28 09:15:19,261 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-10-28 09:15:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-10-28 09:15:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-10-28 09:15:19,261 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-10-28 09:15:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:15:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-10-28 09:15:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-10-28 09:15:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-10-28 09:15:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2021-10-28 09:15:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2021-10-28 09:15:19,262 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2021-10-28 09:15:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2021-10-28 09:15:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2021-10-28 09:15:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2021-10-28 09:15:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-10-28 09:15:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2021-10-28 09:15:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2021-10-28 09:15:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2021-10-28 09:15:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2021-10-28 09:15:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-10-28 09:15:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-10-28 09:15:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-10-28 09:15:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2021-10-28 09:15:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2021-10-28 09:15:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2021-10-28 09:15:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2021-10-28 09:15:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2021-10-28 09:15:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2021-10-28 09:15:19,265 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2021-10-28 09:15:19,266 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-10-28 09:15:19,266 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-10-28 09:15:19,266 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-10-28 09:15:19,266 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2021-10-28 09:15:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-10-28 09:15:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-10-28 09:15:19,267 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-10-28 09:15:19,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-10-28 09:15:19,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:15:19,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:15:19,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-28 09:15:19,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-28 09:15:19,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-28 09:15:19,646 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:19,705 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-28 09:15:19,705 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-28 09:15:19,727 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:19,758 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-28 09:15:19,758 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-28 09:15:19,765 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:19,974 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-10-28 09:15:19,975 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-10-28 09:15:19,977 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:20,102 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2021-10-28 09:15:20,102 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2021-10-28 09:15:20,124 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:20,148 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-10-28 09:15:20,148 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-10-28 09:15:20,260 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:20,270 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-28 09:15:20,270 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-28 09:15:20,272 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:20,281 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-28 09:15:20,282 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-28 09:15:20,284 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:20,296 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-28 09:15:20,297 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-28 09:15:20,348 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:20,413 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2021-10-28 09:15:20,414 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2021-10-28 09:15:20,419 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:20,558 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2021-10-28 09:15:20,558 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2021-10-28 09:15:20,613 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:20,623 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-28 09:15:20,623 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-28 09:15:20,623 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:20,636 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-28 09:15:20,637 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-28 09:15:20,638 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-28 09:15:20,643 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-10-28 09:15:20,643 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-10-28 09:15:20,678 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:15:20,679 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-10-28 09:15:20,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:15:20 BoogieIcfgContainer [2021-10-28 09:15:20,683 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:15:20,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:15:20,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:15:20,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:15:20,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:15:18" (1/3) ... [2021-10-28 09:15:20,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7683be68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:15:20, skipping insertion in model container [2021-10-28 09:15:20,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:15:18" (2/3) ... [2021-10-28 09:15:20,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7683be68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:15:20, skipping insertion in model container [2021-10-28 09:15:20,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:15:20" (3/3) ... [2021-10-28 09:15:20,697 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2021-10-28 09:15:20,708 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:15:20,708 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 09:15:20,775 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:15:20,787 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-10-28 09:15:20,789 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-28 09:15:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 390 states, 288 states have (on average 1.4722222222222223) internal successors, (424), 315 states have internal predecessors, (424), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) [2021-10-28 09:15:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-28 09:15:20,845 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:20,846 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:15:20,847 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:20,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash 495257184, now seen corresponding path program 1 times [2021-10-28 09:15:20,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:20,873 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726275291] [2021-10-28 09:15:20,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:20,875 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:21,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:21,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:21,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:21,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726275291] [2021-10-28 09:15:21,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726275291] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:21,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:21,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:15:21,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459962876] [2021-10-28 09:15:21,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:15:21,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:21,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:15:21,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:15:21,569 INFO L87 Difference]: Start difference. First operand has 390 states, 288 states have (on average 1.4722222222222223) internal successors, (424), 315 states have internal predecessors, (424), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-10-28 09:15:22,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:22,820 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions. [2021-10-28 09:15:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:15:22,822 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-10-28 09:15:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:22,840 INFO L225 Difference]: With dead ends: 429 [2021-10-28 09:15:22,840 INFO L226 Difference]: Without dead ends: 422 [2021-10-28 09:15:22,842 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-10-28 09:15:22,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-28 09:15:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2021-10-28 09:15:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.4326241134751774) internal successors, (404), 306 states have internal predecessors, (404), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2021-10-28 09:15:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 524 transitions. [2021-10-28 09:15:22,935 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 524 transitions. Word has length 15 [2021-10-28 09:15:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:22,936 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 524 transitions. [2021-10-28 09:15:22,936 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-10-28 09:15:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 524 transitions. [2021-10-28 09:15:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-28 09:15:22,938 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:22,938 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-10-28 09:15:22,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:15:22,939 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:22,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1971419500, now seen corresponding path program 1 times [2021-10-28 09:15:22,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:22,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981903572] [2021-10-28 09:15:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:22,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:23,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:23,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:23,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:23,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981903572] [2021-10-28 09:15:23,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981903572] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:23,230 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:23,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:15:23,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116996630] [2021-10-28 09:15:23,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:15:23,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:23,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:15:23,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:15:23,235 INFO L87 Difference]: Start difference. First operand 380 states and 524 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-28 09:15:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:24,659 INFO L93 Difference]: Finished difference Result 422 states and 586 transitions. [2021-10-28 09:15:24,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:15:24,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-10-28 09:15:24,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:24,673 INFO L225 Difference]: With dead ends: 422 [2021-10-28 09:15:24,673 INFO L226 Difference]: Without dead ends: 422 [2021-10-28 09:15:24,674 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:15:24,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-28 09:15:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2021-10-28 09:15:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.429078014184397) internal successors, (403), 306 states have internal predecessors, (403), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2021-10-28 09:15:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2021-10-28 09:15:24,735 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2021-10-28 09:15:24,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:24,736 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2021-10-28 09:15:24,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-10-28 09:15:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2021-10-28 09:15:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-28 09:15:24,738 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:24,738 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-10-28 09:15:24,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:15:24,739 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:24,740 INFO L85 PathProgramCache]: Analyzing trace with hash 809317868, now seen corresponding path program 1 times [2021-10-28 09:15:24,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:24,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033153919] [2021-10-28 09:15:24,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:24,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:24,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:25,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:25,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:25,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:25,041 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033153919] [2021-10-28 09:15:25,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033153919] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:25,041 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:25,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:15:25,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705470793] [2021-10-28 09:15:25,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:15:25,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:25,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:15:25,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:15:25,044 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-28 09:15:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:26,858 INFO L93 Difference]: Finished difference Result 585 states and 798 transitions. [2021-10-28 09:15:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:15:26,858 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-10-28 09:15:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:26,864 INFO L225 Difference]: With dead ends: 585 [2021-10-28 09:15:26,864 INFO L226 Difference]: Without dead ends: 584 [2021-10-28 09:15:26,865 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-10-28 09:15:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2021-10-28 09:15:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2021-10-28 09:15:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 405 states have (on average 1.3530864197530865) internal successors, (548), 410 states have internal predecessors, (548), 78 states have call successors, (78), 41 states have call predecessors, (78), 41 states have return successors, (90), 75 states have call predecessors, (90), 66 states have call successors, (90) [2021-10-28 09:15:26,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2021-10-28 09:15:26,904 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2021-10-28 09:15:26,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:26,905 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2021-10-28 09:15:26,905 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-10-28 09:15:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2021-10-28 09:15:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-28 09:15:26,908 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:26,908 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-10-28 09:15:26,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:15:26,909 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:26,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:26,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1577074200, now seen corresponding path program 1 times [2021-10-28 09:15:26,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:26,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5099273] [2021-10-28 09:15:26,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:26,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:27,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:27,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:27,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:27,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:27,139 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:27,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5099273] [2021-10-28 09:15:27,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5099273] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:27,140 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:27,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:15:27,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177249265] [2021-10-28 09:15:27,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:15:27,141 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:27,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:15:27,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:15:27,142 INFO L87 Difference]: Start difference. First operand 525 states and 716 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-28 09:15:28,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:28,316 INFO L93 Difference]: Finished difference Result 676 states and 906 transitions. [2021-10-28 09:15:28,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:15:28,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2021-10-28 09:15:28,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:28,325 INFO L225 Difference]: With dead ends: 676 [2021-10-28 09:15:28,325 INFO L226 Difference]: Without dead ends: 676 [2021-10-28 09:15:28,326 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-10-28 09:15:28,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2021-10-28 09:15:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2021-10-28 09:15:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 450 states have (on average 1.3488888888888888) internal successors, (607), 463 states have internal predecessors, (607), 82 states have call successors, (82), 46 states have call predecessors, (82), 50 states have return successors, (101), 78 states have call predecessors, (101), 72 states have call successors, (101) [2021-10-28 09:15:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2021-10-28 09:15:28,385 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2021-10-28 09:15:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:28,385 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2021-10-28 09:15:28,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-28 09:15:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2021-10-28 09:15:28,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-28 09:15:28,394 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:28,395 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] [2021-10-28 09:15:28,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:15:28,395 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:28,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:28,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1576156776, now seen corresponding path program 1 times [2021-10-28 09:15:28,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:28,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431586397] [2021-10-28 09:15:28,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:28,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:28,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:28,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:28,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:28,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:28,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431586397] [2021-10-28 09:15:28,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431586397] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:28,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:28,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:15:28,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62403625] [2021-10-28 09:15:28,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:15:28,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:28,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:15:28,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:15:28,679 INFO L87 Difference]: Start difference. First operand 583 states and 790 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-28 09:15:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:30,649 INFO L93 Difference]: Finished difference Result 819 states and 1102 transitions. [2021-10-28 09:15:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:15:30,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2021-10-28 09:15:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:30,660 INFO L225 Difference]: With dead ends: 819 [2021-10-28 09:15:30,660 INFO L226 Difference]: Without dead ends: 819 [2021-10-28 09:15:30,661 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-10-28 09:15:30,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2021-10-28 09:15:30,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2021-10-28 09:15:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 606 states have (on average 1.33993399339934) internal successors, (812), 616 states have internal predecessors, (812), 99 states have call successors, (99), 61 states have call predecessors, (99), 65 states have return successors, (136), 97 states have call predecessors, (136), 91 states have call successors, (136) [2021-10-28 09:15:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2021-10-28 09:15:30,707 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2021-10-28 09:15:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:30,708 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2021-10-28 09:15:30,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-28 09:15:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2021-10-28 09:15:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 09:15:30,712 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:30,712 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] [2021-10-28 09:15:30,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:15:30,713 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:30,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1228281964, now seen corresponding path program 1 times [2021-10-28 09:15:30,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:30,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647529811] [2021-10-28 09:15:30,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:30,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:30,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:30,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:30,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:30,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:30,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-28 09:15:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:30,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:15:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:30,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:30,955 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647529811] [2021-10-28 09:15:30,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647529811] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:30,956 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:30,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:15:30,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226529447] [2021-10-28 09:15:30,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:15:30,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:30,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:15:30,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:15:30,959 INFO L87 Difference]: Start difference. First operand 771 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:15:32,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:32,257 INFO L93 Difference]: Finished difference Result 860 states and 1157 transitions. [2021-10-28 09:15:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:15:32,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2021-10-28 09:15:32,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:32,264 INFO L225 Difference]: With dead ends: 860 [2021-10-28 09:15:32,265 INFO L226 Difference]: Without dead ends: 860 [2021-10-28 09:15:32,265 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:15:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2021-10-28 09:15:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2021-10-28 09:15:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 636 states have (on average 1.3333333333333333) internal successors, (848), 648 states have internal predecessors, (848), 99 states have call successors, (99), 61 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-10-28 09:15:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2021-10-28 09:15:32,301 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38 [2021-10-28 09:15:32,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:32,302 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2021-10-28 09:15:32,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:15:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2021-10-28 09:15:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-10-28 09:15:32,304 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:32,304 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] [2021-10-28 09:15:32,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:15:32,305 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:32,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:32,305 INFO L85 PathProgramCache]: Analyzing trace with hash 452689020, now seen corresponding path program 1 times [2021-10-28 09:15:32,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:32,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457562068] [2021-10-28 09:15:32,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:32,306 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:32,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:32,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:32,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:32,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:32,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457562068] [2021-10-28 09:15:32,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457562068] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:32,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:32,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:15:32,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69308408] [2021-10-28 09:15:32,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:15:32,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:32,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:15:32,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:15:32,556 INFO L87 Difference]: Start difference. First operand 808 states and 1090 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-28 09:15:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:33,783 INFO L93 Difference]: Finished difference Result 839 states and 1128 transitions. [2021-10-28 09:15:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:15:33,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2021-10-28 09:15:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:33,789 INFO L225 Difference]: With dead ends: 839 [2021-10-28 09:15:33,789 INFO L226 Difference]: Without dead ends: 839 [2021-10-28 09:15:33,790 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:15:33,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2021-10-28 09:15:33,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2021-10-28 09:15:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3323029366306027) internal successors, (862), 658 states have internal predecessors, (862), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-10-28 09:15:33,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2021-10-28 09:15:33,825 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2021-10-28 09:15:33,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:33,826 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2021-10-28 09:15:33,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-10-28 09:15:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2021-10-28 09:15:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:15:33,829 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:33,829 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-10-28 09:15:33,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:15:33,830 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:33,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:33,830 INFO L85 PathProgramCache]: Analyzing trace with hash -126316899, now seen corresponding path program 1 times [2021-10-28 09:15:33,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:33,831 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622417668] [2021-10-28 09:15:33,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:33,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:34,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:34,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:34,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:34,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-28 09:15:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:34,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:15:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:34,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:34,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:34,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622417668] [2021-10-28 09:15:34,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622417668] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:34,254 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:34,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:15:34,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593854481] [2021-10-28 09:15:34,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:15:34,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:34,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:15:34,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:15:34,256 INFO L87 Difference]: Start difference. First operand 819 states and 1104 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-28 09:15:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:36,645 INFO L93 Difference]: Finished difference Result 871 states and 1170 transitions. [2021-10-28 09:15:36,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:15:36,645 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-10-28 09:15:36,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:36,652 INFO L225 Difference]: With dead ends: 871 [2021-10-28 09:15:36,652 INFO L226 Difference]: Without dead ends: 871 [2021-10-28 09:15:36,653 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-10-28 09:15:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-10-28 09:15:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2021-10-28 09:15:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.330757341576507) internal successors, (861), 658 states have internal predecessors, (861), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-10-28 09:15:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2021-10-28 09:15:36,687 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 39 [2021-10-28 09:15:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:36,688 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2021-10-28 09:15:36,688 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-10-28 09:15:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2021-10-28 09:15:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 09:15:36,690 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:36,690 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-10-28 09:15:36,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:15:36,690 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:36,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash -481477895, now seen corresponding path program 1 times [2021-10-28 09:15:36,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:36,692 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689747620] [2021-10-28 09:15:36,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:36,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:36,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:36,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:36,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-28 09:15:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:37,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:15:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:37,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:37,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689747620] [2021-10-28 09:15:37,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689747620] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:37,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:37,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:15:37,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821371604] [2021-10-28 09:15:37,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:15:37,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:37,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:15:37,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:15:37,030 INFO L87 Difference]: Start difference. First operand 819 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-28 09:15:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:39,289 INFO L93 Difference]: Finished difference Result 871 states and 1169 transitions. [2021-10-28 09:15:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:15:39,290 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-10-28 09:15:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:39,297 INFO L225 Difference]: With dead ends: 871 [2021-10-28 09:15:39,297 INFO L226 Difference]: Without dead ends: 871 [2021-10-28 09:15:39,298 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2021-10-28 09:15:39,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-10-28 09:15:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2021-10-28 09:15:39,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3292117465224111) internal successors, (860), 658 states have internal predecessors, (860), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2021-10-28 09:15:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2021-10-28 09:15:39,332 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 40 [2021-10-28 09:15:39,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:39,332 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2021-10-28 09:15:39,333 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-10-28 09:15:39,333 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2021-10-28 09:15:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-10-28 09:15:39,334 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:39,334 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-10-28 09:15:39,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 09:15:39,335 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:39,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:39,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1957366842, now seen corresponding path program 1 times [2021-10-28 09:15:39,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:39,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601420575] [2021-10-28 09:15:39,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:39,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:39,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:39,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:39,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-10-28 09:15:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:39,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:15:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:39,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:39,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:39,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601420575] [2021-10-28 09:15:39,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601420575] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:39,595 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:39,595 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:15:39,595 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365646994] [2021-10-28 09:15:39,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:15:39,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:39,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:15:39,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:15:39,597 INFO L87 Difference]: Start difference. First operand 819 states and 1102 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:15:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:41,344 INFO L93 Difference]: Finished difference Result 879 states and 1177 transitions. [2021-10-28 09:15:41,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:15:41,345 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2021-10-28 09:15:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:41,351 INFO L225 Difference]: With dead ends: 879 [2021-10-28 09:15:41,351 INFO L226 Difference]: Without dead ends: 867 [2021-10-28 09:15:41,352 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:15:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2021-10-28 09:15:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2021-10-28 09:15:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 646 states have (on average 1.328173374613003) internal successors, (858), 657 states have internal predecessors, (858), 98 states have call successors, (98), 62 states have call predecessors, (98), 72 states have return successors, (142), 99 states have call predecessors, (142), 90 states have call successors, (142) [2021-10-28 09:15:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2021-10-28 09:15:41,385 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 41 [2021-10-28 09:15:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:41,386 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2021-10-28 09:15:41,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:15:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2021-10-28 09:15:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-28 09:15:41,388 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:41,388 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-10-28 09:15:41,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:15:41,389 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:41,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:41,389 INFO L85 PathProgramCache]: Analyzing trace with hash -884481493, now seen corresponding path program 1 times [2021-10-28 09:15:41,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:41,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777034957] [2021-10-28 09:15:41,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:41,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:41,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:41,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:41,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:41,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:41,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-10-28 09:15:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:41,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:15:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:41,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:41,690 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777034957] [2021-10-28 09:15:41,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777034957] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:41,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:41,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:15:41,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055227928] [2021-10-28 09:15:41,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:15:41,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:41,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:15:41,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:15:41,692 INFO L87 Difference]: Start difference. First operand 817 states and 1098 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:15:43,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:43,367 INFO L93 Difference]: Finished difference Result 877 states and 1173 transitions. [2021-10-28 09:15:43,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:15:43,367 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-10-28 09:15:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:43,377 INFO L225 Difference]: With dead ends: 877 [2021-10-28 09:15:43,378 INFO L226 Difference]: Without dead ends: 860 [2021-10-28 09:15:43,378 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:15:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2021-10-28 09:15:43,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2021-10-28 09:15:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 642 states have (on average 1.3286604361370717) internal successors, (853), 653 states have internal predecessors, (853), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2021-10-28 09:15:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2021-10-28 09:15:43,422 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 42 [2021-10-28 09:15:43,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:43,422 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2021-10-28 09:15:43,423 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-10-28 09:15:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2021-10-28 09:15:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-28 09:15:43,425 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:43,425 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-10-28 09:15:43,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:15:43,426 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:43,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash -586304541, now seen corresponding path program 1 times [2021-10-28 09:15:43,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:43,427 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159117953] [2021-10-28 09:15:43,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:43,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:43,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:43,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:43,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:43,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:15:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:43,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:43,667 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159117953] [2021-10-28 09:15:43,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159117953] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:43,667 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:43,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:15:43,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971125487] [2021-10-28 09:15:43,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:15:43,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:43,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:15:43,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:15:43,669 INFO L87 Difference]: Start difference. First operand 810 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-28 09:15:45,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:45,018 INFO L93 Difference]: Finished difference Result 835 states and 1118 transitions. [2021-10-28 09:15:45,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:15:45,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2021-10-28 09:15:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:45,024 INFO L225 Difference]: With dead ends: 835 [2021-10-28 09:15:45,024 INFO L226 Difference]: Without dead ends: 835 [2021-10-28 09:15:45,025 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:15:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2021-10-28 09:15:45,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2021-10-28 09:15:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 644 states have (on average 1.3276397515527951) internal successors, (855), 655 states have internal predecessors, (855), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2021-10-28 09:15:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2021-10-28 09:15:45,053 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2021-10-28 09:15:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:45,054 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2021-10-28 09:15:45,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-28 09:15:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2021-10-28 09:15:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-10-28 09:15:45,055 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:45,056 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] [2021-10-28 09:15:45,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:15:45,056 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:45,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:45,057 INFO L85 PathProgramCache]: Analyzing trace with hash -211337402, now seen corresponding path program 1 times [2021-10-28 09:15:45,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:45,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355814488] [2021-10-28 09:15:45,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:45,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:45,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:45,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:45,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:45,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:45,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-28 09:15:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:45,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:45,291 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355814488] [2021-10-28 09:15:45,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355814488] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:45,292 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:45,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:15:45,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261918176] [2021-10-28 09:15:45,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:15:45,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:45,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:15:45,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:15:45,294 INFO L87 Difference]: Start difference. First operand 812 states and 1091 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-28 09:15:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:47,425 INFO L93 Difference]: Finished difference Result 840 states and 1124 transitions. [2021-10-28 09:15:47,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:15:47,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2021-10-28 09:15:47,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:47,431 INFO L225 Difference]: With dead ends: 840 [2021-10-28 09:15:47,431 INFO L226 Difference]: Without dead ends: 840 [2021-10-28 09:15:47,432 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:15:47,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2021-10-28 09:15:47,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2021-10-28 09:15:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2021-10-28 09:15:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2021-10-28 09:15:47,466 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2021-10-28 09:15:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:47,466 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2021-10-28 09:15:47,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-28 09:15:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2021-10-28 09:15:47,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-10-28 09:15:47,468 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:47,469 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] [2021-10-28 09:15:47,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:15:47,469 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash 114455309, now seen corresponding path program 1 times [2021-10-28 09:15:47,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:47,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813758242] [2021-10-28 09:15:47,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:47,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:47,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:47,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:15:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:47,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:47,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813758242] [2021-10-28 09:15:47,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813758242] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:47,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:47,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:15:47,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49243463] [2021-10-28 09:15:47,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:15:47,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:47,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:15:47,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:15:47,746 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-28 09:15:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:48,874 INFO L93 Difference]: Finished difference Result 838 states and 1121 transitions. [2021-10-28 09:15:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 09:15:48,875 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2021-10-28 09:15:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:48,880 INFO L225 Difference]: With dead ends: 838 [2021-10-28 09:15:48,880 INFO L226 Difference]: Without dead ends: 838 [2021-10-28 09:15:48,880 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:15:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2021-10-28 09:15:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2021-10-28 09:15:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2021-10-28 09:15:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2021-10-28 09:15:48,908 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2021-10-28 09:15:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:48,908 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2021-10-28 09:15:48,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-28 09:15:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2021-10-28 09:15:48,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-28 09:15:48,910 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:48,911 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-10-28 09:15:48,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:15:48,911 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:48,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1730277995, now seen corresponding path program 1 times [2021-10-28 09:15:48,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:48,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216880289] [2021-10-28 09:15:48,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:48,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:49,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:49,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:49,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:49,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:15:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:49,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 09:15:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:49,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:49,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216880289] [2021-10-28 09:15:49,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216880289] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:49,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:49,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:15:49,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328731732] [2021-10-28 09:15:49,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:15:49,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:49,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:15:49,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:15:49,174 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:15:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:50,547 INFO L93 Difference]: Finished difference Result 858 states and 1146 transitions. [2021-10-28 09:15:50,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:15:50,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2021-10-28 09:15:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:50,553 INFO L225 Difference]: With dead ends: 858 [2021-10-28 09:15:50,553 INFO L226 Difference]: Without dead ends: 843 [2021-10-28 09:15:50,554 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-10-28 09:15:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-10-28 09:15:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2021-10-28 09:15:50,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 646 states have (on average 1.325077399380805) internal successors, (856), 657 states have internal predecessors, (856), 95 states have call successors, (95), 61 states have call predecessors, (95), 72 states have return successors, (141), 97 states have call predecessors, (141), 87 states have call successors, (141) [2021-10-28 09:15:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2021-10-28 09:15:50,585 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2021-10-28 09:15:50,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:50,585 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2021-10-28 09:15:50,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:15:50,586 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2021-10-28 09:15:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-28 09:15:50,587 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:50,587 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-10-28 09:15:50,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:15:50,588 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:50,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:50,588 INFO L85 PathProgramCache]: Analyzing trace with hash -645503113, now seen corresponding path program 1 times [2021-10-28 09:15:50,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:50,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579607997] [2021-10-28 09:15:50,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:50,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:50,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:50,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:50,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:50,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:15:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 09:15:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:50,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:50,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579607997] [2021-10-28 09:15:50,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579607997] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:50,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:50,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:15:50,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773119869] [2021-10-28 09:15:50,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:15:50,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:50,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:15:50,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:15:50,833 INFO L87 Difference]: Start difference. First operand 814 states and 1092 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:15:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:52,203 INFO L93 Difference]: Finished difference Result 855 states and 1136 transitions. [2021-10-28 09:15:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:15:52,203 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-10-28 09:15:52,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:52,212 INFO L225 Difference]: With dead ends: 855 [2021-10-28 09:15:52,212 INFO L226 Difference]: Without dead ends: 804 [2021-10-28 09:15:52,212 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:15:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2021-10-28 09:15:52,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2021-10-28 09:15:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 628 states have internal predecessors, (816), 93 states have call successors, (93), 60 states have call predecessors, (93), 65 states have return successors, (132), 88 states have call predecessors, (132), 85 states have call successors, (132) [2021-10-28 09:15:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2021-10-28 09:15:52,243 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2021-10-28 09:15:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:52,243 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2021-10-28 09:15:52,243 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-10-28 09:15:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2021-10-28 09:15:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-28 09:15:52,246 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:52,246 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-10-28 09:15:52,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:15:52,247 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:52,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:52,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1178138073, now seen corresponding path program 1 times [2021-10-28 09:15:52,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:52,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941267132] [2021-10-28 09:15:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:52,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:52,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:52,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:52,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:52,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-28 09:15:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:52,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:52,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941267132] [2021-10-28 09:15:52,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941267132] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:52,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:52,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-28 09:15:52,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361785499] [2021-10-28 09:15:52,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-28 09:15:52,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-28 09:15:52,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:15:52,454 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-28 09:15:54,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:54,225 INFO L93 Difference]: Finished difference Result 1131 states and 1528 transitions. [2021-10-28 09:15:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:15:54,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2021-10-28 09:15:54,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:54,232 INFO L225 Difference]: With dead ends: 1131 [2021-10-28 09:15:54,232 INFO L226 Difference]: Without dead ends: 1131 [2021-10-28 09:15:54,233 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:15:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2021-10-28 09:15:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2021-10-28 09:15:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 707 states have (on average 1.3295615275813295) internal successors, (940), 721 states have internal predecessors, (940), 103 states have call successors, (103), 70 states have call predecessors, (103), 77 states have return successors, (152), 98 states have call predecessors, (152), 95 states have call successors, (152) [2021-10-28 09:15:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2021-10-28 09:15:54,265 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2021-10-28 09:15:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:54,266 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2021-10-28 09:15:54,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-10-28 09:15:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2021-10-28 09:15:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-28 09:15:54,268 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:54,268 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-10-28 09:15:54,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:15:54,268 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:54,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:54,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1451715450, now seen corresponding path program 1 times [2021-10-28 09:15:54,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:54,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547638739] [2021-10-28 09:15:54,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:54,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:54,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:54,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:15:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:54,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:15:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:54,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:54,501 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547638739] [2021-10-28 09:15:54,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547638739] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:54,501 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:54,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:15:54,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403834936] [2021-10-28 09:15:54,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:15:54,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:54,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:15:54,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:15:54,506 INFO L87 Difference]: Start difference. First operand 888 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:15:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:55,547 INFO L93 Difference]: Finished difference Result 930 states and 1245 transitions. [2021-10-28 09:15:55,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:15:55,548 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2021-10-28 09:15:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:55,553 INFO L225 Difference]: With dead ends: 930 [2021-10-28 09:15:55,553 INFO L226 Difference]: Without dead ends: 915 [2021-10-28 09:15:55,554 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:15:55,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2021-10-28 09:15:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2021-10-28 09:15:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 706 states have (on average 1.3286118980169972) internal successors, (938), 720 states have internal predecessors, (938), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2021-10-28 09:15:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2021-10-28 09:15:55,579 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2021-10-28 09:15:55,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:55,580 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2021-10-28 09:15:55,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:15:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2021-10-28 09:15:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-28 09:15:55,582 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:55,582 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-10-28 09:15:55,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 09:15:55,582 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:55,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1924484230, now seen corresponding path program 1 times [2021-10-28 09:15:55,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:55,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263381828] [2021-10-28 09:15:55,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:55,584 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:55,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:55,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:55,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:55,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-10-28 09:15:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:55,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:55,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263381828] [2021-10-28 09:15:55,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263381828] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:55,906 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:55,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:15:55,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559296632] [2021-10-28 09:15:55,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:15:55,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:55,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:15:55,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:15:55,910 INFO L87 Difference]: Start difference. First operand 886 states and 1191 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-10-28 09:15:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:15:57,973 INFO L93 Difference]: Finished difference Result 936 states and 1237 transitions. [2021-10-28 09:15:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:15:57,973 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2021-10-28 09:15:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:15:57,977 INFO L225 Difference]: With dead ends: 936 [2021-10-28 09:15:57,977 INFO L226 Difference]: Without dead ends: 936 [2021-10-28 09:15:57,977 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2021-10-28 09:15:57,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2021-10-28 09:15:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2021-10-28 09:15:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 697 states have (on average 1.3156384505021521) internal successors, (917), 711 states have internal predecessors, (917), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2021-10-28 09:15:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2021-10-28 09:15:58,004 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2021-10-28 09:15:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:15:58,005 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2021-10-28 09:15:58,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-10-28 09:15:58,005 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2021-10-28 09:15:58,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 09:15:58,007 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:15:58,007 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-10-28 09:15:58,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 09:15:58,008 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:15:58,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:15:58,008 INFO L85 PathProgramCache]: Analyzing trace with hash -398461437, now seen corresponding path program 1 times [2021-10-28 09:15:58,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:15:58,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087418167] [2021-10-28 09:15:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:15:58,009 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:15:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:58,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:15:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:58,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:58,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:15:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:15:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:58,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:15:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:15:58,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:15:58,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:15:58,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087418167] [2021-10-28 09:15:58,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087418167] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:15:58,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:15:58,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:15:58,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877813488] [2021-10-28 09:15:58,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:15:58,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:15:58,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:15:58,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:15:58,335 INFO L87 Difference]: Start difference. First operand 877 states and 1170 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-28 09:16:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:00,840 INFO L93 Difference]: Finished difference Result 1075 states and 1432 transitions. [2021-10-28 09:16:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-28 09:16:00,843 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2021-10-28 09:16:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:00,848 INFO L225 Difference]: With dead ends: 1075 [2021-10-28 09:16:00,849 INFO L226 Difference]: Without dead ends: 1075 [2021-10-28 09:16:00,849 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2021-10-28 09:16:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2021-10-28 09:16:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2021-10-28 09:16:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3090418353576248) internal successors, (970), 757 states have internal predecessors, (970), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2021-10-28 09:16:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2021-10-28 09:16:00,876 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2021-10-28 09:16:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:00,876 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2021-10-28 09:16:00,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-28 09:16:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2021-10-28 09:16:00,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 09:16:00,878 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:00,879 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-10-28 09:16:00,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 09:16:00,879 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:00,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1946804572, now seen corresponding path program 1 times [2021-10-28 09:16:00,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:00,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446287799] [2021-10-28 09:16:00,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:00,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:01,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:01,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:01,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:01,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-28 09:16:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:01,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:01,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:01,129 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446287799] [2021-10-28 09:16:01,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446287799] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:01,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:01,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 09:16:01,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808157069] [2021-10-28 09:16:01,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 09:16:01,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:01,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 09:16:01,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-28 09:16:01,133 INFO L87 Difference]: Start difference. First operand 932 states and 1243 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-28 09:16:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:02,513 INFO L93 Difference]: Finished difference Result 976 states and 1293 transitions. [2021-10-28 09:16:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:16:02,514 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-10-28 09:16:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:02,519 INFO L225 Difference]: With dead ends: 976 [2021-10-28 09:16:02,519 INFO L226 Difference]: Without dead ends: 959 [2021-10-28 09:16:02,520 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:16:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-10-28 09:16:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2021-10-28 09:16:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.2928475033738192) internal successors, (958), 757 states have internal predecessors, (958), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2021-10-28 09:16:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2021-10-28 09:16:02,550 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2021-10-28 09:16:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:02,550 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2021-10-28 09:16:02,551 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-10-28 09:16:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2021-10-28 09:16:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-28 09:16:02,553 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:02,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-10-28 09:16:02,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 09:16:02,554 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:02,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash 764937325, now seen corresponding path program 1 times [2021-10-28 09:16:02,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:02,555 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590633944] [2021-10-28 09:16:02,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:02,555 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:02,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:02,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:02,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:02,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-28 09:16:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:02,759 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:02,759 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590633944] [2021-10-28 09:16:02,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590633944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:02,759 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:02,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:16:02,760 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435064537] [2021-10-28 09:16:02,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:16:02,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:02,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:16:02,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:16:02,761 INFO L87 Difference]: Start difference. First operand 932 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-10-28 09:16:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:04,032 INFO L93 Difference]: Finished difference Result 685 states and 869 transitions. [2021-10-28 09:16:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-28 09:16:04,033 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2021-10-28 09:16:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:04,037 INFO L225 Difference]: With dead ends: 685 [2021-10-28 09:16:04,037 INFO L226 Difference]: Without dead ends: 685 [2021-10-28 09:16:04,037 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:16:04,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2021-10-28 09:16:04,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2021-10-28 09:16:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 498 states have (on average 1.2751004016064258) internal successors, (635), 509 states have internal predecessors, (635), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 68 states have call predecessors, (85), 63 states have call successors, (85) [2021-10-28 09:16:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2021-10-28 09:16:04,057 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2021-10-28 09:16:04,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:04,058 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2021-10-28 09:16:04,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-10-28 09:16:04,058 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2021-10-28 09:16:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-28 09:16:04,060 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:04,060 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-10-28 09:16:04,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 09:16:04,061 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:04,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:04,061 INFO L85 PathProgramCache]: Analyzing trace with hash 855475542, now seen corresponding path program 1 times [2021-10-28 09:16:04,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:04,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632776768] [2021-10-28 09:16:04,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:04,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:04,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:04,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:04,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:04,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:16:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:04,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:04,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632776768] [2021-10-28 09:16:04,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632776768] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:04,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:04,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 09:16:04,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557215342] [2021-10-28 09:16:04,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 09:16:04,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:04,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 09:16:04,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-10-28 09:16:04,342 INFO L87 Difference]: Start difference. First operand 623 states and 791 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:06,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:06,203 INFO L93 Difference]: Finished difference Result 659 states and 834 transitions. [2021-10-28 09:16:06,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:16:06,208 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2021-10-28 09:16:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:06,211 INFO L225 Difference]: With dead ends: 659 [2021-10-28 09:16:06,211 INFO L226 Difference]: Without dead ends: 659 [2021-10-28 09:16:06,212 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-10-28 09:16:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2021-10-28 09:16:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 624. [2021-10-28 09:16:06,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 499 states have (on average 1.2745490981963927) internal successors, (636), 509 states have internal predecessors, (636), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2021-10-28 09:16:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 792 transitions. [2021-10-28 09:16:06,230 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 792 transitions. Word has length 51 [2021-10-28 09:16:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:06,230 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 792 transitions. [2021-10-28 09:16:06,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 792 transitions. [2021-10-28 09:16:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-28 09:16:06,233 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:06,233 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-10-28 09:16:06,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 09:16:06,233 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash -69609850, now seen corresponding path program 1 times [2021-10-28 09:16:06,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:06,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197378474] [2021-10-28 09:16:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:06,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:06,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:06,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:06,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:06,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:16:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:06,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:06,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197378474] [2021-10-28 09:16:06,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197378474] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:06,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:06,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-28 09:16:06,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106476059] [2021-10-28 09:16:06,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-28 09:16:06,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:06,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-28 09:16:06,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-10-28 09:16:06,489 INFO L87 Difference]: Start difference. First operand 624 states and 792 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-28 09:16:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:07,925 INFO L93 Difference]: Finished difference Result 673 states and 848 transitions. [2021-10-28 09:16:07,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:16:07,925 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2021-10-28 09:16:07,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:07,928 INFO L225 Difference]: With dead ends: 673 [2021-10-28 09:16:07,928 INFO L226 Difference]: Without dead ends: 648 [2021-10-28 09:16:07,929 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:16:07,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2021-10-28 09:16:07,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 616. [2021-10-28 09:16:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 491 states have (on average 1.2688391038696538) internal successors, (623), 501 states have internal predecessors, (623), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2021-10-28 09:16:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2021-10-28 09:16:07,945 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2021-10-28 09:16:07,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:07,945 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2021-10-28 09:16:07,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-28 09:16:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2021-10-28 09:16:07,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-28 09:16:07,947 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:07,947 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-10-28 09:16:07,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 09:16:07,948 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:07,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:07,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1297164280, now seen corresponding path program 1 times [2021-10-28 09:16:07,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:07,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162275217] [2021-10-28 09:16:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:07,949 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:07,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:08,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:08,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:08,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:08,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:08,174 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:08,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162275217] [2021-10-28 09:16:08,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162275217] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:08,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:08,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:16:08,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833236319] [2021-10-28 09:16:08,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:16:08,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:08,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:16:08,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:16:08,177 INFO L87 Difference]: Start difference. First operand 616 states and 779 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:09,682 INFO L93 Difference]: Finished difference Result 850 states and 1092 transitions. [2021-10-28 09:16:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:16:09,683 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-10-28 09:16:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:09,688 INFO L225 Difference]: With dead ends: 850 [2021-10-28 09:16:09,688 INFO L226 Difference]: Without dead ends: 832 [2021-10-28 09:16:09,689 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-10-28 09:16:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2021-10-28 09:16:09,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 659. [2021-10-28 09:16:09,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 527 states have (on average 1.2580645161290323) internal successors, (663), 530 states have internal predecessors, (663), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2021-10-28 09:16:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 833 transitions. [2021-10-28 09:16:09,711 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 833 transitions. Word has length 52 [2021-10-28 09:16:09,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:09,711 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 833 transitions. [2021-10-28 09:16:09,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 833 transitions. [2021-10-28 09:16:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-28 09:16:09,714 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:09,714 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-10-28 09:16:09,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 09:16:09,714 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:09,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:09,715 INFO L85 PathProgramCache]: Analyzing trace with hash 147904264, now seen corresponding path program 1 times [2021-10-28 09:16:09,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:09,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200997742] [2021-10-28 09:16:09,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:09,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:09,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:09,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:09,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:09,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:09,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:09,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:09,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200997742] [2021-10-28 09:16:09,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200997742] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:09,964 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:09,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:16:09,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749217720] [2021-10-28 09:16:09,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:16:09,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:09,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:16:09,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:16:09,967 INFO L87 Difference]: Start difference. First operand 659 states and 833 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:11,096 INFO L93 Difference]: Finished difference Result 719 states and 923 transitions. [2021-10-28 09:16:11,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-28 09:16:11,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2021-10-28 09:16:11,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:11,103 INFO L225 Difference]: With dead ends: 719 [2021-10-28 09:16:11,104 INFO L226 Difference]: Without dead ends: 714 [2021-10-28 09:16:11,104 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:16:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2021-10-28 09:16:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 666. [2021-10-28 09:16:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 534 states have (on average 1.2602996254681649) internal successors, (673), 537 states have internal predecessors, (673), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2021-10-28 09:16:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 843 transitions. [2021-10-28 09:16:11,126 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 843 transitions. Word has length 52 [2021-10-28 09:16:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:11,126 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 843 transitions. [2021-10-28 09:16:11,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 843 transitions. [2021-10-28 09:16:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-28 09:16:11,129 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:11,129 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-10-28 09:16:11,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-28 09:16:11,129 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:11,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1440443638, now seen corresponding path program 1 times [2021-10-28 09:16:11,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:11,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256749276] [2021-10-28 09:16:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:11,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:11,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:11,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:11,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:11,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:11,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:11,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:11,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256749276] [2021-10-28 09:16:11,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256749276] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:11,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:11,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:16:11,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779489841] [2021-10-28 09:16:11,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:16:11,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:11,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:16:11,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:16:11,435 INFO L87 Difference]: Start difference. First operand 666 states and 843 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-28 09:16:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:13,375 INFO L93 Difference]: Finished difference Result 652 states and 822 transitions. [2021-10-28 09:16:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:16:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2021-10-28 09:16:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:13,378 INFO L225 Difference]: With dead ends: 652 [2021-10-28 09:16:13,379 INFO L226 Difference]: Without dead ends: 610 [2021-10-28 09:16:13,379 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2021-10-28 09:16:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-10-28 09:16:13,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 575. [2021-10-28 09:16:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 455 states have (on average 1.2747252747252746) internal successors, (580), 465 states have internal predecessors, (580), 69 states have call successors, (69), 44 states have call predecessors, (69), 50 states have return successors, (82), 66 states have call predecessors, (82), 61 states have call successors, (82) [2021-10-28 09:16:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2021-10-28 09:16:13,394 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2021-10-28 09:16:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:13,394 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2021-10-28 09:16:13,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-10-28 09:16:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2021-10-28 09:16:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-28 09:16:13,396 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:13,396 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-28 09:16:13,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-28 09:16:13,397 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:13,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:13,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1105462305, now seen corresponding path program 1 times [2021-10-28 09:16:13,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:13,397 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466508976] [2021-10-28 09:16:13,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:13,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:13,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:13,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:13,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:13,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:13,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:13,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:13,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:13,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466508976] [2021-10-28 09:16:13,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466508976] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:13,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:13,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 09:16:13,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53891019] [2021-10-28 09:16:13,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 09:16:13,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:13,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 09:16:13,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:16:13,676 INFO L87 Difference]: Start difference. First operand 575 states and 731 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:15,518 INFO L93 Difference]: Finished difference Result 606 states and 767 transitions. [2021-10-28 09:16:15,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:16:15,519 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2021-10-28 09:16:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:15,523 INFO L225 Difference]: With dead ends: 606 [2021-10-28 09:16:15,523 INFO L226 Difference]: Without dead ends: 605 [2021-10-28 09:16:15,523 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-10-28 09:16:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-10-28 09:16:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 583. [2021-10-28 09:16:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 462 states have (on average 1.2705627705627707) internal successors, (587), 472 states have internal predecessors, (587), 69 states have call successors, (69), 44 states have call predecessors, (69), 51 states have return successors, (83), 67 states have call predecessors, (83), 61 states have call successors, (83) [2021-10-28 09:16:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 739 transitions. [2021-10-28 09:16:15,537 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 739 transitions. Word has length 53 [2021-10-28 09:16:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:15,538 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 739 transitions. [2021-10-28 09:16:15,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 739 transitions. [2021-10-28 09:16:15,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-28 09:16:15,540 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:15,540 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-10-28 09:16:15,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-28 09:16:15,541 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:15,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:15,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1105739135, now seen corresponding path program 1 times [2021-10-28 09:16:15,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:15,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160178255] [2021-10-28 09:16:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:15,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:15,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:15,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:15,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:15,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:15,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:15,878 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160178255] [2021-10-28 09:16:15,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160178255] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:15,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:15,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 09:16:15,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366191501] [2021-10-28 09:16:15,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 09:16:15,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:15,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 09:16:15,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:16:15,884 INFO L87 Difference]: Start difference. First operand 583 states and 739 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:17,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:17,239 INFO L93 Difference]: Finished difference Result 641 states and 820 transitions. [2021-10-28 09:16:17,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:16:17,239 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2021-10-28 09:16:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:17,243 INFO L225 Difference]: With dead ends: 641 [2021-10-28 09:16:17,243 INFO L226 Difference]: Without dead ends: 629 [2021-10-28 09:16:17,243 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-10-28 09:16:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-10-28 09:16:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 589. [2021-10-28 09:16:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 467 states have (on average 1.2676659528907923) internal successors, (592), 478 states have internal predecessors, (592), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (90), 67 states have call predecessors, (90), 61 states have call successors, (90) [2021-10-28 09:16:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2021-10-28 09:16:17,258 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2021-10-28 09:16:17,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:17,259 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2021-10-28 09:16:17,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2021-10-28 09:16:17,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-28 09:16:17,261 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:17,261 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] [2021-10-28 09:16:17,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-28 09:16:17,262 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:17,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1185659497, now seen corresponding path program 1 times [2021-10-28 09:16:17,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:17,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652008509] [2021-10-28 09:16:17,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:17,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:17,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:17,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:17,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:17,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:17,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:17,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:17,529 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652008509] [2021-10-28 09:16:17,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652008509] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:17,530 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:17,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:16:17,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551889431] [2021-10-28 09:16:17,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:16:17,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:17,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:16:17,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:16:17,532 INFO L87 Difference]: Start difference. First operand 589 states and 751 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-28 09:16:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:20,221 INFO L93 Difference]: Finished difference Result 754 states and 980 transitions. [2021-10-28 09:16:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:16:20,224 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2021-10-28 09:16:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:20,228 INFO L225 Difference]: With dead ends: 754 [2021-10-28 09:16:20,228 INFO L226 Difference]: Without dead ends: 740 [2021-10-28 09:16:20,229 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2021-10-28 09:16:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2021-10-28 09:16:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 573. [2021-10-28 09:16:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 454 states have (on average 1.2731277533039647) internal successors, (578), 464 states have internal predecessors, (578), 68 states have call successors, (68), 44 states have call predecessors, (68), 50 states have return successors, (81), 65 states have call predecessors, (81), 60 states have call successors, (81) [2021-10-28 09:16:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 727 transitions. [2021-10-28 09:16:20,247 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 727 transitions. Word has length 54 [2021-10-28 09:16:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:20,247 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 727 transitions. [2021-10-28 09:16:20,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-10-28 09:16:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 727 transitions. [2021-10-28 09:16:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-10-28 09:16:20,249 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:20,249 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] [2021-10-28 09:16:20,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-28 09:16:20,250 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:20,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:20,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1315437004, now seen corresponding path program 1 times [2021-10-28 09:16:20,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:20,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940622685] [2021-10-28 09:16:20,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:20,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:20,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:20,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:20,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:20,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 09:16:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:20,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-28 09:16:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:20,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:20,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940622685] [2021-10-28 09:16:20,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940622685] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:20,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:20,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:16:20,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276802786] [2021-10-28 09:16:20,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:16:20,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:20,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:16:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:16:20,601 INFO L87 Difference]: Start difference. First operand 573 states and 727 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-28 09:16:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:21,948 INFO L93 Difference]: Finished difference Result 605 states and 763 transitions. [2021-10-28 09:16:21,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:16:21,948 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2021-10-28 09:16:21,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:21,951 INFO L225 Difference]: With dead ends: 605 [2021-10-28 09:16:21,951 INFO L226 Difference]: Without dead ends: 580 [2021-10-28 09:16:21,951 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-10-28 09:16:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2021-10-28 09:16:21,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 561. [2021-10-28 09:16:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 445 states have (on average 1.2719101123595506) internal successors, (566), 455 states have internal predecessors, (566), 66 states have call successors, (66), 43 states have call predecessors, (66), 49 states have return successors, (79), 63 states have call predecessors, (79), 58 states have call successors, (79) [2021-10-28 09:16:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2021-10-28 09:16:21,965 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 55 [2021-10-28 09:16:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:21,965 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2021-10-28 09:16:21,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-28 09:16:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2021-10-28 09:16:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-28 09:16:21,967 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:21,968 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-10-28 09:16:21,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-28 09:16:21,968 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash -423366039, now seen corresponding path program 1 times [2021-10-28 09:16:21,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:21,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522929689] [2021-10-28 09:16:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:21,969 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:22,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:22,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:22,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:22,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-28 09:16:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:22,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:16:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:22,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-10-28 09:16:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:22,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:22,218 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522929689] [2021-10-28 09:16:22,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522929689] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:22,218 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:22,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-28 09:16:22,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318654099] [2021-10-28 09:16:22,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-28 09:16:22,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:22,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-28 09:16:22,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-28 09:16:22,220 INFO L87 Difference]: Start difference. First operand 561 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-28 09:16:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:23,268 INFO L93 Difference]: Finished difference Result 589 states and 746 transitions. [2021-10-28 09:16:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 09:16:23,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2021-10-28 09:16:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:23,273 INFO L225 Difference]: With dead ends: 589 [2021-10-28 09:16:23,274 INFO L226 Difference]: Without dead ends: 589 [2021-10-28 09:16:23,275 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-10-28 09:16:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-10-28 09:16:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2021-10-28 09:16:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 449 states have (on average 1.265033407572383) internal successors, (568), 460 states have internal predecessors, (568), 66 states have call successors, (66), 43 states have call predecessors, (66), 50 states have return successors, (83), 63 states have call predecessors, (83), 58 states have call successors, (83) [2021-10-28 09:16:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2021-10-28 09:16:23,290 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 58 [2021-10-28 09:16:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:23,291 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2021-10-28 09:16:23,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-28 09:16:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2021-10-28 09:16:23,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-28 09:16:23,295 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:23,296 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] [2021-10-28 09:16:23,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-28 09:16:23,296 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:23,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:23,297 INFO L85 PathProgramCache]: Analyzing trace with hash 178096204, now seen corresponding path program 1 times [2021-10-28 09:16:23,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:23,297 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439572747] [2021-10-28 09:16:23,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:23,297 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:23,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:23,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:23,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:23,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-28 09:16:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:23,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:16:23,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:23,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:16:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:23,636 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:23,637 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439572747] [2021-10-28 09:16:23,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439572747] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:23,637 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:23,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:16:23,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853594123] [2021-10-28 09:16:23,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:16:23,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:23,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:16:23,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:16:23,639 INFO L87 Difference]: Start difference. First operand 566 states and 717 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-28 09:16:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:24,619 INFO L93 Difference]: Finished difference Result 538 states and 675 transitions. [2021-10-28 09:16:24,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:16:24,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2021-10-28 09:16:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:24,622 INFO L225 Difference]: With dead ends: 538 [2021-10-28 09:16:24,622 INFO L226 Difference]: Without dead ends: 538 [2021-10-28 09:16:24,623 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:16:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-10-28 09:16:24,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2021-10-28 09:16:24,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 402 states have (on average 1.2537313432835822) internal successors, (504), 410 states have internal predecessors, (504), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (72), 59 states have call predecessors, (72), 56 states have call successors, (72) [2021-10-28 09:16:24,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2021-10-28 09:16:24,648 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2021-10-28 09:16:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:24,649 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2021-10-28 09:16:24,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-28 09:16:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2021-10-28 09:16:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-10-28 09:16:24,652 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:24,652 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] [2021-10-28 09:16:24,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-28 09:16:24,654 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:24,655 INFO L85 PathProgramCache]: Analyzing trace with hash -464089137, now seen corresponding path program 1 times [2021-10-28 09:16:24,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:24,655 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984171617] [2021-10-28 09:16:24,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:24,655 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:24,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:24,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:24,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:24,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:16:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:25,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-10-28 09:16:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:25,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:25,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984171617] [2021-10-28 09:16:25,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984171617] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:25,020 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:25,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:16:25,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48955708] [2021-10-28 09:16:25,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:16:25,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:16:25,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:16:25,022 INFO L87 Difference]: Start difference. First operand 511 states and 639 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-28 09:16:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:26,723 INFO L93 Difference]: Finished difference Result 542 states and 675 transitions. [2021-10-28 09:16:26,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:16:26,723 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2021-10-28 09:16:26,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:26,725 INFO L225 Difference]: With dead ends: 542 [2021-10-28 09:16:26,726 INFO L226 Difference]: Without dead ends: 524 [2021-10-28 09:16:26,726 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-10-28 09:16:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-10-28 09:16:26,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2021-10-28 09:16:26,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 399 states have (on average 1.255639097744361) internal successors, (501), 408 states have internal predecessors, (501), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (71), 58 states have call predecessors, (71), 56 states have call successors, (71) [2021-10-28 09:16:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2021-10-28 09:16:26,748 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2021-10-28 09:16:26,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:26,749 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2021-10-28 09:16:26,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-28 09:16:26,749 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2021-10-28 09:16:26,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-28 09:16:26,751 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:26,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] [2021-10-28 09:16:26,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-28 09:16:26,751 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:26,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash 462485744, now seen corresponding path program 1 times [2021-10-28 09:16:26,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:26,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622990543] [2021-10-28 09:16:26,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:26,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:26,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:26,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:26,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:16:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-28 09:16:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:27,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:27,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622990543] [2021-10-28 09:16:27,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622990543] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:27,022 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:27,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 09:16:27,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165724803] [2021-10-28 09:16:27,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 09:16:27,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:27,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 09:16:27,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:16:27,024 INFO L87 Difference]: Start difference. First operand 508 states and 635 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:28,402 INFO L93 Difference]: Finished difference Result 535 states and 666 transitions. [2021-10-28 09:16:28,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 09:16:28,402 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2021-10-28 09:16:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:28,420 INFO L225 Difference]: With dead ends: 535 [2021-10-28 09:16:28,420 INFO L226 Difference]: Without dead ends: 520 [2021-10-28 09:16:28,420 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:16:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-10-28 09:16:28,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2021-10-28 09:16:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 396 states have (on average 1.255050505050505) internal successors, (497), 405 states have internal predecessors, (497), 62 states have call successors, (62), 42 states have call predecessors, (62), 45 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2021-10-28 09:16:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2021-10-28 09:16:28,437 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2021-10-28 09:16:28,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:28,438 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2021-10-28 09:16:28,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2021-10-28 09:16:28,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-10-28 09:16:28,439 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:28,440 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] [2021-10-28 09:16:28,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-28 09:16:28,440 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:28,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:28,441 INFO L85 PathProgramCache]: Analyzing trace with hash -238724580, now seen corresponding path program 1 times [2021-10-28 09:16:28,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:28,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804520123] [2021-10-28 09:16:28,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:28,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:28,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:28,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:28,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:16:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:28,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-28 09:16:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:28,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-10-28 09:16:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:28,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:28,713 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804520123] [2021-10-28 09:16:28,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804520123] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:28,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:28,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:16:28,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840370119] [2021-10-28 09:16:28,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:16:28,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:28,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:16:28,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:16:28,716 INFO L87 Difference]: Start difference. First operand 504 states and 629 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-28 09:16:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:30,099 INFO L93 Difference]: Finished difference Result 536 states and 666 transitions. [2021-10-28 09:16:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:16:30,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2021-10-28 09:16:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:30,103 INFO L225 Difference]: With dead ends: 536 [2021-10-28 09:16:30,103 INFO L226 Difference]: Without dead ends: 515 [2021-10-28 09:16:30,103 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:16:30,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2021-10-28 09:16:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2021-10-28 09:16:30,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.251908396946565) internal successors, (492), 401 states have internal predecessors, (492), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2021-10-28 09:16:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2021-10-28 09:16:30,115 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2021-10-28 09:16:30,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:30,115 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2021-10-28 09:16:30,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2021-10-28 09:16:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2021-10-28 09:16:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-28 09:16:30,117 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:30,117 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-10-28 09:16:30,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-28 09:16:30,118 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:30,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash -858312845, now seen corresponding path program 1 times [2021-10-28 09:16:30,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:30,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863870848] [2021-10-28 09:16:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:30,119 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:30,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:30,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:30,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-28 09:16:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:30,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:16:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:30,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:16:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:30,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:30,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:30,419 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863870848] [2021-10-28 09:16:30,419 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863870848] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:30,419 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:30,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:16:30,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100514918] [2021-10-28 09:16:30,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:16:30,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:30,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:16:30,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:16:30,422 INFO L87 Difference]: Start difference. First operand 499 states and 621 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-28 09:16:32,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:32,034 INFO L93 Difference]: Finished difference Result 521 states and 649 transitions. [2021-10-28 09:16:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:16:32,035 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2021-10-28 09:16:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:32,037 INFO L225 Difference]: With dead ends: 521 [2021-10-28 09:16:32,037 INFO L226 Difference]: Without dead ends: 521 [2021-10-28 09:16:32,038 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2021-10-28 09:16:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-10-28 09:16:32,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2021-10-28 09:16:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.2468193384223918) internal successors, (490), 401 states have internal predecessors, (490), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2021-10-28 09:16:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2021-10-28 09:16:32,049 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2021-10-28 09:16:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:32,049 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2021-10-28 09:16:32,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-28 09:16:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2021-10-28 09:16:32,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-28 09:16:32,051 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:32,052 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-10-28 09:16:32,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-10-28 09:16:32,052 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:32,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1201869596, now seen corresponding path program 1 times [2021-10-28 09:16:32,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:32,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924890914] [2021-10-28 09:16:32,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:32,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:32,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:32,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:16:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:32,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:16:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:32,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:32,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:32,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924890914] [2021-10-28 09:16:32,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924890914] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:32,312 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:32,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-28 09:16:32,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008725112] [2021-10-28 09:16:32,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-28 09:16:32,313 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:32,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-28 09:16:32,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-10-28 09:16:32,314 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-28 09:16:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:33,844 INFO L93 Difference]: Finished difference Result 519 states and 644 transitions. [2021-10-28 09:16:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:16:33,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-10-28 09:16:33,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:33,846 INFO L225 Difference]: With dead ends: 519 [2021-10-28 09:16:33,846 INFO L226 Difference]: Without dead ends: 519 [2021-10-28 09:16:33,847 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:16:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-10-28 09:16:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2021-10-28 09:16:33,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 396 states have (on average 1.244949494949495) internal successors, (493), 404 states have internal predecessors, (493), 61 states have call successors, (61), 42 states have call predecessors, (61), 45 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69) [2021-10-28 09:16:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2021-10-28 09:16:33,858 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2021-10-28 09:16:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:33,858 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2021-10-28 09:16:33,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-28 09:16:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2021-10-28 09:16:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-28 09:16:33,861 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:33,861 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-10-28 09:16:33,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-10-28 09:16:33,861 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:33,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash -813300133, now seen corresponding path program 1 times [2021-10-28 09:16:33,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:33,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380051435] [2021-10-28 09:16:33,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:33,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:33,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:34,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:34,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:34,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:16:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:34,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:16:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:34,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:34,131 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380051435] [2021-10-28 09:16:34,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380051435] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:34,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:34,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:16:34,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61144511] [2021-10-28 09:16:34,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:16:34,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:34,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:16:34,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:16:34,134 INFO L87 Difference]: Start difference. First operand 503 states and 623 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-28 09:16:35,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:35,622 INFO L93 Difference]: Finished difference Result 505 states and 625 transitions. [2021-10-28 09:16:35,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:16:35,623 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2021-10-28 09:16:35,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:35,624 INFO L225 Difference]: With dead ends: 505 [2021-10-28 09:16:35,624 INFO L226 Difference]: Without dead ends: 505 [2021-10-28 09:16:35,625 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2021-10-28 09:16:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-28 09:16:35,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2021-10-28 09:16:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.2395833333333333) internal successors, (476), 391 states have internal predecessors, (476), 60 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2021-10-28 09:16:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2021-10-28 09:16:35,634 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2021-10-28 09:16:35,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:35,635 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2021-10-28 09:16:35,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2021-10-28 09:16:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2021-10-28 09:16:35,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-28 09:16:35,637 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:35,637 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-10-28 09:16:35,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-10-28 09:16:35,638 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:35,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:35,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1336611306, now seen corresponding path program 1 times [2021-10-28 09:16:35,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:35,639 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586401200] [2021-10-28 09:16:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:35,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:35,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:35,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:35,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:35,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:16:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:35,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:35,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:35,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586401200] [2021-10-28 09:16:35,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586401200] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:35,924 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:35,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:16:35,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606418419] [2021-10-28 09:16:35,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:16:35,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:35,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:16:35,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:16:35,928 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:37,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:37,320 INFO L93 Difference]: Finished difference Result 519 states and 639 transitions. [2021-10-28 09:16:37,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:16:37,321 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2021-10-28 09:16:37,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:37,323 INFO L225 Difference]: With dead ends: 519 [2021-10-28 09:16:37,323 INFO L226 Difference]: Without dead ends: 501 [2021-10-28 09:16:37,324 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-28 09:16:37,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-10-28 09:16:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2021-10-28 09:16:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2388451443569555) internal successors, (472), 388 states have internal predecessors, (472), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2021-10-28 09:16:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 598 transitions. [2021-10-28 09:16:37,333 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 598 transitions. Word has length 63 [2021-10-28 09:16:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:37,334 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 598 transitions. [2021-10-28 09:16:37,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 598 transitions. [2021-10-28 09:16:37,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-28 09:16:37,336 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:37,336 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-10-28 09:16:37,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-10-28 09:16:37,337 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:37,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:37,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2015464718, now seen corresponding path program 1 times [2021-10-28 09:16:37,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:37,337 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158196346] [2021-10-28 09:16:37,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:37,338 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:37,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:37,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:37,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:37,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-28 09:16:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:37,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:16:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:37,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:16:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:37,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:37,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:37,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158196346] [2021-10-28 09:16:37,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158196346] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:37,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:37,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:16:37,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298279305] [2021-10-28 09:16:37,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:16:37,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:37,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:16:37,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:16:37,631 INFO L87 Difference]: Start difference. First operand 485 states and 598 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-10-28 09:16:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:38,907 INFO L93 Difference]: Finished difference Result 520 states and 645 transitions. [2021-10-28 09:16:38,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 09:16:38,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2021-10-28 09:16:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:38,909 INFO L225 Difference]: With dead ends: 520 [2021-10-28 09:16:38,910 INFO L226 Difference]: Without dead ends: 520 [2021-10-28 09:16:38,910 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-10-28 09:16:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2021-10-28 09:16:38,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 485. [2021-10-28 09:16:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2335958005249343) internal successors, (470), 388 states have internal predecessors, (470), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2021-10-28 09:16:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2021-10-28 09:16:38,920 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 71 [2021-10-28 09:16:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:38,920 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2021-10-28 09:16:38,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-10-28 09:16:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2021-10-28 09:16:38,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-28 09:16:38,922 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:38,923 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] [2021-10-28 09:16:38,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-10-28 09:16:38,923 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:38,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:38,924 INFO L85 PathProgramCache]: Analyzing trace with hash -137076744, now seen corresponding path program 1 times [2021-10-28 09:16:38,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:38,924 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488670875] [2021-10-28 09:16:38,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:38,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:39,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:39,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:39,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-10-28 09:16:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:39,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:39,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488670875] [2021-10-28 09:16:39,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488670875] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:39,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:39,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 09:16:39,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139633533] [2021-10-28 09:16:39,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 09:16:39,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:39,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 09:16:39,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:16:39,208 INFO L87 Difference]: Start difference. First operand 485 states and 596 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:40,428 INFO L93 Difference]: Finished difference Result 509 states and 624 transitions. [2021-10-28 09:16:40,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:16:40,428 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2021-10-28 09:16:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:40,430 INFO L225 Difference]: With dead ends: 509 [2021-10-28 09:16:40,430 INFO L226 Difference]: Without dead ends: 490 [2021-10-28 09:16:40,430 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:16:40,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-10-28 09:16:40,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2021-10-28 09:16:40,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 372 states have (on average 1.2311827956989247) internal successors, (458), 379 states have internal predecessors, (458), 58 states have call successors, (58), 42 states have call predecessors, (58), 43 states have return successors, (65), 53 states have call predecessors, (65), 52 states have call successors, (65) [2021-10-28 09:16:40,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2021-10-28 09:16:40,440 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2021-10-28 09:16:40,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:40,440 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2021-10-28 09:16:40,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:40,441 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2021-10-28 09:16:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-28 09:16:40,442 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:40,442 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] [2021-10-28 09:16:40,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-10-28 09:16:40,443 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:40,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash 130187692, now seen corresponding path program 1 times [2021-10-28 09:16:40,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:40,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221178306] [2021-10-28 09:16:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:40,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:40,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:40,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:40,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:40,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:16:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:40,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:40,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:40,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221178306] [2021-10-28 09:16:40,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221178306] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:40,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:40,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:16:40,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80562493] [2021-10-28 09:16:40,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:16:40,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:40,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:16:40,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:16:40,729 INFO L87 Difference]: Start difference. First operand 474 states and 581 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:42,080 INFO L93 Difference]: Finished difference Result 504 states and 616 transitions. [2021-10-28 09:16:42,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:16:42,081 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2021-10-28 09:16:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:42,082 INFO L225 Difference]: With dead ends: 504 [2021-10-28 09:16:42,083 INFO L226 Difference]: Without dead ends: 485 [2021-10-28 09:16:42,083 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-28 09:16:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-10-28 09:16:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2021-10-28 09:16:42,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 368 states have (on average 1.2309782608695652) internal successors, (453), 375 states have internal predecessors, (453), 57 states have call successors, (57), 42 states have call predecessors, (57), 43 states have return successors, (64), 52 states have call predecessors, (64), 51 states have call successors, (64) [2021-10-28 09:16:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2021-10-28 09:16:42,091 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2021-10-28 09:16:42,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:42,091 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2021-10-28 09:16:42,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2021-10-28 09:16:42,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-28 09:16:42,093 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:42,094 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] [2021-10-28 09:16:42,094 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-10-28 09:16:42,094 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:42,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash -799923778, now seen corresponding path program 1 times [2021-10-28 09:16:42,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:42,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226607415] [2021-10-28 09:16:42,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:42,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:42,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:42,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:42,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:42,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:16:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:42,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:42,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:42,393 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226607415] [2021-10-28 09:16:42,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226607415] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:42,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:42,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:16:42,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245101383] [2021-10-28 09:16:42,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:16:42,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:42,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:16:42,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:16:42,395 INFO L87 Difference]: Start difference. First operand 469 states and 574 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:43,796 INFO L93 Difference]: Finished difference Result 499 states and 609 transitions. [2021-10-28 09:16:43,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:16:43,797 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2021-10-28 09:16:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:43,798 INFO L225 Difference]: With dead ends: 499 [2021-10-28 09:16:43,798 INFO L226 Difference]: Without dead ends: 481 [2021-10-28 09:16:43,799 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-28 09:16:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2021-10-28 09:16:43,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2021-10-28 09:16:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2301369863013698) internal successors, (449), 372 states have internal predecessors, (449), 56 states have call successors, (56), 42 states have call predecessors, (56), 43 states have return successors, (63), 51 states have call predecessors, (63), 50 states have call successors, (63) [2021-10-28 09:16:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2021-10-28 09:16:43,810 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2021-10-28 09:16:43,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:43,812 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2021-10-28 09:16:43,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2021-10-28 09:16:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-10-28 09:16:43,815 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:43,815 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] [2021-10-28 09:16:43,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-10-28 09:16:43,816 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:43,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:43,816 INFO L85 PathProgramCache]: Analyzing trace with hash -163798071, now seen corresponding path program 1 times [2021-10-28 09:16:43,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:43,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981368564] [2021-10-28 09:16:43,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:43,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:43,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:43,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:44,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:44,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-28 09:16:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:44,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:16:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:44,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:16:44,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:44,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:44,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:44,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:44,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981368564] [2021-10-28 09:16:44,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981368564] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:44,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:44,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-28 09:16:44,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696227341] [2021-10-28 09:16:44,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:16:44,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:16:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:16:44,069 INFO L87 Difference]: Start difference. First operand 465 states and 568 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-28 09:16:45,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:45,290 INFO L93 Difference]: Finished difference Result 625 states and 761 transitions. [2021-10-28 09:16:45,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-28 09:16:45,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2021-10-28 09:16:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:45,292 INFO L225 Difference]: With dead ends: 625 [2021-10-28 09:16:45,292 INFO L226 Difference]: Without dead ends: 625 [2021-10-28 09:16:45,293 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-10-28 09:16:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-10-28 09:16:45,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2021-10-28 09:16:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.220524017467249) internal successors, (559), 467 states have internal predecessors, (559), 69 states have call successors, (69), 52 states have call predecessors, (69), 58 states have return successors, (88), 67 states have call predecessors, (88), 64 states have call successors, (88) [2021-10-28 09:16:45,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2021-10-28 09:16:45,303 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 70 [2021-10-28 09:16:45,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:45,304 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2021-10-28 09:16:45,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-28 09:16:45,304 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2021-10-28 09:16:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-10-28 09:16:45,306 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:45,306 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-10-28 09:16:45,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-10-28 09:16:45,307 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:45,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:45,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1554229741, now seen corresponding path program 1 times [2021-10-28 09:16:45,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:45,308 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478279938] [2021-10-28 09:16:45,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:45,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:45,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:45,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:45,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:45,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:45,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:16:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:45,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-10-28 09:16:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:45,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:45,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478279938] [2021-10-28 09:16:45,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478279938] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:45,611 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:45,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:16:45,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708943552] [2021-10-28 09:16:45,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:16:45,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:45,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:16:45,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:16:45,613 INFO L87 Difference]: Start difference. First operand 586 states and 716 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:46,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:46,887 INFO L93 Difference]: Finished difference Result 616 states and 752 transitions. [2021-10-28 09:16:46,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:16:46,887 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2021-10-28 09:16:46,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:46,890 INFO L225 Difference]: With dead ends: 616 [2021-10-28 09:16:46,890 INFO L226 Difference]: Without dead ends: 576 [2021-10-28 09:16:46,890 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2021-10-28 09:16:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-10-28 09:16:46,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2021-10-28 09:16:46,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 437 states have (on average 1.2196796338672768) internal successors, (533), 446 states have internal predecessors, (533), 66 states have call successors, (66), 50 states have call predecessors, (66), 56 states have return successors, (85), 64 states have call predecessors, (85), 61 states have call successors, (85) [2021-10-28 09:16:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2021-10-28 09:16:46,902 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2021-10-28 09:16:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:46,903 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2021-10-28 09:16:46,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-10-28 09:16:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2021-10-28 09:16:46,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-10-28 09:16:46,905 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:46,905 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-10-28 09:16:46,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-10-28 09:16:46,906 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:46,906 INFO L85 PathProgramCache]: Analyzing trace with hash -635159596, now seen corresponding path program 1 times [2021-10-28 09:16:46,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:46,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949365889] [2021-10-28 09:16:46,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:46,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:47,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:47,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:47,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:47,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-10-28 09:16:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:47,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:16:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:47,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:16:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:47,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-10-28 09:16:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:47,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:47,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:47,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949365889] [2021-10-28 09:16:47,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949365889] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:47,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:47,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 09:16:47,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761185007] [2021-10-28 09:16:47,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 09:16:47,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:47,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 09:16:47,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:16:47,233 INFO L87 Difference]: Start difference. First operand 560 states and 684 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-28 09:16:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:48,743 INFO L93 Difference]: Finished difference Result 586 states and 715 transitions. [2021-10-28 09:16:48,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-28 09:16:48,744 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2021-10-28 09:16:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:48,745 INFO L225 Difference]: With dead ends: 586 [2021-10-28 09:16:48,745 INFO L226 Difference]: Without dead ends: 535 [2021-10-28 09:16:48,746 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-10-28 09:16:48,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-10-28 09:16:48,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2021-10-28 09:16:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 403 states have (on average 1.2133995037220844) internal successors, (489), 412 states have internal predecessors, (489), 62 states have call successors, (62), 47 states have call predecessors, (62), 53 states have return successors, (81), 60 states have call predecessors, (81), 57 states have call successors, (81) [2021-10-28 09:16:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2021-10-28 09:16:48,756 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2021-10-28 09:16:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:48,757 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2021-10-28 09:16:48,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-10-28 09:16:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2021-10-28 09:16:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-10-28 09:16:48,759 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:48,759 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] [2021-10-28 09:16:48,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-10-28 09:16:48,760 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:48,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1523992416, now seen corresponding path program 1 times [2021-10-28 09:16:48,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:48,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916645225] [2021-10-28 09:16:48,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:48,761 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:48,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:48,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:48,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:48,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-10-28 09:16:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:16:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:49,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:16:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:49,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:49,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-28 09:16:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:49,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:49,063 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916645225] [2021-10-28 09:16:49,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916645225] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:49,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:49,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:16:49,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939686953] [2021-10-28 09:16:49,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:16:49,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:49,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:16:49,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:16:49,066 INFO L87 Difference]: Start difference. First operand 519 states and 632 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-10-28 09:16:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:50,711 INFO L93 Difference]: Finished difference Result 523 states and 631 transitions. [2021-10-28 09:16:50,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 09:16:50,712 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2021-10-28 09:16:50,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:50,717 INFO L225 Difference]: With dead ends: 523 [2021-10-28 09:16:50,717 INFO L226 Difference]: Without dead ends: 523 [2021-10-28 09:16:50,718 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=461, Unknown=0, NotChecked=0, Total=650 [2021-10-28 09:16:50,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2021-10-28 09:16:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2021-10-28 09:16:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 389 states have (on average 1.2133676092544987) internal successors, (472), 397 states have internal predecessors, (472), 60 states have call successors, (60), 47 states have call predecessors, (60), 51 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2021-10-28 09:16:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2021-10-28 09:16:50,742 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2021-10-28 09:16:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:50,743 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2021-10-28 09:16:50,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 6 states have internal predecessors, (62), 4 states have call successors, (12), 10 states have call predecessors, (12), 4 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2021-10-28 09:16:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2021-10-28 09:16:50,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-28 09:16:50,751 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:50,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] [2021-10-28 09:16:50,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-10-28 09:16:50,755 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:50,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:50,756 INFO L85 PathProgramCache]: Analyzing trace with hash 100987323, now seen corresponding path program 1 times [2021-10-28 09:16:50,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:50,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837671842] [2021-10-28 09:16:50,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:50,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:50,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:50,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:50,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:50,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-28 09:16:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:16:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:51,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:16:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:51,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:51,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-10-28 09:16:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:51,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:16:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:51,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:51,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837671842] [2021-10-28 09:16:51,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837671842] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:51,093 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:51,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:16:51,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696481247] [2021-10-28 09:16:51,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:16:51,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:51,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:16:51,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:16:51,096 INFO L87 Difference]: Start difference. First operand 501 states and 602 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-28 09:16:52,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:52,075 INFO L93 Difference]: Finished difference Result 585 states and 740 transitions. [2021-10-28 09:16:52,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-28 09:16:52,075 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2021-10-28 09:16:52,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:52,078 INFO L225 Difference]: With dead ends: 585 [2021-10-28 09:16:52,078 INFO L226 Difference]: Without dead ends: 585 [2021-10-28 09:16:52,078 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-10-28 09:16:52,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2021-10-28 09:16:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2021-10-28 09:16:52,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 371 states have internal predecessors, (443), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2021-10-28 09:16:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2021-10-28 09:16:52,090 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2021-10-28 09:16:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:52,091 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2021-10-28 09:16:52,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-28 09:16:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2021-10-28 09:16:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-28 09:16:52,093 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:52,093 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] [2021-10-28 09:16:52,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-10-28 09:16:52,093 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:52,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:52,094 INFO L85 PathProgramCache]: Analyzing trace with hash 501668298, now seen corresponding path program 1 times [2021-10-28 09:16:52,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:52,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370851001] [2021-10-28 09:16:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:52,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:52,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:52,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:52,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:52,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:16:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:52,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:52,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:16:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:52,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:16:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:52,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:52,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-28 09:16:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:52,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:52,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370851001] [2021-10-28 09:16:52,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370851001] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:52,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:52,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-28 09:16:52,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795896431] [2021-10-28 09:16:52,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-28 09:16:52,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:52,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-28 09:16:52,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-28 09:16:52,496 INFO L87 Difference]: Start difference. First operand 465 states and 556 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-28 09:16:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:53,711 INFO L93 Difference]: Finished difference Result 523 states and 626 transitions. [2021-10-28 09:16:53,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 09:16:53,711 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2021-10-28 09:16:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:53,713 INFO L225 Difference]: With dead ends: 523 [2021-10-28 09:16:53,713 INFO L226 Difference]: Without dead ends: 505 [2021-10-28 09:16:53,714 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2021-10-28 09:16:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-28 09:16:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2021-10-28 09:16:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 372 states have (on average 1.2096774193548387) internal successors, (450), 378 states have internal predecessors, (450), 53 states have call successors, (53), 41 states have call predecessors, (53), 47 states have return successors, (63), 54 states have call predecessors, (63), 49 states have call successors, (63) [2021-10-28 09:16:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2021-10-28 09:16:53,724 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2021-10-28 09:16:53,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:53,724 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2021-10-28 09:16:53,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-28 09:16:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2021-10-28 09:16:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-28 09:16:53,725 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:53,725 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] [2021-10-28 09:16:53,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-10-28 09:16:53,726 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:53,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:53,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1591352246, now seen corresponding path program 1 times [2021-10-28 09:16:53,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:53,727 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269929620] [2021-10-28 09:16:53,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:53,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:53,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:53,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:53,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:53,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:16:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:53,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:54,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:16:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:54,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:16:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:54,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:54,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-10-28 09:16:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:54,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:54,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269929620] [2021-10-28 09:16:54,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269929620] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:54,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:54,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-28 09:16:54,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88845052] [2021-10-28 09:16:54,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-28 09:16:54,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:54,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-28 09:16:54,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-28 09:16:54,054 INFO L87 Difference]: Start difference. First operand 473 states and 566 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-28 09:16:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:55,079 INFO L93 Difference]: Finished difference Result 523 states and 625 transitions. [2021-10-28 09:16:55,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-28 09:16:55,079 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2021-10-28 09:16:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:55,081 INFO L225 Difference]: With dead ends: 523 [2021-10-28 09:16:55,081 INFO L226 Difference]: Without dead ends: 505 [2021-10-28 09:16:55,082 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2021-10-28 09:16:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-10-28 09:16:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2021-10-28 09:16:55,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.210958904109589) internal successors, (442), 371 states have internal predecessors, (442), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2021-10-28 09:16:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2021-10-28 09:16:55,088 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2021-10-28 09:16:55,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:55,089 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2021-10-28 09:16:55,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-10-28 09:16:55,089 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2021-10-28 09:16:55,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-10-28 09:16:55,091 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:55,091 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-10-28 09:16:55,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-10-28 09:16:55,091 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:55,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:55,091 INFO L85 PathProgramCache]: Analyzing trace with hash 590529597, now seen corresponding path program 1 times [2021-10-28 09:16:55,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:55,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141369195] [2021-10-28 09:16:55,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:55,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:55,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:55,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:55,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:55,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:16:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:55,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-28 09:16:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:55,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:16:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:55,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-10-28 09:16:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:55,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-10-28 09:16:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:55,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:55,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141369195] [2021-10-28 09:16:55,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141369195] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:55,385 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:55,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-28 09:16:55,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852438230] [2021-10-28 09:16:55,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-28 09:16:55,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:55,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-28 09:16:55,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-10-28 09:16:55,386 INFO L87 Difference]: Start difference. First operand 465 states and 555 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-10-28 09:16:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:56,753 INFO L93 Difference]: Finished difference Result 611 states and 714 transitions. [2021-10-28 09:16:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:16:56,753 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2021-10-28 09:16:56,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:56,754 INFO L225 Difference]: With dead ends: 611 [2021-10-28 09:16:56,754 INFO L226 Difference]: Without dead ends: 611 [2021-10-28 09:16:56,755 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-10-28 09:16:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2021-10-28 09:16:56,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 586. [2021-10-28 09:16:56,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 462 states have (on average 1.2034632034632036) internal successors, (556), 470 states have internal predecessors, (556), 61 states have call successors, (61), 53 states have call predecessors, (61), 62 states have return successors, (72), 63 states have call predecessors, (72), 57 states have call successors, (72) [2021-10-28 09:16:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 689 transitions. [2021-10-28 09:16:56,762 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 689 transitions. Word has length 92 [2021-10-28 09:16:56,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:56,763 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 689 transitions. [2021-10-28 09:16:56,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-10-28 09:16:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 689 transitions. [2021-10-28 09:16:56,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-10-28 09:16:56,765 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:56,765 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-10-28 09:16:56,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-10-28 09:16:56,765 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:56,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:56,766 INFO L85 PathProgramCache]: Analyzing trace with hash -605677229, now seen corresponding path program 1 times [2021-10-28 09:16:56,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:56,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032304098] [2021-10-28 09:16:56,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:56,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:56,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:56,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:56,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:56,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:16:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:57,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-10-28 09:16:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:57,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:16:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:57,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-10-28 09:16:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:57,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-28 09:16:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:57,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:57,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032304098] [2021-10-28 09:16:57,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032304098] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:57,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:57,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-10-28 09:16:57,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585372183] [2021-10-28 09:16:57,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-28 09:16:57,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:57,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-28 09:16:57,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2021-10-28 09:16:57,111 INFO L87 Difference]: Start difference. First operand 586 states and 689 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-10-28 09:16:58,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:58,228 INFO L93 Difference]: Finished difference Result 587 states and 689 transitions. [2021-10-28 09:16:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-28 09:16:58,228 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 93 [2021-10-28 09:16:58,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:58,230 INFO L225 Difference]: With dead ends: 587 [2021-10-28 09:16:58,230 INFO L226 Difference]: Without dead ends: 498 [2021-10-28 09:16:58,231 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2021-10-28 09:16:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2021-10-28 09:16:58,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2021-10-28 09:16:58,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.20671834625323) internal successors, (467), 394 states have internal predecessors, (467), 54 states have call successors, (54), 47 states have call predecessors, (54), 54 states have return successors, (64), 55 states have call predecessors, (64), 51 states have call successors, (64) [2021-10-28 09:16:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 585 transitions. [2021-10-28 09:16:58,240 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 585 transitions. Word has length 93 [2021-10-28 09:16:58,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:58,240 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 585 transitions. [2021-10-28 09:16:58,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2021-10-28 09:16:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 585 transitions. [2021-10-28 09:16:58,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-28 09:16:58,242 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:58,243 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] [2021-10-28 09:16:58,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-10-28 09:16:58,243 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:58,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash 612741088, now seen corresponding path program 1 times [2021-10-28 09:16:58,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:58,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692199648] [2021-10-28 09:16:58,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:58,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:58,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:58,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:58,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:58,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:16:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:58,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:58,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:16:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:58,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:16:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:58,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-10-28 09:16:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:58,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-10-28 09:16:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:58,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:58,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692199648] [2021-10-28 09:16:58,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692199648] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:58,554 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:58,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:16:58,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828754450] [2021-10-28 09:16:58,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:16:58,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:58,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:16:58,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:16:58,558 INFO L87 Difference]: Start difference. First operand 496 states and 585 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-28 09:16:59,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:16:59,256 INFO L93 Difference]: Finished difference Result 494 states and 580 transitions. [2021-10-28 09:16:59,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-28 09:16:59,257 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2021-10-28 09:16:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:16:59,259 INFO L225 Difference]: With dead ends: 494 [2021-10-28 09:16:59,259 INFO L226 Difference]: Without dead ends: 492 [2021-10-28 09:16:59,259 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-10-28 09:16:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2021-10-28 09:16:59,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 439. [2021-10-28 09:16:59,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 343 states have (on average 1.19533527696793) internal successors, (410), 349 states have internal predecessors, (410), 47 states have call successors, (47), 42 states have call predecessors, (47), 48 states have return successors, (55), 48 states have call predecessors, (55), 44 states have call successors, (55) [2021-10-28 09:16:59,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 512 transitions. [2021-10-28 09:16:59,267 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 512 transitions. Word has length 99 [2021-10-28 09:16:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:16:59,267 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 512 transitions. [2021-10-28 09:16:59,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-28 09:16:59,268 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 512 transitions. [2021-10-28 09:16:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-28 09:16:59,269 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:16:59,269 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] [2021-10-28 09:16:59,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-28 09:16:59,270 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:16:59,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:16:59,270 INFO L85 PathProgramCache]: Analyzing trace with hash -78015673, now seen corresponding path program 1 times [2021-10-28 09:16:59,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:16:59,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135532187] [2021-10-28 09:16:59,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:16:59,271 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:16:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:16:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:59,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:16:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:59,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:16:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:59,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:16:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:59,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:16:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:59,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:16:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:59,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:16:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:59,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-10-28 09:16:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:59,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-10-28 09:16:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:16:59,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:16:59,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:16:59,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135532187] [2021-10-28 09:16:59,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135532187] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:16:59,586 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:16:59,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 09:16:59,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145449555] [2021-10-28 09:16:59,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 09:16:59,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:16:59,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 09:16:59,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:16:59,587 INFO L87 Difference]: Start difference. First operand 439 states and 512 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-10-28 09:17:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:00,816 INFO L93 Difference]: Finished difference Result 839 states and 983 transitions. [2021-10-28 09:17:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-28 09:17:00,817 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2021-10-28 09:17:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:00,819 INFO L225 Difference]: With dead ends: 839 [2021-10-28 09:17:00,819 INFO L226 Difference]: Without dead ends: 797 [2021-10-28 09:17:00,820 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2021-10-28 09:17:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-10-28 09:17:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 419. [2021-10-28 09:17:00,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 327 states have (on average 1.1957186544342508) internal successors, (391), 332 states have internal predecessors, (391), 44 states have call successors, (44), 41 states have call predecessors, (44), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2021-10-28 09:17:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 487 transitions. [2021-10-28 09:17:00,830 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 487 transitions. Word has length 99 [2021-10-28 09:17:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:00,830 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 487 transitions. [2021-10-28 09:17:00,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2021-10-28 09:17:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 487 transitions. [2021-10-28 09:17:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-28 09:17:00,832 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:17:00,833 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] [2021-10-28 09:17:00,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-10-28 09:17:00,833 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:17:00,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:17:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1954562899, now seen corresponding path program 1 times [2021-10-28 09:17:00,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:17:00,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114523360] [2021-10-28 09:17:00,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:17:00,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:17:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:00,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:17:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:00,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:17:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:01,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:17:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:01,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:17:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:01,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-28 09:17:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:01,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:17:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:01,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:01,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:01,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:01,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-28 09:17:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:01,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:01,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-10-28 09:17:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:17:01,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:17:01,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114523360] [2021-10-28 09:17:01,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114523360] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:17:01,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:17:01,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-10-28 09:17:01,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338272363] [2021-10-28 09:17:01,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-28 09:17:01,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:17:01,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-28 09:17:01,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-10-28 09:17:01,231 INFO L87 Difference]: Start difference. First operand 419 states and 487 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2021-10-28 09:17:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:01,894 INFO L93 Difference]: Finished difference Result 464 states and 541 transitions. [2021-10-28 09:17:01,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-28 09:17:01,895 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2021-10-28 09:17:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:01,896 INFO L225 Difference]: With dead ends: 464 [2021-10-28 09:17:01,896 INFO L226 Difference]: Without dead ends: 438 [2021-10-28 09:17:01,897 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2021-10-28 09:17:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-10-28 09:17:01,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 428. [2021-10-28 09:17:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.182089552238806) internal successors, (396), 341 states have internal predecessors, (396), 45 states have call successors, (45), 41 states have call predecessors, (45), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2021-10-28 09:17:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 493 transitions. [2021-10-28 09:17:01,903 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 493 transitions. Word has length 104 [2021-10-28 09:17:01,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:01,904 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 493 transitions. [2021-10-28 09:17:01,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2021-10-28 09:17:01,904 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 493 transitions. [2021-10-28 09:17:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-10-28 09:17:01,905 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:17:01,906 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-28 09:17:01,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-10-28 09:17:01,906 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:17:01,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:17:01,907 INFO L85 PathProgramCache]: Analyzing trace with hash 260351279, now seen corresponding path program 1 times [2021-10-28 09:17:01,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:17:01,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751439875] [2021-10-28 09:17:01,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:17:01,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:17:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:17:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:17:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:17:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-28 09:17:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-10-28 09:17:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:17:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-28 09:17:02,217 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:17:02,217 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751439875] [2021-10-28 09:17:02,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751439875] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:17:02,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:17:02,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-10-28 09:17:02,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074045298] [2021-10-28 09:17:02,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 09:17:02,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:17:02,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 09:17:02,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-10-28 09:17:02,219 INFO L87 Difference]: Start difference. First operand 428 states and 493 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-28 09:17:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:02,950 INFO L93 Difference]: Finished difference Result 440 states and 505 transitions. [2021-10-28 09:17:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:17:02,950 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2021-10-28 09:17:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:02,952 INFO L225 Difference]: With dead ends: 440 [2021-10-28 09:17:02,952 INFO L226 Difference]: Without dead ends: 440 [2021-10-28 09:17:02,953 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2021-10-28 09:17:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-10-28 09:17:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 436. [2021-10-28 09:17:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 341 states have (on average 1.1788856304985338) internal successors, (402), 347 states have internal predecessors, (402), 45 states have call successors, (45), 41 states have call predecessors, (45), 49 states have return successors, (54), 47 states have call predecessors, (54), 41 states have call successors, (54) [2021-10-28 09:17:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 501 transitions. [2021-10-28 09:17:02,961 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 501 transitions. Word has length 113 [2021-10-28 09:17:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:02,961 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 501 transitions. [2021-10-28 09:17:02,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-10-28 09:17:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 501 transitions. [2021-10-28 09:17:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-10-28 09:17:02,963 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:17:02,964 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-28 09:17:02,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-10-28 09:17:02,964 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:17:02,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:17:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1796786958, now seen corresponding path program 1 times [2021-10-28 09:17:02,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:17:02,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281521755] [2021-10-28 09:17:02,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:17:02,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:17:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:17:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:17:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:17:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-10-28 09:17:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-10-28 09:17:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:17:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:03,303 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-28 09:17:03,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:17:03,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281521755] [2021-10-28 09:17:03,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281521755] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:17:03,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:17:03,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-10-28 09:17:03,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777884660] [2021-10-28 09:17:03,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-28 09:17:03,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:17:03,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-28 09:17:03,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:17:03,308 INFO L87 Difference]: Start difference. First operand 436 states and 501 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2021-10-28 09:17:03,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:03,954 INFO L93 Difference]: Finished difference Result 387 states and 434 transitions. [2021-10-28 09:17:03,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-28 09:17:03,954 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) Word has length 113 [2021-10-28 09:17:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:03,955 INFO L225 Difference]: With dead ends: 387 [2021-10-28 09:17:03,955 INFO L226 Difference]: Without dead ends: 387 [2021-10-28 09:17:03,955 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-10-28 09:17:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2021-10-28 09:17:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 249. [2021-10-28 09:17:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 195 states have (on average 1.1384615384615384) internal successors, (222), 197 states have internal predecessors, (222), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2021-10-28 09:17:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 275 transitions. [2021-10-28 09:17:03,959 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 275 transitions. Word has length 113 [2021-10-28 09:17:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:03,960 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 275 transitions. [2021-10-28 09:17:03,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2021-10-28 09:17:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 275 transitions. [2021-10-28 09:17:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-10-28 09:17:03,961 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:17:03,961 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, 1] [2021-10-28 09:17:03,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-10-28 09:17:03,961 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:17:03,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:17:03,962 INFO L85 PathProgramCache]: Analyzing trace with hash 960404334, now seen corresponding path program 1 times [2021-10-28 09:17:03,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:17:03,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105732969] [2021-10-28 09:17:03,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:17:03,962 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:17:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:17:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:17:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:17:04,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:17:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-28 09:17:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:17:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-28 09:17:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-10-28 09:17:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-28 09:17:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:17:04,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:17:04,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105732969] [2021-10-28 09:17:04,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105732969] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:17:04,294 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:17:04,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 09:17:04,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061414563] [2021-10-28 09:17:04,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 09:17:04,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:17:04,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 09:17:04,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:17:04,296 INFO L87 Difference]: Start difference. First operand 249 states and 275 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-28 09:17:05,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:05,126 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2021-10-28 09:17:05,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:17:05,127 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2021-10-28 09:17:05,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:05,128 INFO L225 Difference]: With dead ends: 263 [2021-10-28 09:17:05,128 INFO L226 Difference]: Without dead ends: 263 [2021-10-28 09:17:05,128 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2021-10-28 09:17:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-10-28 09:17:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 253. [2021-10-28 09:17:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 198 states have (on average 1.1363636363636365) internal successors, (225), 200 states have internal predecessors, (225), 26 states have call successors, (26), 26 states have call predecessors, (26), 28 states have return successors, (28), 26 states have call predecessors, (28), 24 states have call successors, (28) [2021-10-28 09:17:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 279 transitions. [2021-10-28 09:17:05,134 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 279 transitions. Word has length 120 [2021-10-28 09:17:05,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:05,134 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 279 transitions. [2021-10-28 09:17:05,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-28 09:17:05,134 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 279 transitions. [2021-10-28 09:17:05,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-10-28 09:17:05,136 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:17:05,136 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, 1] [2021-10-28 09:17:05,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-10-28 09:17:05,136 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:17:05,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:17:05,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1141890831, now seen corresponding path program 1 times [2021-10-28 09:17:05,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:17:05,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083392710] [2021-10-28 09:17:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:17:05,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:17:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:17:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:17:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:17:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:17:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-28 09:17:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:17:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-28 09:17:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-10-28 09:17:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-10-28 09:17:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:17:05,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:17:05,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083392710] [2021-10-28 09:17:05,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083392710] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:17:05,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:17:05,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 09:17:05,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695714355] [2021-10-28 09:17:05,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 09:17:05,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:17:05,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 09:17:05,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:17:05,514 INFO L87 Difference]: Start difference. First operand 253 states and 279 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-28 09:17:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:06,117 INFO L93 Difference]: Finished difference Result 263 states and 289 transitions. [2021-10-28 09:17:06,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:17:06,117 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2021-10-28 09:17:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:06,118 INFO L225 Difference]: With dead ends: 263 [2021-10-28 09:17:06,118 INFO L226 Difference]: Without dead ends: 254 [2021-10-28 09:17:06,119 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-10-28 09:17:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-10-28 09:17:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2021-10-28 09:17:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2021-10-28 09:17:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2021-10-28 09:17:06,124 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 120 [2021-10-28 09:17:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:06,125 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2021-10-28 09:17:06,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2021-10-28 09:17:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2021-10-28 09:17:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-10-28 09:17:06,127 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:17:06,127 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:17:06,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-10-28 09:17:06,127 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:17:06,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:17:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1073285628, now seen corresponding path program 1 times [2021-10-28 09:17:06,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:17:06,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777163393] [2021-10-28 09:17:06,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:17:06,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:17:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:17:06,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:17:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:17:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:17:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-28 09:17:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:17:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-28 09:17:06,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:17:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-10-28 09:17:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-10-28 09:17:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-28 09:17:06,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:17:06,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777163393] [2021-10-28 09:17:06,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777163393] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:17:06,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:17:06,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-28 09:17:06,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257852784] [2021-10-28 09:17:06,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-28 09:17:06,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:17:06,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-28 09:17:06,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2021-10-28 09:17:06,726 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-28 09:17:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:07,718 INFO L93 Difference]: Finished difference Result 317 states and 357 transitions. [2021-10-28 09:17:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-28 09:17:07,719 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 150 [2021-10-28 09:17:07,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:07,719 INFO L225 Difference]: With dead ends: 317 [2021-10-28 09:17:07,719 INFO L226 Difference]: Without dead ends: 285 [2021-10-28 09:17:07,719 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2021-10-28 09:17:07,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-10-28 09:17:07,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 265. [2021-10-28 09:17:07,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.138755980861244) internal successors, (238), 211 states have internal predecessors, (238), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2021-10-28 09:17:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 293 transitions. [2021-10-28 09:17:07,722 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 293 transitions. Word has length 150 [2021-10-28 09:17:07,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:07,723 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 293 transitions. [2021-10-28 09:17:07,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-28 09:17:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 293 transitions. [2021-10-28 09:17:07,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-10-28 09:17:07,724 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:17:07,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-28 09:17:07,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-10-28 09:17:07,725 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:17:07,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:17:07,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1690329856, now seen corresponding path program 1 times [2021-10-28 09:17:07,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:17:07,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099054770] [2021-10-28 09:17:07,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:17:07,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:17:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:17:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:07,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:17:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:07,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:17:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:07,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:17:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:07,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-28 09:17:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:17:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-28 09:17:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:17:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:08,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-10-28 09:17:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-10-28 09:17:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-28 09:17:08,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:17:08,257 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099054770] [2021-10-28 09:17:08,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099054770] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:17:08,258 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:17:08,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2021-10-28 09:17:08,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627494678] [2021-10-28 09:17:08,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-10-28 09:17:08,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:17:08,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-10-28 09:17:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2021-10-28 09:17:08,260 INFO L87 Difference]: Start difference. First operand 265 states and 293 transitions. Second operand has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-28 09:17:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:09,100 INFO L93 Difference]: Finished difference Result 284 states and 314 transitions. [2021-10-28 09:17:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-28 09:17:09,101 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 151 [2021-10-28 09:17:09,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:09,101 INFO L225 Difference]: With dead ends: 284 [2021-10-28 09:17:09,101 INFO L226 Difference]: Without dead ends: 279 [2021-10-28 09:17:09,102 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2021-10-28 09:17:09,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-10-28 09:17:09,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 265. [2021-10-28 09:17:09,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.1339712918660287) internal successors, (237), 211 states have internal predecessors, (237), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2021-10-28 09:17:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions. [2021-10-28 09:17:09,104 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 151 [2021-10-28 09:17:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:09,105 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions. [2021-10-28 09:17:09,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.291666666666667) internal successors, (103), 10 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2021-10-28 09:17:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions. [2021-10-28 09:17:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-10-28 09:17:09,106 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:17:09,107 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:17:09,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-10-28 09:17:09,107 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:17:09,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:17:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash -206728514, now seen corresponding path program 1 times [2021-10-28 09:17:09,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:17:09,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230030868] [2021-10-28 09:17:09,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:17:09,109 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:17:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:17:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:17:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:17:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:17:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-28 09:17:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:17:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-28 09:17:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:17:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2021-10-28 09:17:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-10-28 09:17:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2021-10-28 09:17:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-28 09:17:09,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:17:09,645 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230030868] [2021-10-28 09:17:09,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230030868] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:17:09,646 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:17:09,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-10-28 09:17:09,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838700672] [2021-10-28 09:17:09,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-10-28 09:17:09,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:17:09,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-28 09:17:09,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2021-10-28 09:17:09,647 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-28 09:17:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:10,598 INFO L93 Difference]: Finished difference Result 303 states and 337 transitions. [2021-10-28 09:17:10,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-28 09:17:10,599 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 153 [2021-10-28 09:17:10,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:10,599 INFO L225 Difference]: With dead ends: 303 [2021-10-28 09:17:10,600 INFO L226 Difference]: Without dead ends: 265 [2021-10-28 09:17:10,600 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2021-10-28 09:17:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-10-28 09:17:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2021-10-28 09:17:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 205 states have (on average 1.1219512195121952) internal successors, (230), 207 states have internal predecessors, (230), 25 states have call successors, (25), 25 states have call predecessors, (25), 28 states have return successors, (28), 26 states have call predecessors, (28), 23 states have call successors, (28) [2021-10-28 09:17:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 283 transitions. [2021-10-28 09:17:10,603 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 283 transitions. Word has length 153 [2021-10-28 09:17:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:10,603 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 283 transitions. [2021-10-28 09:17:10,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-28 09:17:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 283 transitions. [2021-10-28 09:17:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-28 09:17:10,604 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:17:10,604 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:17:10,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-10-28 09:17:10,605 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:17:10,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:17:10,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1217289252, now seen corresponding path program 1 times [2021-10-28 09:17:10,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:17:10,606 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202346294] [2021-10-28 09:17:10,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:17:10,606 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:17:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:10,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:17:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:10,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:17:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:10,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:17:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:10,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:17:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:10,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-28 09:17:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:10,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:17:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:10,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:10,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:10,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:10,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-28 09:17:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:10,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:10,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:17:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-10-28 09:17:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-10-28 09:17:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-10-28 09:17:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-28 09:17:11,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:17:11,022 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202346294] [2021-10-28 09:17:11,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202346294] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:17:11,023 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:17:11,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-10-28 09:17:11,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716432243] [2021-10-28 09:17:11,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-10-28 09:17:11,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:17:11,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-28 09:17:11,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-10-28 09:17:11,026 INFO L87 Difference]: Start difference. First operand 259 states and 283 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-10-28 09:17:11,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:11,512 INFO L93 Difference]: Finished difference Result 256 states and 277 transitions. [2021-10-28 09:17:11,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:17:11,512 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 158 [2021-10-28 09:17:11,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:11,513 INFO L225 Difference]: With dead ends: 256 [2021-10-28 09:17:11,513 INFO L226 Difference]: Without dead ends: 245 [2021-10-28 09:17:11,516 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2021-10-28 09:17:11,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-10-28 09:17:11,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231. [2021-10-28 09:17:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 183 states have internal predecessors, (200), 24 states have call successors, (24), 24 states have call predecessors, (24), 25 states have return successors, (25), 23 states have call predecessors, (25), 22 states have call successors, (25) [2021-10-28 09:17:11,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2021-10-28 09:17:11,523 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 158 [2021-10-28 09:17:11,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:11,523 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2021-10-28 09:17:11,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2021-10-28 09:17:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2021-10-28 09:17:11,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-28 09:17:11,525 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:17:11,525 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:17:11,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-10-28 09:17:11,526 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:17:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:17:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1524054683, now seen corresponding path program 1 times [2021-10-28 09:17:11,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:17:11,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121891402] [2021-10-28 09:17:11,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:17:11,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:17:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:17:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:17:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:17:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:17:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-28 09:17:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:17:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-28 09:17:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:17:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2021-10-28 09:17:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-10-28 09:17:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-28 09:17:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-28 09:17:11,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:17:11,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121891402] [2021-10-28 09:17:11,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121891402] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:17:11,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:17:11,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-10-28 09:17:11,960 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662660644] [2021-10-28 09:17:11,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-10-28 09:17:11,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:17:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-10-28 09:17:11,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-10-28 09:17:11,961 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-28 09:17:12,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:12,380 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2021-10-28 09:17:12,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:17:12,381 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2021-10-28 09:17:12,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:12,382 INFO L225 Difference]: With dead ends: 220 [2021-10-28 09:17:12,382 INFO L226 Difference]: Without dead ends: 210 [2021-10-28 09:17:12,382 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2021-10-28 09:17:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-28 09:17:12,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2021-10-28 09:17:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0920245398773005) internal successors, (178), 164 states have internal predecessors, (178), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2021-10-28 09:17:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 224 transitions. [2021-10-28 09:17:12,385 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 224 transitions. Word has length 160 [2021-10-28 09:17:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:12,385 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 224 transitions. [2021-10-28 09:17:12,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2021-10-28 09:17:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 224 transitions. [2021-10-28 09:17:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-10-28 09:17:12,387 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:17:12,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-28 09:17:12,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-10-28 09:17:12,387 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:17:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:17:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1861413762, now seen corresponding path program 1 times [2021-10-28 09:17:12,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:17:12,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756086783] [2021-10-28 09:17:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:17:12,389 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:17:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:17:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:17:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:17:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:17:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-28 09:17:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:17:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-28 09:17:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:17:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-10-28 09:17:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-10-28 09:17:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-10-28 09:17:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-28 09:17:12,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:17:12,914 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756086783] [2021-10-28 09:17:12,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756086783] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:17:12,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:17:12,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-10-28 09:17:12,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190781133] [2021-10-28 09:17:12,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-28 09:17:12,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:17:12,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-28 09:17:12,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2021-10-28 09:17:12,917 INFO L87 Difference]: Start difference. First operand 210 states and 224 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-28 09:17:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:14,436 INFO L93 Difference]: Finished difference Result 355 states and 377 transitions. [2021-10-28 09:17:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-10-28 09:17:14,437 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2021-10-28 09:17:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:14,437 INFO L225 Difference]: With dead ends: 355 [2021-10-28 09:17:14,438 INFO L226 Difference]: Without dead ends: 213 [2021-10-28 09:17:14,438 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2021-10-28 09:17:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-28 09:17:14,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2021-10-28 09:17:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0858895705521472) internal successors, (177), 164 states have internal predecessors, (177), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2021-10-28 09:17:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2021-10-28 09:17:14,442 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 161 [2021-10-28 09:17:14,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:14,442 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2021-10-28 09:17:14,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-28 09:17:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2021-10-28 09:17:14,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-10-28 09:17:14,443 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:17:14,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-28 09:17:14,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-10-28 09:17:14,444 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-10-28 09:17:14,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:17:14,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1510386108, now seen corresponding path program 1 times [2021-10-28 09:17:14,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:17:14,445 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620626493] [2021-10-28 09:17:14,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:17:14,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:17:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-10-28 09:17:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-10-28 09:17:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-10-28 09:17:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-10-28 09:17:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-10-28 09:17:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-10-28 09:17:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-10-28 09:17:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-28 09:17:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-28 09:17:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-10-28 09:17:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:14,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-10-28 09:17:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:15,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-10-28 09:17:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:15,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-10-28 09:17:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:15,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-10-28 09:17:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:17:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-28 09:17:15,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:17:15,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620626493] [2021-10-28 09:17:15,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620626493] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:17:15,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:17:15,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-10-28 09:17:15,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422405089] [2021-10-28 09:17:15,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-10-28 09:17:15,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:17:15,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-10-28 09:17:15,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2021-10-28 09:17:15,031 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-28 09:17:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:17:16,172 INFO L93 Difference]: Finished difference Result 210 states and 224 transitions. [2021-10-28 09:17:16,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-10-28 09:17:16,172 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2021-10-28 09:17:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:17:16,173 INFO L225 Difference]: With dead ends: 210 [2021-10-28 09:17:16,173 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 09:17:16,173 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2021-10-28 09:17:16,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 09:17:16,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 09:17:16,174 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-10-28 09:17:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 09:17:16,174 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2021-10-28 09:17:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:17:16,174 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 09:17:16,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2021-10-28 09:17:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 09:17:16,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 09:17:16,177 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-10-28 09:17:16,177 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-10-28 09:17:16,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-10-28 09:17:16,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:17:16,183 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:17:16,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:17:16 BoogieIcfgContainer [2021-10-28 09:17:16,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:17:16,186 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:17:16,186 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:17:16,186 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:17:16,187 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:15:20" (3/4) ... [2021-10-28 09:17:16,191 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 09:17:16,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-10-28 09:17:16,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2021-10-28 09:17:16,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2021-10-28 09:17:16,202 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2021-10-28 09:17:16,202 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2021-10-28 09:17:16,202 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2021-10-28 09:17:16,202 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-10-28 09:17:16,202 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2021-10-28 09:17:16,202 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-10-28 09:17:16,202 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2021-10-28 09:17:16,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-10-28 09:17:16,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-10-28 09:17:16,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2021-10-28 09:17:16,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2021-10-28 09:17:16,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2021-10-28 09:17:16,203 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2021-10-28 09:17:16,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2021-10-28 09:17:16,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2021-10-28 09:17:16,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-10-28 09:17:16,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2021-10-28 09:17:16,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-10-28 09:17:16,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2021-10-28 09:17:16,204 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2021-10-28 09:17:16,205 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-10-28 09:17:16,205 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2021-10-28 09:17:16,205 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2021-10-28 09:17:16,205 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2021-10-28 09:17:16,206 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2021-10-28 09:17:16,206 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2021-10-28 09:17:16,206 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2021-10-28 09:17:16,236 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 86 nodes and edges [2021-10-28 09:17:16,240 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2021-10-28 09:17:16,243 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-28 09:17:16,246 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-28 09:17:16,413 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:17:16,414 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:17:16,415 INFO L168 Benchmark]: Toolchain (without parser) took 118088.50 ms. Allocated memory was 86.0 MB in the beginning and 318.8 MB in the end (delta: 232.8 MB). Free memory was 50.5 MB in the beginning and 279.9 MB in the end (delta: -229.4 MB). Peak memory consumption was 183.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:17:16,415 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 86.0 MB. Free memory was 58.7 MB in the beginning and 58.7 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:17:16,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 669.91 ms. Allocated memory was 86.0 MB in the beginning and 113.2 MB in the end (delta: 27.3 MB). Free memory was 50.2 MB in the beginning and 76.4 MB in the end (delta: -26.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:17:16,416 INFO L168 Benchmark]: Boogie Preprocessor took 137.23 ms. Allocated memory is still 113.2 MB. Free memory was 76.4 MB in the beginning and 72.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 09:17:16,417 INFO L168 Benchmark]: RCFGBuilder took 1543.91 ms. Allocated memory is still 113.2 MB. Free memory was 72.2 MB in the beginning and 69.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 41.3 MB. Max. memory is 16.1 GB. [2021-10-28 09:17:16,417 INFO L168 Benchmark]: TraceAbstraction took 115498.76 ms. Allocated memory was 113.2 MB in the beginning and 318.8 MB in the end (delta: 205.5 MB). Free memory was 69.5 MB in the beginning and 119.9 MB in the end (delta: -50.4 MB). Peak memory consumption was 156.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:17:16,417 INFO L168 Benchmark]: Witness Printer took 227.79 ms. Allocated memory is still 318.8 MB. Free memory was 119.9 MB in the beginning and 279.9 MB in the end (delta: -160.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. [2021-10-28 09:17:16,419 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.30 ms. Allocated memory is still 86.0 MB. Free memory was 58.7 MB in the beginning and 58.7 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 669.91 ms. Allocated memory was 86.0 MB in the beginning and 113.2 MB in the end (delta: 27.3 MB). Free memory was 50.2 MB in the beginning and 76.4 MB in the end (delta: -26.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 137.23 ms. Allocated memory is still 113.2 MB. Free memory was 76.4 MB in the beginning and 72.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1543.91 ms. Allocated memory is still 113.2 MB. Free memory was 72.2 MB in the beginning and 69.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 41.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 115498.76 ms. Allocated memory was 113.2 MB in the beginning and 318.8 MB in the end (delta: 205.5 MB). Free memory was 69.5 MB in the beginning and 119.9 MB in the end (delta: -50.4 MB). Peak memory consumption was 156.4 MB. Max. memory is 16.1 GB. * Witness Printer took 227.79 ms. Allocated memory is still 318.8 MB. Free memory was 119.9 MB in the beginning and 279.9 MB in the end (delta: -160.0 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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: 667]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1627]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 31 procedures, 396 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 115.4s, OverallIterations: 67, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 92.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 24799 SDtfs, 35964 SDslu, 53376 SDs, 0 SdLazy, 91602 SolverSat, 11213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 65.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1881 GetRequests, 847 SyntacticMatches, 0 SemanticMatches, 1034 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3103 ImplicationChecksByTransitivity, 23.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=932occurred in iteration=20, InterpolantAutomatonStates: 863, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 67 MinimizatonAttempts, 3040 StatesRemovedByMinimization, 65 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 19.6s InterpolantComputationTime, 4766 NumberOfCodeBlocks, 4766 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 4699 ConstructedInterpolants, 0 QuantifiedInterpolants, 21826 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 67 PerfectInterpolantSequences, 229/229 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-28 09:17:16,465 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78caf3dd-4515-4882-9b1f-6364aa2ee593/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...