./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c12b3d893de05137a4e7e0aa006fe67a43cc9e3d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 07:47:15,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 07:47:15,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 07:47:15,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 07:47:15,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 07:47:15,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 07:47:15,943 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 07:47:15,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 07:47:15,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 07:47:15,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 07:47:15,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 07:47:15,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 07:47:15,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 07:47:15,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 07:47:15,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 07:47:15,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 07:47:15,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 07:47:15,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 07:47:15,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 07:47:15,976 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 07:47:15,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 07:47:15,978 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 07:47:15,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 07:47:15,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 07:47:15,986 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 07:47:15,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 07:47:15,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 07:47:15,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 07:47:15,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 07:47:15,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 07:47:15,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 07:47:15,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 07:47:15,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 07:47:15,993 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 07:47:15,994 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 07:47:15,994 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 07:47:15,995 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 07:47:15,995 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 07:47:15,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 07:47:15,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 07:47:15,998 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 07:47:15,999 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-08-27 07:47:16,034 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 07:47:16,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 07:47:16,035 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 07:47:16,036 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 07:47:16,037 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 07:47:16,037 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 07:47:16,038 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 07:47:16,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 07:47:16,038 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 07:47:16,038 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 07:47:16,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 07:47:16,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 07:47:16,039 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 07:47:16,040 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-08-27 07:47:16,040 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-08-27 07:47:16,040 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-08-27 07:47:16,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 07:47:16,040 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-08-27 07:47:16,041 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 07:47:16,041 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 07:47:16,041 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 07:47:16,041 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 07:47:16,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 07:47:16,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:47:16,042 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 07:47:16,042 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 07:47:16,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 07:47:16,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 07:47:16,042 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 07:47:16,043 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c12b3d893de05137a4e7e0aa006fe67a43cc9e3d [2021-08-27 07:47:16,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 07:47:16,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 07:47:16,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 07:47:16,386 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 07:47:16,386 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 07:47:16,387 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2021-08-27 07:47:16,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3384eb23/aae8f1846e844621b6eef0a5d0d604ff/FLAGfce797e7f [2021-08-27 07:47:16,972 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 07:47:16,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2021-08-27 07:47:16,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3384eb23/aae8f1846e844621b6eef0a5d0d604ff/FLAGfce797e7f [2021-08-27 07:47:17,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3384eb23/aae8f1846e844621b6eef0a5d0d604ff [2021-08-27 07:47:17,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 07:47:17,257 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-27 07:47:17,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 07:47:17,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 07:47:17,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 07:47:17,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:47:17" (1/1) ... [2021-08-27 07:47:17,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8a67e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:17, skipping insertion in model container [2021-08-27 07:47:17,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 07:47:17" (1/1) ... [2021-08-27 07:47:17,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 07:47:17,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 07:47:17,481 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c[2073,2086] [2021-08-27 07:47:17,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:47:17,714 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 07:47:17,724 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-2.c[2073,2086] [2021-08-27 07:47:17,819 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 07:47:17,831 INFO L208 MainTranslator]: Completed translation [2021-08-27 07:47:17,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:17 WrapperNode [2021-08-27 07:47:17,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 07:47:17,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 07:47:17,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 07:47:17,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 07:47:17,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:17" (1/1) ... [2021-08-27 07:47:17,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:17" (1/1) ... [2021-08-27 07:47:17,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:17" (1/1) ... [2021-08-27 07:47:17,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:17" (1/1) ... [2021-08-27 07:47:17,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:17" (1/1) ... [2021-08-27 07:47:17,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:17" (1/1) ... [2021-08-27 07:47:17,930 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:17" (1/1) ... [2021-08-27 07:47:17,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 07:47:17,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 07:47:17,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 07:47:17,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 07:47:17,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:17" (1/1) ... [2021-08-27 07:47:17,971 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 07:47:17,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:47:17,990 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 07:47:18,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 07:47:18,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-08-27 07:47:18,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 07:47:18,034 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-08-27 07:47:18,035 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-08-27 07:47:18,035 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2021-08-27 07:47:18,035 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2021-08-27 07:47:18,036 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2021-08-27 07:47:18,036 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2021-08-27 07:47:18,036 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2021-08-27 07:47:18,036 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2021-08-27 07:47:18,037 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2021-08-27 07:47:18,037 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2021-08-27 07:47:18,037 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2021-08-27 07:47:18,037 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2021-08-27 07:47:18,037 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2021-08-27 07:47:18,037 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2021-08-27 07:47:18,037 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2021-08-27 07:47:18,038 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2021-08-27 07:47:18,038 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2021-08-27 07:47:18,038 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2021-08-27 07:47:18,038 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2021-08-27 07:47:18,038 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2021-08-27 07:47:18,038 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2021-08-27 07:47:18,038 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-08-27 07:47:18,039 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-08-27 07:47:18,039 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-08-27 07:47:18,039 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-08-27 07:47:18,039 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2021-08-27 07:47:18,039 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-08-27 07:47:18,039 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2021-08-27 07:47:18,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2021-08-27 07:47:18,039 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-08-27 07:47:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-08-27 07:47:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-08-27 07:47:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 07:47:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2021-08-27 07:47:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-08-27 07:47:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2021-08-27 07:47:18,040 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2021-08-27 07:47:18,041 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2021-08-27 07:47:18,041 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2021-08-27 07:47:18,048 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2021-08-27 07:47:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2021-08-27 07:47:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2021-08-27 07:47:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2021-08-27 07:47:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2021-08-27 07:47:18,049 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2021-08-27 07:47:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2021-08-27 07:47:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2021-08-27 07:47:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2021-08-27 07:47:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2021-08-27 07:47:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2021-08-27 07:47:18,050 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2021-08-27 07:47:18,051 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-08-27 07:47:18,051 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2021-08-27 07:47:18,051 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-08-27 07:47:18,051 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2021-08-27 07:47:18,051 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2021-08-27 07:47:18,051 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-08-27 07:47:18,052 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-08-27 07:47:18,052 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2021-08-27 07:47:18,052 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2021-08-27 07:47:18,052 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2021-08-27 07:47:18,052 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2021-08-27 07:47:18,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-08-27 07:47:18,053 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-08-27 07:47:18,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-08-27 07:47:18,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 07:47:18,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 07:47:18,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 07:47:18,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 07:47:18,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 07:47:18,607 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:18,688 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-08-27 07:47:18,688 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-08-27 07:47:18,694 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:18,735 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2021-08-27 07:47:18,735 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2021-08-27 07:47:18,763 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:18,783 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-08-27 07:47:18,783 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-08-27 07:47:18,849 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:18,894 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2021-08-27 07:47:18,894 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: #res := 0; [2021-08-27 07:47:18,894 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2021-08-27 07:47:18,898 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:19,061 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2021-08-27 07:47:19,061 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2021-08-27 07:47:19,062 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:19,100 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2021-08-27 07:47:19,100 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2021-08-27 07:47:19,145 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:19,182 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2021-08-27 07:47:19,183 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2021-08-27 07:47:19,187 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:19,340 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2021-08-27 07:47:19,340 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2021-08-27 07:47:19,351 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-27 07:47:19,356 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-08-27 07:47:19,356 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-08-27 07:47:19,408 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 07:47:19,408 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-08-27 07:47:19,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:47:19 BoogieIcfgContainer [2021-08-27 07:47:19,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 07:47:19,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 07:47:19,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 07:47:19,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 07:47:19,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 07:47:17" (1/3) ... [2021-08-27 07:47:19,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f82f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:47:19, skipping insertion in model container [2021-08-27 07:47:19,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 07:47:17" (2/3) ... [2021-08-27 07:47:19,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f82f09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 07:47:19, skipping insertion in model container [2021-08-27 07:47:19,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:47:19" (3/3) ... [2021-08-27 07:47:19,422 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2021-08-27 07:47:19,427 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 07:47:19,427 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-27 07:47:19,471 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 07:47:19,479 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 07:47:19,480 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-27 07:47:19,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 516 states, 382 states have (on average 1.4895287958115184) internal successors, (569), 403 states have internal predecessors, (569), 102 states have call successors, (102), 29 states have call predecessors, (102), 29 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2021-08-27 07:47:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-27 07:47:19,517 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:19,519 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:19,520 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ENSURES_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:19,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:19,528 INFO L82 PathProgramCache]: Analyzing trace with hash 202700341, now seen corresponding path program 1 times [2021-08-27 07:47:19,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:19,535 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86542580] [2021-08-27 07:47:19,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:19,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:19,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:20,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:20,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:20,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86542580] [2021-08-27 07:47:20,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86542580] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:20,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:20,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 07:47:20,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901676427] [2021-08-27 07:47:20,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 07:47:20,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 07:47:20,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:47:20,111 INFO L87 Difference]: Start difference. First operand has 516 states, 382 states have (on average 1.4895287958115184) internal successors, (569), 403 states have internal predecessors, (569), 102 states have call successors, (102), 29 states have call predecessors, (102), 29 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:47:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:22,091 INFO L93 Difference]: Finished difference Result 669 states and 1027 transitions. [2021-08-27 07:47:22,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 07:47:22,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-08-27 07:47:22,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:22,107 INFO L225 Difference]: With dead ends: 669 [2021-08-27 07:47:22,108 INFO L226 Difference]: Without dead ends: 663 [2021-08-27 07:47:22,109 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 219.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 07:47:22,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-08-27 07:47:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 507. [2021-08-27 07:47:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 377 states have (on average 1.4588859416445623) internal successors, (550), 395 states have internal predecessors, (550), 102 states have call successors, (102), 29 states have call predecessors, (102), 27 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2021-08-27 07:47:22,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 738 transitions. [2021-08-27 07:47:22,182 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 738 transitions. Word has length 15 [2021-08-27 07:47:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:22,183 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 738 transitions. [2021-08-27 07:47:22,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:47:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 738 transitions. [2021-08-27 07:47:22,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 07:47:22,184 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:22,184 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:22,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 07:47:22,185 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:22,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:22,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1835723386, now seen corresponding path program 1 times [2021-08-27 07:47:22,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:22,186 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747473630] [2021-08-27 07:47:22,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:22,186 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:22,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:22,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:22,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:22,363 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747473630] [2021-08-27 07:47:22,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747473630] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:22,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:22,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 07:47:22,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202549579] [2021-08-27 07:47:22,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 07:47:22,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:22,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 07:47:22,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 07:47:22,366 INFO L87 Difference]: Start difference. First operand 507 states and 738 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:47:24,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:24,810 INFO L93 Difference]: Finished difference Result 668 states and 1019 transitions. [2021-08-27 07:47:24,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:24,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2021-08-27 07:47:24,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:24,815 INFO L225 Difference]: With dead ends: 668 [2021-08-27 07:47:24,815 INFO L226 Difference]: Without dead ends: 663 [2021-08-27 07:47:24,816 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 210.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2021-08-27 07:47:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 507. [2021-08-27 07:47:24,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 377 states have (on average 1.4562334217506632) internal successors, (549), 395 states have internal predecessors, (549), 102 states have call successors, (102), 29 states have call predecessors, (102), 27 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2021-08-27 07:47:24,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2021-08-27 07:47:24,844 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2021-08-27 07:47:24,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:24,844 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2021-08-27 07:47:24,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-08-27 07:47:24,845 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2021-08-27 07:47:24,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 07:47:24,846 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:24,846 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:24,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 07:47:24,846 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:24,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:24,847 INFO L82 PathProgramCache]: Analyzing trace with hash -992565858, now seen corresponding path program 1 times [2021-08-27 07:47:24,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:24,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504915750] [2021-08-27 07:47:24,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:24,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:24,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:25,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:25,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:25,065 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504915750] [2021-08-27 07:47:25,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504915750] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:25,066 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:25,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:25,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169464415] [2021-08-27 07:47:25,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:25,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:25,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:25,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:25,069 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:27,603 INFO L93 Difference]: Finished difference Result 843 states and 1255 transitions. [2021-08-27 07:47:27,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:27,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2021-08-27 07:47:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:27,612 INFO L225 Difference]: With dead ends: 843 [2021-08-27 07:47:27,612 INFO L226 Difference]: Without dead ends: 842 [2021-08-27 07:47:27,613 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 246.8ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2021-08-27 07:47:27,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 662. [2021-08-27 07:47:27,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 501 states have (on average 1.407185628742515) internal successors, (705), 508 states have internal predecessors, (705), 111 states have call successors, (111), 40 states have call predecessors, (111), 49 states have return successors, (145), 119 states have call predecessors, (145), 99 states have call successors, (145) [2021-08-27 07:47:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 961 transitions. [2021-08-27 07:47:27,642 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 961 transitions. Word has length 25 [2021-08-27 07:47:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:27,642 INFO L470 AbstractCegarLoop]: Abstraction has 662 states and 961 transitions. [2021-08-27 07:47:27,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 961 transitions. [2021-08-27 07:47:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-27 07:47:27,644 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:27,644 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:27,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 07:47:27,645 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:27,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:27,645 INFO L82 PathProgramCache]: Analyzing trace with hash 555196280, now seen corresponding path program 1 times [2021-08-27 07:47:27,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:27,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219269874] [2021-08-27 07:47:27,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:27,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:27,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:27,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:27,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:27,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:27,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:27,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219269874] [2021-08-27 07:47:27,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219269874] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:27,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:27,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:27,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948334678] [2021-08-27 07:47:27,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:27,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:27,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:27,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:27,906 INFO L87 Difference]: Start difference. First operand 662 states and 961 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:29,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:29,941 INFO L93 Difference]: Finished difference Result 966 states and 1409 transitions. [2021-08-27 07:47:29,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:29,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2021-08-27 07:47:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:29,947 INFO L225 Difference]: With dead ends: 966 [2021-08-27 07:47:29,948 INFO L226 Difference]: Without dead ends: 966 [2021-08-27 07:47:29,948 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 246.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-08-27 07:47:29,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 787. [2021-08-27 07:47:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 610 states have (on average 1.4032786885245903) internal successors, (856), 613 states have internal predecessors, (856), 113 states have call successors, (113), 46 states have call predecessors, (113), 63 states have return successors, (163), 130 states have call predecessors, (163), 104 states have call successors, (163) [2021-08-27 07:47:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1132 transitions. [2021-08-27 07:47:29,981 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1132 transitions. Word has length 30 [2021-08-27 07:47:29,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:29,981 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 1132 transitions. [2021-08-27 07:47:29,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1132 transitions. [2021-08-27 07:47:29,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-27 07:47:29,984 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:29,984 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:29,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 07:47:29,984 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:29,985 INFO L82 PathProgramCache]: Analyzing trace with hash -244848687, now seen corresponding path program 1 times [2021-08-27 07:47:29,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:29,985 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911808254] [2021-08-27 07:47:29,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:29,986 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:30,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:30,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:30,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:30,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:30,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911808254] [2021-08-27 07:47:30,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911808254] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:30,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:30,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:30,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364891013] [2021-08-27 07:47:30,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:30,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:30,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:30,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:30,164 INFO L87 Difference]: Start difference. First operand 787 states and 1132 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:33,039 INFO L93 Difference]: Finished difference Result 1340 states and 2025 transitions. [2021-08-27 07:47:33,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:47:33,039 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), 2 states have call successors, (7), 5 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 31 [2021-08-27 07:47:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:33,045 INFO L225 Difference]: With dead ends: 1340 [2021-08-27 07:47:33,045 INFO L226 Difference]: Without dead ends: 1340 [2021-08-27 07:47:33,045 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 209.9ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2021-08-27 07:47:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 905. [2021-08-27 07:47:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 707 states have (on average 1.413012729844413) internal successors, (999), 709 states have internal predecessors, (999), 126 states have call successors, (126), 54 states have call predecessors, (126), 71 states have return successors, (220), 144 states have call predecessors, (220), 117 states have call successors, (220) [2021-08-27 07:47:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1345 transitions. [2021-08-27 07:47:33,081 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1345 transitions. Word has length 31 [2021-08-27 07:47:33,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:33,081 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 1345 transitions. [2021-08-27 07:47:33,082 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), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1345 transitions. [2021-08-27 07:47:33,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-27 07:47:33,086 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:33,086 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:33,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 07:47:33,086 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:33,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:33,087 INFO L82 PathProgramCache]: Analyzing trace with hash 761233557, now seen corresponding path program 1 times [2021-08-27 07:47:33,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:33,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685515249] [2021-08-27 07:47:33,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:33,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:33,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:33,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:33,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:33,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:33,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:33,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685515249] [2021-08-27 07:47:33,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685515249] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:33,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:33,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:47:33,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713320085] [2021-08-27 07:47:33,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:47:33,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:33,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:47:33,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:47:33,367 INFO L87 Difference]: Start difference. First operand 905 states and 1345 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 07:47:36,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:36,002 INFO L93 Difference]: Finished difference Result 1042 states and 1577 transitions. [2021-08-27 07:47:36,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:47:36,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2021-08-27 07:47:36,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:36,007 INFO L225 Difference]: With dead ends: 1042 [2021-08-27 07:47:36,007 INFO L226 Difference]: Without dead ends: 1042 [2021-08-27 07:47:36,008 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 510.2ms TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:47:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2021-08-27 07:47:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 833. [2021-08-27 07:47:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 648 states have (on average 1.3981481481481481) internal successors, (906), 651 states have internal predecessors, (906), 117 states have call successors, (117), 50 states have call predecessors, (117), 67 states have return successors, (177), 134 states have call predecessors, (177), 108 states have call successors, (177) [2021-08-27 07:47:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1200 transitions. [2021-08-27 07:47:36,035 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1200 transitions. Word has length 32 [2021-08-27 07:47:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:36,035 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 1200 transitions. [2021-08-27 07:47:36,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-08-27 07:47:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1200 transitions. [2021-08-27 07:47:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-08-27 07:47:36,038 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:36,039 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:36,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 07:47:36,039 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:36,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:36,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2010546137, now seen corresponding path program 1 times [2021-08-27 07:47:36,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:36,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368084043] [2021-08-27 07:47:36,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:36,043 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:36,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:36,252 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368084043] [2021-08-27 07:47:36,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368084043] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:36,252 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:36,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:36,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619306900] [2021-08-27 07:47:36,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:36,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:36,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:36,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:36,254 INFO L87 Difference]: Start difference. First operand 833 states and 1200 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:38,245 INFO L93 Difference]: Finished difference Result 959 states and 1417 transitions. [2021-08-27 07:47:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:38,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2021-08-27 07:47:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:38,249 INFO L225 Difference]: With dead ends: 959 [2021-08-27 07:47:38,249 INFO L226 Difference]: Without dead ends: 959 [2021-08-27 07:47:38,250 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 182.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:47:38,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-08-27 07:47:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 832. [2021-08-27 07:47:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 648 states have (on average 1.3950617283950617) internal successors, (904), 650 states have internal predecessors, (904), 116 states have call successors, (116), 50 states have call predecessors, (116), 67 states have return successors, (177), 134 states have call predecessors, (177), 108 states have call successors, (177) [2021-08-27 07:47:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1197 transitions. [2021-08-27 07:47:38,273 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1197 transitions. Word has length 36 [2021-08-27 07:47:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:38,273 INFO L470 AbstractCegarLoop]: Abstraction has 832 states and 1197 transitions. [2021-08-27 07:47:38,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1197 transitions. [2021-08-27 07:47:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-08-27 07:47:38,275 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:38,275 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:38,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 07:47:38,275 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:38,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:38,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1026748832, now seen corresponding path program 1 times [2021-08-27 07:47:38,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:38,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862806044] [2021-08-27 07:47:38,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:38,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:38,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:38,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862806044] [2021-08-27 07:47:38,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862806044] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:38,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:38,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:47:38,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615887358] [2021-08-27 07:47:38,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:47:38,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:38,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:47:38,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:47:38,494 INFO L87 Difference]: Start difference. First operand 832 states and 1197 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:41,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:41,080 INFO L93 Difference]: Finished difference Result 993 states and 1427 transitions. [2021-08-27 07:47:41,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:47:41,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2021-08-27 07:47:41,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:41,085 INFO L225 Difference]: With dead ends: 993 [2021-08-27 07:47:41,085 INFO L226 Difference]: Without dead ends: 993 [2021-08-27 07:47:41,085 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 361.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:47:41,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2021-08-27 07:47:41,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 734. [2021-08-27 07:47:41,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 570 states have (on average 1.3859649122807018) internal successors, (790), 573 states have internal predecessors, (790), 105 states have call successors, (105), 45 states have call predecessors, (105), 58 states have return successors, (131), 118 states have call predecessors, (131), 97 states have call successors, (131) [2021-08-27 07:47:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1026 transitions. [2021-08-27 07:47:41,106 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1026 transitions. Word has length 39 [2021-08-27 07:47:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:41,106 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1026 transitions. [2021-08-27 07:47:41,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1026 transitions. [2021-08-27 07:47:41,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-08-27 07:47:41,109 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:41,109 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:41,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 07:47:41,109 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:41,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:41,110 INFO L82 PathProgramCache]: Analyzing trace with hash -476224825, now seen corresponding path program 1 times [2021-08-27 07:47:41,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:41,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864363288] [2021-08-27 07:47:41,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:41,111 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:41,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:41,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:41,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:41,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864363288] [2021-08-27 07:47:41,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864363288] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:41,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:41,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 07:47:41,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552157871] [2021-08-27 07:47:41,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 07:47:41,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:41,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 07:47:41,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 07:47:41,341 INFO L87 Difference]: Start difference. First operand 734 states and 1026 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, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:42,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:42,924 INFO L93 Difference]: Finished difference Result 957 states and 1377 transitions. [2021-08-27 07:47:42,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 07:47:42,925 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, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2021-08-27 07:47:42,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:42,928 INFO L225 Difference]: With dead ends: 957 [2021-08-27 07:47:42,929 INFO L226 Difference]: Without dead ends: 957 [2021-08-27 07:47:42,929 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 202.1ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-08-27 07:47:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 754. [2021-08-27 07:47:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 588 states have (on average 1.3962585034013606) internal successors, (821), 600 states have internal predecessors, (821), 107 states have call successors, (107), 48 states have call predecessors, (107), 58 states have return successors, (124), 110 states have call predecessors, (124), 100 states have call successors, (124) [2021-08-27 07:47:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1052 transitions. [2021-08-27 07:47:42,948 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1052 transitions. Word has length 40 [2021-08-27 07:47:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:42,948 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 1052 transitions. [2021-08-27 07:47:42,948 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, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2021-08-27 07:47:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1052 transitions. [2021-08-27 07:47:42,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-08-27 07:47:42,950 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:42,950 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:42,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 07:47:42,951 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:42,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:42,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1997241835, now seen corresponding path program 1 times [2021-08-27 07:47:42,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:42,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497135545] [2021-08-27 07:47:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:42,952 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:43,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:43,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:43,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:43,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-08-27 07:47:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:43,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:43,121 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497135545] [2021-08-27 07:47:43,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497135545] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:43,121 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:43,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:47:43,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408714747] [2021-08-27 07:47:43,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:47:43,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:43,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:47:43,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:47:43,123 INFO L87 Difference]: Start difference. First operand 754 states and 1052 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:47:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:45,559 INFO L93 Difference]: Finished difference Result 934 states and 1345 transitions. [2021-08-27 07:47:45,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:47:45,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2021-08-27 07:47:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:45,563 INFO L225 Difference]: With dead ends: 934 [2021-08-27 07:47:45,563 INFO L226 Difference]: Without dead ends: 934 [2021-08-27 07:47:45,564 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 196.6ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:47:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2021-08-27 07:47:45,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 754. [2021-08-27 07:47:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 588 states have (on average 1.3945578231292517) internal successors, (820), 600 states have internal predecessors, (820), 107 states have call successors, (107), 48 states have call predecessors, (107), 58 states have return successors, (124), 110 states have call predecessors, (124), 100 states have call successors, (124) [2021-08-27 07:47:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1051 transitions. [2021-08-27 07:47:45,581 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1051 transitions. Word has length 46 [2021-08-27 07:47:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:45,582 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 1051 transitions. [2021-08-27 07:47:45,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:47:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1051 transitions. [2021-08-27 07:47:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-08-27 07:47:45,584 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:45,584 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:45,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 07:47:45,585 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:45,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1938375730, now seen corresponding path program 1 times [2021-08-27 07:47:45,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:45,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993581965] [2021-08-27 07:47:45,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:45,586 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:45,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:45,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:45,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:45,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-08-27 07:47:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:45,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:45,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993581965] [2021-08-27 07:47:45,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993581965] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:45,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:45,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:47:45,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315504297] [2021-08-27 07:47:45,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:47:45,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:45,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:47:45,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:47:45,797 INFO L87 Difference]: Start difference. First operand 754 states and 1051 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 7 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:47:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:47,683 INFO L93 Difference]: Finished difference Result 889 states and 1287 transitions. [2021-08-27 07:47:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:47:47,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 7 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2021-08-27 07:47:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:47,686 INFO L225 Difference]: With dead ends: 889 [2021-08-27 07:47:47,686 INFO L226 Difference]: Without dead ends: 889 [2021-08-27 07:47:47,687 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 228.3ms TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:47:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2021-08-27 07:47:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 743. [2021-08-27 07:47:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 581 states have (on average 1.395869191049914) internal successors, (811), 593 states have internal predecessors, (811), 105 states have call successors, (105), 46 states have call predecessors, (105), 56 states have return successors, (122), 108 states have call predecessors, (122), 98 states have call successors, (122) [2021-08-27 07:47:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1038 transitions. [2021-08-27 07:47:47,703 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1038 transitions. Word has length 47 [2021-08-27 07:47:47,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:47,703 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1038 transitions. [2021-08-27 07:47:47,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 7 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-08-27 07:47:47,704 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1038 transitions. [2021-08-27 07:47:47,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-08-27 07:47:47,705 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:47,706 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:47,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 07:47:47,706 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:47,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:47,706 INFO L82 PathProgramCache]: Analyzing trace with hash 301464195, now seen corresponding path program 1 times [2021-08-27 07:47:47,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:47,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666250082] [2021-08-27 07:47:47,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:47,707 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:47,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:47,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:47,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:47:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:47,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:47,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:47,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666250082] [2021-08-27 07:47:47,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666250082] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:47,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:47,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:47:47,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725815064] [2021-08-27 07:47:47,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:47:47,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:47:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:47:47,964 INFO L87 Difference]: Start difference. First operand 743 states and 1038 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:47:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:51,205 INFO L93 Difference]: Finished difference Result 998 states and 1427 transitions. [2021-08-27 07:47:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:47:51,205 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 48 [2021-08-27 07:47:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:51,208 INFO L225 Difference]: With dead ends: 998 [2021-08-27 07:47:51,208 INFO L226 Difference]: Without dead ends: 998 [2021-08-27 07:47:51,209 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 682.5ms TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:47:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2021-08-27 07:47:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 786. [2021-08-27 07:47:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 616 states have (on average 1.3944805194805194) internal successors, (859), 627 states have internal predecessors, (859), 109 states have call successors, (109), 49 states have call predecessors, (109), 60 states have return successors, (131), 114 states have call predecessors, (131), 102 states have call successors, (131) [2021-08-27 07:47:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1099 transitions. [2021-08-27 07:47:51,226 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1099 transitions. Word has length 48 [2021-08-27 07:47:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:51,227 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 1099 transitions. [2021-08-27 07:47:51,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:47:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1099 transitions. [2021-08-27 07:47:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:47:51,229 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:51,229 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:51,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 07:47:51,230 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:51,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:51,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1439926846, now seen corresponding path program 1 times [2021-08-27 07:47:51,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:51,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096911430] [2021-08-27 07:47:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:51,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:51,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:51,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:47:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:51,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:51,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:51,413 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096911430] [2021-08-27 07:47:51,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096911430] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:51,413 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:51,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 07:47:51,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646458154] [2021-08-27 07:47:51,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 07:47:51,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:51,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 07:47:51,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-27 07:47:51,415 INFO L87 Difference]: Start difference. First operand 786 states and 1099 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:53,571 INFO L93 Difference]: Finished difference Result 1083 states and 1549 transitions. [2021-08-27 07:47:53,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:47:53,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2021-08-27 07:47:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:53,574 INFO L225 Difference]: With dead ends: 1083 [2021-08-27 07:47:53,574 INFO L226 Difference]: Without dead ends: 1083 [2021-08-27 07:47:53,574 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 193.6ms TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2021-08-27 07:47:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 860. [2021-08-27 07:47:53,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 672 states have (on average 1.3675595238095237) internal successors, (919), 678 states have internal predecessors, (919), 111 states have call successors, (111), 51 states have call predecessors, (111), 76 states have return successors, (154), 137 states have call predecessors, (154), 104 states have call successors, (154) [2021-08-27 07:47:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1184 transitions. [2021-08-27 07:47:53,593 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1184 transitions. Word has length 50 [2021-08-27 07:47:53,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:53,593 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 1184 transitions. [2021-08-27 07:47:53,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:53,593 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1184 transitions. [2021-08-27 07:47:53,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:47:53,595 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:53,596 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:53,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 07:47:53,596 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:53,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:53,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1007588546, now seen corresponding path program 1 times [2021-08-27 07:47:53,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:53,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525101180] [2021-08-27 07:47:53,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:53,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:47:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:53,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:53,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525101180] [2021-08-27 07:47:53,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525101180] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:53,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:53,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:47:53,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206393585] [2021-08-27 07:47:53,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:47:53,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:53,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:47:53,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:47:53,798 INFO L87 Difference]: Start difference. First operand 860 states and 1184 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:56,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:56,050 INFO L93 Difference]: Finished difference Result 993 states and 1413 transitions. [2021-08-27 07:47:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:47:56,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 50 [2021-08-27 07:47:56,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:56,054 INFO L225 Difference]: With dead ends: 993 [2021-08-27 07:47:56,054 INFO L226 Difference]: Without dead ends: 993 [2021-08-27 07:47:56,054 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 274.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:47:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2021-08-27 07:47:56,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 863. [2021-08-27 07:47:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 675 states have (on average 1.3674074074074074) internal successors, (923), 681 states have internal predecessors, (923), 111 states have call successors, (111), 51 states have call predecessors, (111), 76 states have return successors, (154), 137 states have call predecessors, (154), 104 states have call successors, (154) [2021-08-27 07:47:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1188 transitions. [2021-08-27 07:47:56,073 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1188 transitions. Word has length 50 [2021-08-27 07:47:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:56,073 INFO L470 AbstractCegarLoop]: Abstraction has 863 states and 1188 transitions. [2021-08-27 07:47:56,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:47:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1188 transitions. [2021-08-27 07:47:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-08-27 07:47:56,076 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:56,076 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:56,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 07:47:56,076 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:56,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1293234044, now seen corresponding path program 1 times [2021-08-27 07:47:56,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:56,077 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568153461] [2021-08-27 07:47:56,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:56,077 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:56,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:56,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:56,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:47:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:56,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:56,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:56,309 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568153461] [2021-08-27 07:47:56,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568153461] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:56,309 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:56,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:47:56,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902397730] [2021-08-27 07:47:56,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:47:56,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:56,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:47:56,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:47:56,311 INFO L87 Difference]: Start difference. First operand 863 states and 1188 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:47:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:47:59,054 INFO L93 Difference]: Finished difference Result 959 states and 1365 transitions. [2021-08-27 07:47:59,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:47:59,055 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2021-08-27 07:47:59,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:47:59,058 INFO L225 Difference]: With dead ends: 959 [2021-08-27 07:47:59,058 INFO L226 Difference]: Without dead ends: 959 [2021-08-27 07:47:59,059 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 515.6ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:47:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2021-08-27 07:47:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 837. [2021-08-27 07:47:59,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 653 states have (on average 1.3721286370597243) internal successors, (896), 666 states have internal predecessors, (896), 111 states have call successors, (111), 51 states have call predecessors, (111), 72 states have return successors, (143), 126 states have call predecessors, (143), 104 states have call successors, (143) [2021-08-27 07:47:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1150 transitions. [2021-08-27 07:47:59,075 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1150 transitions. Word has length 50 [2021-08-27 07:47:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:47:59,075 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 1150 transitions. [2021-08-27 07:47:59,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2021-08-27 07:47:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1150 transitions. [2021-08-27 07:47:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:47:59,078 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:47:59,078 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:47:59,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 07:47:59,078 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:47:59,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:47:59,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1030885843, now seen corresponding path program 1 times [2021-08-27 07:47:59,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:47:59,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452654953] [2021-08-27 07:47:59,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:47:59,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:47:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:47:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:47:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:47:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:47:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:47:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:47:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:47:59,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:47:59,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452654953] [2021-08-27 07:47:59,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452654953] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:47:59,324 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:47:59,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:47:59,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218085480] [2021-08-27 07:47:59,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:47:59,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:47:59,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:47:59,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:47:59,325 INFO L87 Difference]: Start difference. First operand 837 states and 1150 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:01,675 INFO L93 Difference]: Finished difference Result 977 states and 1385 transitions. [2021-08-27 07:48:01,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:48:01,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2021-08-27 07:48:01,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:01,678 INFO L225 Difference]: With dead ends: 977 [2021-08-27 07:48:01,678 INFO L226 Difference]: Without dead ends: 977 [2021-08-27 07:48:01,679 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 226.6ms TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:48:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2021-08-27 07:48:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 855. [2021-08-27 07:48:01,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 668 states have (on average 1.3682634730538923) internal successors, (914), 682 states have internal predecessors, (914), 112 states have call successors, (112), 52 states have call predecessors, (112), 74 states have return successors, (145), 128 states have call predecessors, (145), 105 states have call successors, (145) [2021-08-27 07:48:01,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1171 transitions. [2021-08-27 07:48:01,695 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1171 transitions. Word has length 52 [2021-08-27 07:48:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:01,696 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 1171 transitions. [2021-08-27 07:48:01,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1171 transitions. [2021-08-27 07:48:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-27 07:48:01,698 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:01,698 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:01,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 07:48:01,699 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:01,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:01,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1255599122, now seen corresponding path program 1 times [2021-08-27 07:48:01,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:01,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055321520] [2021-08-27 07:48:01,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:01,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:01,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:01,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:01,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:01,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:01,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:48:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:01,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2021-08-27 07:48:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:01,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:01,880 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055321520] [2021-08-27 07:48:01,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055321520] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:01,880 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:01,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:48:01,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115260353] [2021-08-27 07:48:01,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:48:01,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:01,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:48:01,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:48:01,881 INFO L87 Difference]: Start difference. First operand 855 states and 1171 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:03,561 INFO L93 Difference]: Finished difference Result 947 states and 1347 transitions. [2021-08-27 07:48:03,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:48:03,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2021-08-27 07:48:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:03,564 INFO L225 Difference]: With dead ends: 947 [2021-08-27 07:48:03,564 INFO L226 Difference]: Without dead ends: 947 [2021-08-27 07:48:03,564 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 223.1ms TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:48:03,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2021-08-27 07:48:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 827. [2021-08-27 07:48:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 647 states have (on average 1.3663060278207109) internal successors, (884), 659 states have internal predecessors, (884), 110 states have call successors, (110), 51 states have call predecessors, (110), 69 states have return successors, (140), 123 states have call predecessors, (140), 104 states have call successors, (140) [2021-08-27 07:48:03,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1134 transitions. [2021-08-27 07:48:03,579 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1134 transitions. Word has length 54 [2021-08-27 07:48:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:03,579 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1134 transitions. [2021-08-27 07:48:03,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1134 transitions. [2021-08-27 07:48:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:48:03,582 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:03,582 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:03,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 07:48:03,582 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash 2131929044, now seen corresponding path program 1 times [2021-08-27 07:48:03,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:03,583 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089151682] [2021-08-27 07:48:03,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:03,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:03,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:03,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:03,815 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089151682] [2021-08-27 07:48:03,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089151682] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:03,815 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:03,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:48:03,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952867146] [2021-08-27 07:48:03,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:03,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:03,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:03,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:03,818 INFO L87 Difference]: Start difference. First operand 827 states and 1134 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:06,507 INFO L93 Difference]: Finished difference Result 959 states and 1361 transitions. [2021-08-27 07:48:06,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:48:06,508 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2021-08-27 07:48:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:06,511 INFO L225 Difference]: With dead ends: 959 [2021-08-27 07:48:06,511 INFO L226 Difference]: Without dead ends: 958 [2021-08-27 07:48:06,512 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 173.0ms TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:48:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-08-27 07:48:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 834. [2021-08-27 07:48:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 653 states have (on average 1.3644716692189893) internal successors, (891), 666 states have internal predecessors, (891), 111 states have call successors, (111), 51 states have call predecessors, (111), 69 states have return successors, (141), 124 states have call predecessors, (141), 105 states have call successors, (141) [2021-08-27 07:48:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1143 transitions. [2021-08-27 07:48:06,527 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1143 transitions. Word has length 51 [2021-08-27 07:48:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:06,528 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 1143 transitions. [2021-08-27 07:48:06,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1143 transitions. [2021-08-27 07:48:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-08-27 07:48:06,530 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:06,530 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:06,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 07:48:06,531 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:06,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:06,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2131652214, now seen corresponding path program 1 times [2021-08-27 07:48:06,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:06,532 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448315861] [2021-08-27 07:48:06,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:06,532 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:06,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:06,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:06,816 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448315861] [2021-08-27 07:48:06,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448315861] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:06,816 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:06,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:48:06,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644192237] [2021-08-27 07:48:06,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:06,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:06,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:06,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:06,819 INFO L87 Difference]: Start difference. First operand 834 states and 1143 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:09,037 INFO L93 Difference]: Finished difference Result 974 states and 1377 transitions. [2021-08-27 07:48:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:48:09,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2021-08-27 07:48:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:09,042 INFO L225 Difference]: With dead ends: 974 [2021-08-27 07:48:09,042 INFO L226 Difference]: Without dead ends: 953 [2021-08-27 07:48:09,043 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 269.1ms TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:48:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2021-08-27 07:48:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 833. [2021-08-27 07:48:09,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 652 states have (on average 1.3634969325153374) internal successors, (889), 665 states have internal predecessors, (889), 111 states have call successors, (111), 51 states have call predecessors, (111), 69 states have return successors, (141), 124 states have call predecessors, (141), 105 states have call successors, (141) [2021-08-27 07:48:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1141 transitions. [2021-08-27 07:48:09,060 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1141 transitions. Word has length 51 [2021-08-27 07:48:09,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:09,060 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 1141 transitions. [2021-08-27 07:48:09,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2021-08-27 07:48:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1141 transitions. [2021-08-27 07:48:09,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-08-27 07:48:09,063 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:09,063 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:09,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 07:48:09,063 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:09,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:09,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1449097113, now seen corresponding path program 1 times [2021-08-27 07:48:09,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:09,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791462928] [2021-08-27 07:48:09,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:09,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:09,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:09,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:09,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791462928] [2021-08-27 07:48:09,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791462928] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:09,404 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:09,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:48:09,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062151083] [2021-08-27 07:48:09,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:48:09,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:09,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:48:09,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:48:09,406 INFO L87 Difference]: Start difference. First operand 833 states and 1141 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:11,514 INFO L93 Difference]: Finished difference Result 957 states and 1356 transitions. [2021-08-27 07:48:11,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:48:11,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2021-08-27 07:48:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:11,517 INFO L225 Difference]: With dead ends: 957 [2021-08-27 07:48:11,517 INFO L226 Difference]: Without dead ends: 957 [2021-08-27 07:48:11,518 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 607.2ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:48:11,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-08-27 07:48:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 833. [2021-08-27 07:48:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 652 states have (on average 1.361963190184049) internal successors, (888), 665 states have internal predecessors, (888), 111 states have call successors, (111), 51 states have call predecessors, (111), 69 states have return successors, (141), 124 states have call predecessors, (141), 105 states have call successors, (141) [2021-08-27 07:48:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1140 transitions. [2021-08-27 07:48:11,532 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1140 transitions. Word has length 53 [2021-08-27 07:48:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:11,532 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 1140 transitions. [2021-08-27 07:48:11,532 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1140 transitions. [2021-08-27 07:48:11,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-08-27 07:48:11,535 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:11,535 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:11,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 07:48:11,535 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:11,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:11,536 INFO L82 PathProgramCache]: Analyzing trace with hash 196258149, now seen corresponding path program 1 times [2021-08-27 07:48:11,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:11,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856992276] [2021-08-27 07:48:11,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:11,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:48:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:11,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:11,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856992276] [2021-08-27 07:48:11,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856992276] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:11,756 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:11,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:48:11,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235006687] [2021-08-27 07:48:11,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:48:11,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:11,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:48:11,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:48:11,757 INFO L87 Difference]: Start difference. First operand 833 states and 1140 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:48:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:14,628 INFO L93 Difference]: Finished difference Result 963 states and 1360 transitions. [2021-08-27 07:48:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:14,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2021-08-27 07:48:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:14,632 INFO L225 Difference]: With dead ends: 963 [2021-08-27 07:48:14,632 INFO L226 Difference]: Without dead ends: 931 [2021-08-27 07:48:14,633 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 595.5ms TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:48:14,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-08-27 07:48:14,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 805. [2021-08-27 07:48:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 629 states have (on average 1.370429252782194) internal successors, (862), 641 states have internal predecessors, (862), 108 states have call successors, (108), 49 states have call predecessors, (108), 67 states have return successors, (138), 121 states have call predecessors, (138), 102 states have call successors, (138) [2021-08-27 07:48:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1108 transitions. [2021-08-27 07:48:14,649 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1108 transitions. Word has length 52 [2021-08-27 07:48:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:14,649 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1108 transitions. [2021-08-27 07:48:14,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2021-08-27 07:48:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1108 transitions. [2021-08-27 07:48:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-08-27 07:48:14,652 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:14,652 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:14,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-27 07:48:14,652 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:14,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:14,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1690613202, now seen corresponding path program 1 times [2021-08-27 07:48:14,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:14,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15619612] [2021-08-27 07:48:14,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:14,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:14,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:14,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15619612] [2021-08-27 07:48:14,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15619612] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:14,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:14,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:48:14,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503601950] [2021-08-27 07:48:14,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:48:14,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:14,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:48:14,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:48:14,963 INFO L87 Difference]: Start difference. First operand 805 states and 1108 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:18,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:18,412 INFO L93 Difference]: Finished difference Result 927 states and 1321 transitions. [2021-08-27 07:48:18,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:48:18,414 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2021-08-27 07:48:18,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:18,417 INFO L225 Difference]: With dead ends: 927 [2021-08-27 07:48:18,417 INFO L226 Difference]: Without dead ends: 927 [2021-08-27 07:48:18,417 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 610.5ms TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:48:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2021-08-27 07:48:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 805. [2021-08-27 07:48:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 629 states have (on average 1.368839427662957) internal successors, (861), 641 states have internal predecessors, (861), 108 states have call successors, (108), 49 states have call predecessors, (108), 67 states have return successors, (138), 121 states have call predecessors, (138), 102 states have call successors, (138) [2021-08-27 07:48:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1107 transitions. [2021-08-27 07:48:18,432 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1107 transitions. Word has length 54 [2021-08-27 07:48:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:18,433 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1107 transitions. [2021-08-27 07:48:18,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:18,433 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1107 transitions. [2021-08-27 07:48:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-27 07:48:18,435 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:18,435 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:18,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-27 07:48:18,436 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:18,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:18,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1181552496, now seen corresponding path program 1 times [2021-08-27 07:48:18,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:18,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966501682] [2021-08-27 07:48:18,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:18,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:18,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:18,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966501682] [2021-08-27 07:48:18,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966501682] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:18,738 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:18,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:18,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721890602] [2021-08-27 07:48:18,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:18,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:18,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:18,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:18,740 INFO L87 Difference]: Start difference. First operand 805 states and 1107 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 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-08-27 07:48:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:21,927 INFO L93 Difference]: Finished difference Result 953 states and 1353 transitions. [2021-08-27 07:48:21,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:48:21,928 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 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 55 [2021-08-27 07:48:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:21,931 INFO L225 Difference]: With dead ends: 953 [2021-08-27 07:48:21,931 INFO L226 Difference]: Without dead ends: 916 [2021-08-27 07:48:21,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 338.8ms TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2021-08-27 07:48:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 796. [2021-08-27 07:48:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 622 states have (on average 1.3520900321543408) internal successors, (841), 634 states have internal predecessors, (841), 106 states have call successors, (106), 49 states have call predecessors, (106), 67 states have return successors, (136), 119 states have call predecessors, (136), 100 states have call successors, (136) [2021-08-27 07:48:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1083 transitions. [2021-08-27 07:48:21,961 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1083 transitions. Word has length 55 [2021-08-27 07:48:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:21,961 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 1083 transitions. [2021-08-27 07:48:21,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 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-08-27 07:48:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1083 transitions. [2021-08-27 07:48:21,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-27 07:48:21,966 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:21,967 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:21,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-27 07:48:21,967 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:21,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:21,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1984424538, now seen corresponding path program 1 times [2021-08-27 07:48:21,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:21,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669955026] [2021-08-27 07:48:21,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:21,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:48:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:22,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:22,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669955026] [2021-08-27 07:48:22,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669955026] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:22,263 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:22,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:22,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194137760] [2021-08-27 07:48:22,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:22,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:22,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:22,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:22,265 INFO L87 Difference]: Start difference. First operand 796 states and 1083 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:24,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:24,927 INFO L93 Difference]: Finished difference Result 929 states and 1307 transitions. [2021-08-27 07:48:24,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:24,928 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 56 [2021-08-27 07:48:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:24,931 INFO L225 Difference]: With dead ends: 929 [2021-08-27 07:48:24,931 INFO L226 Difference]: Without dead ends: 914 [2021-08-27 07:48:24,931 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 210.3ms TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:24,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2021-08-27 07:48:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 794. [2021-08-27 07:48:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 621 states have (on average 1.3510466988727858) internal successors, (839), 633 states have internal predecessors, (839), 105 states have call successors, (105), 49 states have call predecessors, (105), 67 states have return successors, (135), 118 states have call predecessors, (135), 99 states have call successors, (135) [2021-08-27 07:48:24,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1079 transitions. [2021-08-27 07:48:24,946 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1079 transitions. Word has length 56 [2021-08-27 07:48:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:24,947 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 1079 transitions. [2021-08-27 07:48:24,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:24,947 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1079 transitions. [2021-08-27 07:48:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-27 07:48:24,949 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:24,949 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:24,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-27 07:48:24,949 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:24,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:24,950 INFO L82 PathProgramCache]: Analyzing trace with hash -417622987, now seen corresponding path program 1 times [2021-08-27 07:48:24,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:24,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531682258] [2021-08-27 07:48:24,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:24,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:48:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:25,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:25,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:25,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531682258] [2021-08-27 07:48:25,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531682258] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:25,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:25,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:48:25,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473394394] [2021-08-27 07:48:25,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:48:25,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:25,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:48:25,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:25,233 INFO L87 Difference]: Start difference. First operand 794 states and 1079 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:28,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:28,179 INFO L93 Difference]: Finished difference Result 924 states and 1300 transitions. [2021-08-27 07:48:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:48:28,179 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2021-08-27 07:48:28,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:28,182 INFO L225 Difference]: With dead ends: 924 [2021-08-27 07:48:28,183 INFO L226 Difference]: Without dead ends: 909 [2021-08-27 07:48:28,183 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 216.2ms TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:28,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2021-08-27 07:48:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 789. [2021-08-27 07:48:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 618 states have (on average 1.3511326860841424) internal successors, (835), 630 states have internal predecessors, (835), 104 states have call successors, (104), 49 states have call predecessors, (104), 66 states have return successors, (133), 116 states have call predecessors, (133), 98 states have call successors, (133) [2021-08-27 07:48:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1072 transitions. [2021-08-27 07:48:28,198 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1072 transitions. Word has length 55 [2021-08-27 07:48:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:28,199 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1072 transitions. [2021-08-27 07:48:28,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1072 transitions. [2021-08-27 07:48:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-08-27 07:48:28,201 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:28,201 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:28,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-27 07:48:28,202 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:28,202 INFO L82 PathProgramCache]: Analyzing trace with hash -421794702, now seen corresponding path program 1 times [2021-08-27 07:48:28,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:28,202 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754976757] [2021-08-27 07:48:28,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:28,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:28,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:48:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:48:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:28,448 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:28,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754976757] [2021-08-27 07:48:28,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754976757] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:28,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:28,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:48:28,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586889768] [2021-08-27 07:48:28,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:48:28,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:28,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:48:28,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:48:28,451 INFO L87 Difference]: Start difference. First operand 789 states and 1072 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:30,476 INFO L93 Difference]: Finished difference Result 931 states and 1303 transitions. [2021-08-27 07:48:30,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:48:30,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2021-08-27 07:48:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:30,479 INFO L225 Difference]: With dead ends: 931 [2021-08-27 07:48:30,479 INFO L226 Difference]: Without dead ends: 931 [2021-08-27 07:48:30,480 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 347.9ms TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:48:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-08-27 07:48:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 789. [2021-08-27 07:48:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 618 states have (on average 1.3495145631067962) internal successors, (834), 630 states have internal predecessors, (834), 104 states have call successors, (104), 49 states have call predecessors, (104), 66 states have return successors, (133), 116 states have call predecessors, (133), 98 states have call successors, (133) [2021-08-27 07:48:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1071 transitions. [2021-08-27 07:48:30,494 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1071 transitions. Word has length 56 [2021-08-27 07:48:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:30,494 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1071 transitions. [2021-08-27 07:48:30,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2021-08-27 07:48:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1071 transitions. [2021-08-27 07:48:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 07:48:30,496 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:30,497 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:30,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-27 07:48:30,497 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:30,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:30,497 INFO L82 PathProgramCache]: Analyzing trace with hash 767096470, now seen corresponding path program 1 times [2021-08-27 07:48:30,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:30,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001128450] [2021-08-27 07:48:30,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:30,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-08-27 07:48:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:48:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:30,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:30,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001128450] [2021-08-27 07:48:30,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001128450] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:30,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:30,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 07:48:30,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646499422] [2021-08-27 07:48:30,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 07:48:30,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:30,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 07:48:30,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-08-27 07:48:30,694 INFO L87 Difference]: Start difference. First operand 789 states and 1071 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:32,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:32,733 INFO L93 Difference]: Finished difference Result 1013 states and 1405 transitions. [2021-08-27 07:48:32,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:48:32,734 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2021-08-27 07:48:32,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:32,737 INFO L225 Difference]: With dead ends: 1013 [2021-08-27 07:48:32,737 INFO L226 Difference]: Without dead ends: 1013 [2021-08-27 07:48:32,737 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 204.1ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:48:32,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2021-08-27 07:48:32,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 830. [2021-08-27 07:48:32,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 651 states have (on average 1.337941628264209) internal successors, (871), 662 states have internal predecessors, (871), 105 states have call successors, (105), 53 states have call predecessors, (105), 73 states have return successors, (135), 121 states have call predecessors, (135), 100 states have call successors, (135) [2021-08-27 07:48:32,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1111 transitions. [2021-08-27 07:48:32,751 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1111 transitions. Word has length 61 [2021-08-27 07:48:32,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:32,752 INFO L470 AbstractCegarLoop]: Abstraction has 830 states and 1111 transitions. [2021-08-27 07:48:32,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:32,752 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1111 transitions. [2021-08-27 07:48:32,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-27 07:48:32,754 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:32,754 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:32,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-27 07:48:32,755 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:32,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:32,755 INFO L82 PathProgramCache]: Analyzing trace with hash 83008892, now seen corresponding path program 1 times [2021-08-27 07:48:32,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:32,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266079142] [2021-08-27 07:48:32,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:32,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:32,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:32,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:32,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:32,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-27 07:48:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:33,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:33,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266079142] [2021-08-27 07:48:33,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266079142] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:33,151 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:33,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-08-27 07:48:33,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519340901] [2021-08-27 07:48:33,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 07:48:33,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:33,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 07:48:33,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:48:33,154 INFO L87 Difference]: Start difference. First operand 830 states and 1111 transitions. Second operand has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:48:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:36,765 INFO L93 Difference]: Finished difference Result 995 states and 1380 transitions. [2021-08-27 07:48:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:48:36,765 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2021-08-27 07:48:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:36,768 INFO L225 Difference]: With dead ends: 995 [2021-08-27 07:48:36,768 INFO L226 Difference]: Without dead ends: 974 [2021-08-27 07:48:36,769 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 517.5ms TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2021-08-27 07:48:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-08-27 07:48:36,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 828. [2021-08-27 07:48:36,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 650 states have (on average 1.3369230769230769) internal successors, (869), 661 states have internal predecessors, (869), 104 states have call successors, (104), 53 states have call predecessors, (104), 73 states have return successors, (134), 120 states have call predecessors, (134), 99 states have call successors, (134) [2021-08-27 07:48:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1107 transitions. [2021-08-27 07:48:36,786 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1107 transitions. Word has length 62 [2021-08-27 07:48:36,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:36,786 INFO L470 AbstractCegarLoop]: Abstraction has 828 states and 1107 transitions. [2021-08-27 07:48:36,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:48:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1107 transitions. [2021-08-27 07:48:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 07:48:36,788 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:36,789 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:36,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-27 07:48:36,789 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:36,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:36,789 INFO L82 PathProgramCache]: Analyzing trace with hash -344108715, now seen corresponding path program 1 times [2021-08-27 07:48:36,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:36,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004305776] [2021-08-27 07:48:36,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:36,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:36,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:36,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:37,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:37,199 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004305776] [2021-08-27 07:48:37,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004305776] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:37,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:37,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-08-27 07:48:37,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264371850] [2021-08-27 07:48:37,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 07:48:37,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:37,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 07:48:37,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:48:37,201 INFO L87 Difference]: Start difference. First operand 828 states and 1107 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:48:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:40,248 INFO L93 Difference]: Finished difference Result 993 states and 1376 transitions. [2021-08-27 07:48:40,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:48:40,248 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-08-27 07:48:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:40,251 INFO L225 Difference]: With dead ends: 993 [2021-08-27 07:48:40,251 INFO L226 Difference]: Without dead ends: 970 [2021-08-27 07:48:40,251 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 532.0ms TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2021-08-27 07:48:40,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2021-08-27 07:48:40,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 827. [2021-08-27 07:48:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 649 states have (on average 1.3220338983050848) internal successors, (858), 660 states have internal predecessors, (858), 104 states have call successors, (104), 53 states have call predecessors, (104), 73 states have return successors, (134), 120 states have call predecessors, (134), 99 states have call successors, (134) [2021-08-27 07:48:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1096 transitions. [2021-08-27 07:48:40,265 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1096 transitions. Word has length 59 [2021-08-27 07:48:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:40,266 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1096 transitions. [2021-08-27 07:48:40,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:48:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1096 transitions. [2021-08-27 07:48:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-08-27 07:48:40,268 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:40,268 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:40,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-08-27 07:48:40,268 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:40,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:40,269 INFO L82 PathProgramCache]: Analyzing trace with hash 562449349, now seen corresponding path program 1 times [2021-08-27 07:48:40,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:40,269 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268687312] [2021-08-27 07:48:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:40,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:40,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:40,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268687312] [2021-08-27 07:48:40,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268687312] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:40,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:40,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:48:40,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116505925] [2021-08-27 07:48:40,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:48:40,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:40,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:48:40,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:40,566 INFO L87 Difference]: Start difference. First operand 827 states and 1096 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:43,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:43,596 INFO L93 Difference]: Finished difference Result 982 states and 1350 transitions. [2021-08-27 07:48:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:48:43,597 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2021-08-27 07:48:43,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:43,599 INFO L225 Difference]: With dead ends: 982 [2021-08-27 07:48:43,599 INFO L226 Difference]: Without dead ends: 965 [2021-08-27 07:48:43,599 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 214.3ms TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:48:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2021-08-27 07:48:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 824. [2021-08-27 07:48:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 647 states have (on average 1.321483771251932) internal successors, (855), 658 states have internal predecessors, (855), 103 states have call successors, (103), 53 states have call predecessors, (103), 73 states have return successors, (133), 119 states have call predecessors, (133), 98 states have call successors, (133) [2021-08-27 07:48:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1091 transitions. [2021-08-27 07:48:43,612 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1091 transitions. Word has length 58 [2021-08-27 07:48:43,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:43,612 INFO L470 AbstractCegarLoop]: Abstraction has 824 states and 1091 transitions. [2021-08-27 07:48:43,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2021-08-27 07:48:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1091 transitions. [2021-08-27 07:48:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-08-27 07:48:43,614 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:43,614 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:43,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-08-27 07:48:43,615 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:43,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:43,615 INFO L82 PathProgramCache]: Analyzing trace with hash 608641290, now seen corresponding path program 1 times [2021-08-27 07:48:43,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:43,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166779322] [2021-08-27 07:48:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:43,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:43,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:43,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:43,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:43,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:43,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:43,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:43,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:48:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:43,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:43,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166779322] [2021-08-27 07:48:43,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166779322] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:43,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:43,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:48:43,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234790693] [2021-08-27 07:48:43,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:48:43,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:43,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:48:43,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:43,927 INFO L87 Difference]: Start difference. First operand 824 states and 1091 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 8 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-08-27 07:48:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:46,844 INFO L93 Difference]: Finished difference Result 986 states and 1351 transitions. [2021-08-27 07:48:46,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:48:46,844 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 8 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-08-27 07:48:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:46,846 INFO L225 Difference]: With dead ends: 986 [2021-08-27 07:48:46,846 INFO L226 Difference]: Without dead ends: 950 [2021-08-27 07:48:46,847 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 459.0ms TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:48:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2021-08-27 07:48:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 812. [2021-08-27 07:48:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 638 states have (on average 1.316614420062696) internal successors, (840), 649 states have internal predecessors, (840), 100 states have call successors, (100), 53 states have call predecessors, (100), 73 states have return successors, (130), 116 states have call predecessors, (130), 95 states have call successors, (130) [2021-08-27 07:48:46,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1070 transitions. [2021-08-27 07:48:46,859 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1070 transitions. Word has length 59 [2021-08-27 07:48:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:46,859 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1070 transitions. [2021-08-27 07:48:46,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 8 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-08-27 07:48:46,860 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1070 transitions. [2021-08-27 07:48:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 07:48:46,861 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:46,862 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:46,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-08-27 07:48:46,862 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:46,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:46,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1848378613, now seen corresponding path program 1 times [2021-08-27 07:48:46,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:46,863 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383177833] [2021-08-27 07:48:46,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:46,863 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:46,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:46,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:47,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:47,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:47,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:47,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:47,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:48:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:47,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:47,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:47,104 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383177833] [2021-08-27 07:48:47,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383177833] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:47,105 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:47,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:48:47,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306036194] [2021-08-27 07:48:47,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:48:47,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:47,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:48:47,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:48:47,106 INFO L87 Difference]: Start difference. First operand 812 states and 1070 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:48,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:48,863 INFO L93 Difference]: Finished difference Result 1011 states and 1408 transitions. [2021-08-27 07:48:48,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:48:48,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2021-08-27 07:48:48,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:48,866 INFO L225 Difference]: With dead ends: 1011 [2021-08-27 07:48:48,866 INFO L226 Difference]: Without dead ends: 1011 [2021-08-27 07:48:48,866 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 310.3ms TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:48:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-08-27 07:48:48,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 819. [2021-08-27 07:48:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 643 states have (on average 1.317262830482115) internal successors, (847), 655 states have internal predecessors, (847), 101 states have call successors, (101), 53 states have call predecessors, (101), 74 states have return successors, (137), 117 states have call predecessors, (137), 96 states have call successors, (137) [2021-08-27 07:48:48,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1085 transitions. [2021-08-27 07:48:48,880 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1085 transitions. Word has length 60 [2021-08-27 07:48:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:48,880 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1085 transitions. [2021-08-27 07:48:48,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1085 transitions. [2021-08-27 07:48:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 07:48:48,883 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:48,883 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:48,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-08-27 07:48:48,883 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:48,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2123138227, now seen corresponding path program 1 times [2021-08-27 07:48:48,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:48,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320672691] [2021-08-27 07:48:48,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:48,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:48,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:49,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:48:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:49,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:49,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:49,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320672691] [2021-08-27 07:48:49,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320672691] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:49,195 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:49,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:48:49,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660177038] [2021-08-27 07:48:49,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:48:49,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:49,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:48:49,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:49,196 INFO L87 Difference]: Start difference. First operand 819 states and 1085 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:51,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:51,731 INFO L93 Difference]: Finished difference Result 980 states and 1354 transitions. [2021-08-27 07:48:51,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:48:51,731 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (9), 9 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 60 [2021-08-27 07:48:51,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:51,733 INFO L225 Difference]: With dead ends: 980 [2021-08-27 07:48:51,733 INFO L226 Difference]: Without dead ends: 958 [2021-08-27 07:48:51,733 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 281.3ms TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:51,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-08-27 07:48:51,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 817. [2021-08-27 07:48:51,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 642 states have (on average 1.3161993769470406) internal successors, (845), 654 states have internal predecessors, (845), 100 states have call successors, (100), 53 states have call predecessors, (100), 74 states have return successors, (136), 116 states have call predecessors, (136), 95 states have call successors, (136) [2021-08-27 07:48:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1081 transitions. [2021-08-27 07:48:51,744 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1081 transitions. Word has length 60 [2021-08-27 07:48:51,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:51,745 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1081 transitions. [2021-08-27 07:48:51,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:51,745 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1081 transitions. [2021-08-27 07:48:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 07:48:51,747 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:51,747 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:51,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-08-27 07:48:51,747 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:51,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1629190440, now seen corresponding path program 1 times [2021-08-27 07:48:51,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:51,748 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187016191] [2021-08-27 07:48:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:51,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:51,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:51,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:51,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:51,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:51,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:48:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:52,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:52,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:52,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187016191] [2021-08-27 07:48:52,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187016191] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:52,007 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:52,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 07:48:52,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633312772] [2021-08-27 07:48:52,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-27 07:48:52,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 07:48:52,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:48:52,008 INFO L87 Difference]: Start difference. First operand 817 states and 1081 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 4 states have internal predecessors, (46), 2 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-08-27 07:48:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:53,937 INFO L93 Difference]: Finished difference Result 960 states and 1328 transitions. [2021-08-27 07:48:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:48:53,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 4 states have internal predecessors, (46), 2 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-08-27 07:48:53,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:53,939 INFO L225 Difference]: With dead ends: 960 [2021-08-27 07:48:53,939 INFO L226 Difference]: Without dead ends: 960 [2021-08-27 07:48:53,939 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 293.5ms TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:48:53,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-08-27 07:48:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 817. [2021-08-27 07:48:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 642 states have (on average 1.3146417445482865) internal successors, (844), 654 states have internal predecessors, (844), 100 states have call successors, (100), 53 states have call predecessors, (100), 74 states have return successors, (136), 116 states have call predecessors, (136), 95 states have call successors, (136) [2021-08-27 07:48:53,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1080 transitions. [2021-08-27 07:48:53,951 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1080 transitions. Word has length 60 [2021-08-27 07:48:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:53,951 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1080 transitions. [2021-08-27 07:48:53,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 4 states have internal predecessors, (46), 2 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-08-27 07:48:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1080 transitions. [2021-08-27 07:48:53,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-08-27 07:48:53,953 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:53,953 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:53,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-08-27 07:48:53,954 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:53,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:53,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2138663530, now seen corresponding path program 1 times [2021-08-27 07:48:53,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:53,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123608336] [2021-08-27 07:48:53,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:53,955 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:48:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:54,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:54,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123608336] [2021-08-27 07:48:54,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123608336] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:54,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:54,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:48:54,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789707610] [2021-08-27 07:48:54,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:48:54,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:54,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:48:54,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:48:54,300 INFO L87 Difference]: Start difference. First operand 817 states and 1080 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 8 states have internal predecessors, (46), 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-08-27 07:48:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:56,796 INFO L93 Difference]: Finished difference Result 996 states and 1375 transitions. [2021-08-27 07:48:56,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-27 07:48:56,797 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 8 states have internal predecessors, (46), 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 60 [2021-08-27 07:48:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:56,799 INFO L225 Difference]: With dead ends: 996 [2021-08-27 07:48:56,799 INFO L226 Difference]: Without dead ends: 947 [2021-08-27 07:48:56,799 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 459.4ms TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:48:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2021-08-27 07:48:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 809. [2021-08-27 07:48:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 636 states have (on average 1.309748427672956) internal successors, (833), 648 states have internal predecessors, (833), 98 states have call successors, (98), 53 states have call predecessors, (98), 74 states have return successors, (134), 114 states have call predecessors, (134), 93 states have call successors, (134) [2021-08-27 07:48:56,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1065 transitions. [2021-08-27 07:48:56,810 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1065 transitions. Word has length 60 [2021-08-27 07:48:56,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:56,811 INFO L470 AbstractCegarLoop]: Abstraction has 809 states and 1065 transitions. [2021-08-27 07:48:56,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 8 states have internal predecessors, (46), 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-08-27 07:48:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1065 transitions. [2021-08-27 07:48:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-08-27 07:48:56,813 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:56,813 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:56,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-08-27 07:48:56,813 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:56,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:56,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1395686416, now seen corresponding path program 1 times [2021-08-27 07:48:56,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:56,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676135626] [2021-08-27 07:48:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:56,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:56,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:56,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:56,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:56,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:56,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:48:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:57,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:48:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:57,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:57,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676135626] [2021-08-27 07:48:57,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676135626] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:57,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:57,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:48:57,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506398054] [2021-08-27 07:48:57,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:48:57,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:57,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:48:57,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:48:57,055 INFO L87 Difference]: Start difference. First operand 809 states and 1065 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:48:59,162 INFO L93 Difference]: Finished difference Result 963 states and 1346 transitions. [2021-08-27 07:48:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:48:59,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2021-08-27 07:48:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:48:59,164 INFO L225 Difference]: With dead ends: 963 [2021-08-27 07:48:59,164 INFO L226 Difference]: Without dead ends: 961 [2021-08-27 07:48:59,165 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 376.8ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:48:59,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2021-08-27 07:48:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 813. [2021-08-27 07:48:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 638 states have (on average 1.3087774294670846) internal successors, (835), 652 states have internal predecessors, (835), 98 states have call successors, (98), 53 states have call predecessors, (98), 76 states have return successors, (150), 114 states have call predecessors, (150), 93 states have call successors, (150) [2021-08-27 07:48:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1083 transitions. [2021-08-27 07:48:59,177 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1083 transitions. Word has length 61 [2021-08-27 07:48:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:48:59,177 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 1083 transitions. [2021-08-27 07:48:59,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:48:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1083 transitions. [2021-08-27 07:48:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:48:59,179 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:48:59,179 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:48:59,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-08-27 07:48:59,180 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:48:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:48:59,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2057360036, now seen corresponding path program 1 times [2021-08-27 07:48:59,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:48:59,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531999216] [2021-08-27 07:48:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:48:59,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:48:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:59,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:48:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:48:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:59,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:48:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:48:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:59,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:48:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:59,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:48:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:59,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:48:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:48:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:48:59,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:48:59,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531999216] [2021-08-27 07:48:59,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531999216] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:48:59,571 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:48:59,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:48:59,572 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522534012] [2021-08-27 07:48:59,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:48:59,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:48:59,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:48:59,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:48:59,574 INFO L87 Difference]: Start difference. First operand 813 states and 1083 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:02,760 INFO L93 Difference]: Finished difference Result 965 states and 1341 transitions. [2021-08-27 07:49:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:49:02,760 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2021-08-27 07:49:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:02,762 INFO L225 Difference]: With dead ends: 965 [2021-08-27 07:49:02,762 INFO L226 Difference]: Without dead ends: 938 [2021-08-27 07:49:02,763 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 277.3ms TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2021-08-27 07:49:02,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 802. [2021-08-27 07:49:02,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 630 states have (on average 1.3095238095238095) internal successors, (825), 644 states have internal predecessors, (825), 96 states have call successors, (96), 53 states have call predecessors, (96), 75 states have return successors, (147), 111 states have call predecessors, (147), 91 states have call successors, (147) [2021-08-27 07:49:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1068 transitions. [2021-08-27 07:49:02,774 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1068 transitions. Word has length 69 [2021-08-27 07:49:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:02,775 INFO L470 AbstractCegarLoop]: Abstraction has 802 states and 1068 transitions. [2021-08-27 07:49:02,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1068 transitions. [2021-08-27 07:49:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:49:02,777 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:02,777 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:02,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-08-27 07:49:02,777 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:02,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:02,778 INFO L82 PathProgramCache]: Analyzing trace with hash 670644494, now seen corresponding path program 1 times [2021-08-27 07:49:02,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:02,778 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871710052] [2021-08-27 07:49:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:02,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:02,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:02,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:03,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:03,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:03,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871710052] [2021-08-27 07:49:03,139 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871710052] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:03,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:03,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:49:03,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383650941] [2021-08-27 07:49:03,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:49:03,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:03,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:49:03,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:49:03,142 INFO L87 Difference]: Start difference. First operand 802 states and 1068 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:05,848 INFO L93 Difference]: Finished difference Result 952 states and 1322 transitions. [2021-08-27 07:49:05,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:49:05,849 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2021-08-27 07:49:05,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:05,851 INFO L225 Difference]: With dead ends: 952 [2021-08-27 07:49:05,851 INFO L226 Difference]: Without dead ends: 933 [2021-08-27 07:49:05,852 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 306.0ms TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:49:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2021-08-27 07:49:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 797. [2021-08-27 07:49:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 627 states have (on average 1.3094098883572567) internal successors, (821), 641 states have internal predecessors, (821), 95 states have call successors, (95), 53 states have call predecessors, (95), 74 states have return successors, (145), 109 states have call predecessors, (145), 90 states have call successors, (145) [2021-08-27 07:49:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1061 transitions. [2021-08-27 07:49:05,864 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1061 transitions. Word has length 63 [2021-08-27 07:49:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:05,864 INFO L470 AbstractCegarLoop]: Abstraction has 797 states and 1061 transitions. [2021-08-27 07:49:05,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1061 transitions. [2021-08-27 07:49:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-08-27 07:49:05,866 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:05,866 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:05,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-08-27 07:49:05,867 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:05,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:05,867 INFO L82 PathProgramCache]: Analyzing trace with hash -419081547, now seen corresponding path program 1 times [2021-08-27 07:49:05,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:05,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749388987] [2021-08-27 07:49:05,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:05,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:05,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:06,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:06,215 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749388987] [2021-08-27 07:49:06,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749388987] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:06,215 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:06,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:49:06,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845544738] [2021-08-27 07:49:06,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:49:06,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:06,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:49:06,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:49:06,217 INFO L87 Difference]: Start difference. First operand 797 states and 1061 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:09,492 INFO L93 Difference]: Finished difference Result 947 states and 1315 transitions. [2021-08-27 07:49:09,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:49:09,493 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2021-08-27 07:49:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:09,495 INFO L225 Difference]: With dead ends: 947 [2021-08-27 07:49:09,495 INFO L226 Difference]: Without dead ends: 928 [2021-08-27 07:49:09,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 279.1ms TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2021-08-27 07:49:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 792. [2021-08-27 07:49:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 624 states have (on average 1.3092948717948718) internal successors, (817), 638 states have internal predecessors, (817), 94 states have call successors, (94), 53 states have call predecessors, (94), 73 states have return successors, (143), 107 states have call predecessors, (143), 89 states have call successors, (143) [2021-08-27 07:49:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1054 transitions. [2021-08-27 07:49:09,507 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1054 transitions. Word has length 62 [2021-08-27 07:49:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:09,507 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 1054 transitions. [2021-08-27 07:49:09,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1054 transitions. [2021-08-27 07:49:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:49:09,509 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:09,509 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:09,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-08-27 07:49:09,510 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash -769242967, now seen corresponding path program 1 times [2021-08-27 07:49:09,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:09,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220625566] [2021-08-27 07:49:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:09,511 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:09,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:09,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:09,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:09,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:09,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:09,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:09,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:09,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:09,900 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220625566] [2021-08-27 07:49:09,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220625566] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:09,900 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:09,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-08-27 07:49:09,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777655434] [2021-08-27 07:49:09,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 07:49:09,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:09,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 07:49:09,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:49:09,901 INFO L87 Difference]: Start difference. First operand 792 states and 1054 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:49:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:13,219 INFO L93 Difference]: Finished difference Result 947 states and 1313 transitions. [2021-08-27 07:49:13,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:49:13,220 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2021-08-27 07:49:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:13,222 INFO L225 Difference]: With dead ends: 947 [2021-08-27 07:49:13,222 INFO L226 Difference]: Without dead ends: 926 [2021-08-27 07:49:13,222 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 496.6ms TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2021-08-27 07:49:13,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2021-08-27 07:49:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 790. [2021-08-27 07:49:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 623 states have (on average 1.3081861958266452) internal successors, (815), 637 states have internal predecessors, (815), 93 states have call successors, (93), 53 states have call predecessors, (93), 73 states have return successors, (142), 106 states have call predecessors, (142), 88 states have call successors, (142) [2021-08-27 07:49:13,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1050 transitions. [2021-08-27 07:49:13,234 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1050 transitions. Word has length 63 [2021-08-27 07:49:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:13,234 INFO L470 AbstractCegarLoop]: Abstraction has 790 states and 1050 transitions. [2021-08-27 07:49:13,235 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:49:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1050 transitions. [2021-08-27 07:49:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-08-27 07:49:13,237 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:13,237 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:13,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-08-27 07:49:13,237 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash -2006522547, now seen corresponding path program 1 times [2021-08-27 07:49:13,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:13,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314210307] [2021-08-27 07:49:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:13,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:13,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:13,471 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314210307] [2021-08-27 07:49:13,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314210307] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:13,472 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:13,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:13,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534952344] [2021-08-27 07:49:13,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:13,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:13,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:13,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:13,473 INFO L87 Difference]: Start difference. First operand 790 states and 1050 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:14,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:14,826 INFO L93 Difference]: Finished difference Result 791 states and 1049 transitions. [2021-08-27 07:49:14,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 07:49:14,826 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2021-08-27 07:49:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:14,828 INFO L225 Difference]: With dead ends: 791 [2021-08-27 07:49:14,828 INFO L226 Difference]: Without dead ends: 787 [2021-08-27 07:49:14,828 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 236.1ms TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2021-08-27 07:49:14,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2021-08-27 07:49:14,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 682. [2021-08-27 07:49:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 538 states have (on average 1.2992565055762082) internal successors, (699), 551 states have internal predecessors, (699), 81 states have call successors, (81), 47 states have call predecessors, (81), 62 states have return successors, (101), 90 states have call predecessors, (101), 76 states have call successors, (101) [2021-08-27 07:49:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 881 transitions. [2021-08-27 07:49:14,835 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 881 transitions. Word has length 63 [2021-08-27 07:49:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:14,835 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 881 transitions. [2021-08-27 07:49:14,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 881 transitions. [2021-08-27 07:49:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-27 07:49:14,837 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:14,837 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:14,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-08-27 07:49:14,838 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:14,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:14,838 INFO L82 PathProgramCache]: Analyzing trace with hash 2050162991, now seen corresponding path program 1 times [2021-08-27 07:49:14,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:14,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038254612] [2021-08-27 07:49:14,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:14,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:14,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 07:49:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:49:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:15,059 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:15,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038254612] [2021-08-27 07:49:15,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038254612] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:15,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:15,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 07:49:15,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456049809] [2021-08-27 07:49:15,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 07:49:15,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:15,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 07:49:15,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-27 07:49:15,061 INFO L87 Difference]: Start difference. First operand 682 states and 881 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-08-27 07:49:16,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:16,178 INFO L93 Difference]: Finished difference Result 752 states and 991 transitions. [2021-08-27 07:49:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 07:49:16,179 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 66 [2021-08-27 07:49:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:16,180 INFO L225 Difference]: With dead ends: 752 [2021-08-27 07:49:16,180 INFO L226 Difference]: Without dead ends: 752 [2021-08-27 07:49:16,181 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 170.3ms TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:16,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2021-08-27 07:49:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 682. [2021-08-27 07:49:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 538 states have (on average 1.295539033457249) internal successors, (697), 551 states have internal predecessors, (697), 81 states have call successors, (81), 47 states have call predecessors, (81), 62 states have return successors, (101), 90 states have call predecessors, (101), 76 states have call successors, (101) [2021-08-27 07:49:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 879 transitions. [2021-08-27 07:49:16,189 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 879 transitions. Word has length 66 [2021-08-27 07:49:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:16,189 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 879 transitions. [2021-08-27 07:49:16,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2021-08-27 07:49:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 879 transitions. [2021-08-27 07:49:16,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 07:49:16,191 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:16,191 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:16,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-08-27 07:49:16,191 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:16,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:16,192 INFO L82 PathProgramCache]: Analyzing trace with hash -520129943, now seen corresponding path program 1 times [2021-08-27 07:49:16,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:16,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093629659] [2021-08-27 07:49:16,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:16,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:16,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:16,588 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093629659] [2021-08-27 07:49:16,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093629659] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:16,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:16,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-27 07:49:16,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796009528] [2021-08-27 07:49:16,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:49:16,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:16,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:49:16,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:16,590 INFO L87 Difference]: Start difference. First operand 682 states and 879 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:19,308 INFO L93 Difference]: Finished difference Result 773 states and 1013 transitions. [2021-08-27 07:49:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:49:19,308 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2021-08-27 07:49:19,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:19,310 INFO L225 Difference]: With dead ends: 773 [2021-08-27 07:49:19,310 INFO L226 Difference]: Without dead ends: 751 [2021-08-27 07:49:19,310 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 521.7ms TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:49:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2021-08-27 07:49:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 680. [2021-08-27 07:49:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 537 states have (on average 1.2942271880819367) internal successors, (695), 550 states have internal predecessors, (695), 80 states have call successors, (80), 47 states have call predecessors, (80), 62 states have return successors, (100), 89 states have call predecessors, (100), 75 states have call successors, (100) [2021-08-27 07:49:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 875 transitions. [2021-08-27 07:49:19,319 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 875 transitions. Word has length 67 [2021-08-27 07:49:19,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:19,319 INFO L470 AbstractCegarLoop]: Abstraction has 680 states and 875 transitions. [2021-08-27 07:49:19,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 875 transitions. [2021-08-27 07:49:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-27 07:49:19,321 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:19,321 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:19,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-08-27 07:49:19,321 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:19,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:19,322 INFO L82 PathProgramCache]: Analyzing trace with hash -82376893, now seen corresponding path program 1 times [2021-08-27 07:49:19,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:19,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557522406] [2021-08-27 07:49:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:19,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:49:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:19,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:19,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557522406] [2021-08-27 07:49:19,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557522406] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:19,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:19,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-27 07:49:19,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354953631] [2021-08-27 07:49:19,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:49:19,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:19,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:49:19,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:19,741 INFO L87 Difference]: Start difference. First operand 680 states and 875 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:22,377 INFO L93 Difference]: Finished difference Result 768 states and 1004 transitions. [2021-08-27 07:49:22,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:49:22,378 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 66 [2021-08-27 07:49:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:22,379 INFO L225 Difference]: With dead ends: 768 [2021-08-27 07:49:22,380 INFO L226 Difference]: Without dead ends: 746 [2021-08-27 07:49:22,380 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 548.2ms TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:49:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2021-08-27 07:49:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 678. [2021-08-27 07:49:22,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 536 states have (on average 1.2929104477611941) internal successors, (693), 549 states have internal predecessors, (693), 79 states have call successors, (79), 47 states have call predecessors, (79), 62 states have return successors, (99), 88 states have call predecessors, (99), 74 states have call successors, (99) [2021-08-27 07:49:22,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 871 transitions. [2021-08-27 07:49:22,387 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 871 transitions. Word has length 66 [2021-08-27 07:49:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:22,388 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 871 transitions. [2021-08-27 07:49:22,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:22,388 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 871 transitions. [2021-08-27 07:49:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-08-27 07:49:22,389 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:22,389 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:22,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-08-27 07:49:22,390 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:22,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:22,390 INFO L82 PathProgramCache]: Analyzing trace with hash 618276496, now seen corresponding path program 1 times [2021-08-27 07:49:22,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:22,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92981267] [2021-08-27 07:49:22,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:22,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:49:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:22,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:22,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92981267] [2021-08-27 07:49:22,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92981267] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:22,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:22,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:22,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542216291] [2021-08-27 07:49:22,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:22,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:22,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:22,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:22,645 INFO L87 Difference]: Start difference. First operand 678 states and 871 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:49:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:24,246 INFO L93 Difference]: Finished difference Result 770 states and 1009 transitions. [2021-08-27 07:49:24,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:49:24,247 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2021-08-27 07:49:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:24,249 INFO L225 Difference]: With dead ends: 770 [2021-08-27 07:49:24,249 INFO L226 Difference]: Without dead ends: 770 [2021-08-27 07:49:24,249 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 481.9ms TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:49:24,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2021-08-27 07:49:24,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 684. [2021-08-27 07:49:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 541 states have (on average 1.2920517560073936) internal successors, (699), 554 states have internal predecessors, (699), 80 states have call successors, (80), 47 states have call predecessors, (80), 62 states have return successors, (100), 89 states have call predecessors, (100), 75 states have call successors, (100) [2021-08-27 07:49:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 879 transitions. [2021-08-27 07:49:24,258 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 879 transitions. Word has length 65 [2021-08-27 07:49:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:24,259 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 879 transitions. [2021-08-27 07:49:24,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-08-27 07:49:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 879 transitions. [2021-08-27 07:49:24,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-27 07:49:24,260 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:24,261 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:24,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-08-27 07:49:24,261 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:24,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:24,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1141037193, now seen corresponding path program 1 times [2021-08-27 07:49:24,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:24,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842226547] [2021-08-27 07:49:24,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:24,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-08-27 07:49:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:24,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:24,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842226547] [2021-08-27 07:49:24,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842226547] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:24,514 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:24,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:24,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103189035] [2021-08-27 07:49:24,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:24,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:24,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:24,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:24,519 INFO L87 Difference]: Start difference. First operand 684 states and 879 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:26,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:26,284 INFO L93 Difference]: Finished difference Result 754 states and 985 transitions. [2021-08-27 07:49:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:49:26,284 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2021-08-27 07:49:26,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:26,286 INFO L225 Difference]: With dead ends: 754 [2021-08-27 07:49:26,286 INFO L226 Difference]: Without dead ends: 754 [2021-08-27 07:49:26,286 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 425.1ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2021-08-27 07:49:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 684. [2021-08-27 07:49:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 541 states have (on average 1.2883548983364141) internal successors, (697), 554 states have internal predecessors, (697), 80 states have call successors, (80), 47 states have call predecessors, (80), 62 states have return successors, (100), 89 states have call predecessors, (100), 75 states have call successors, (100) [2021-08-27 07:49:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 877 transitions. [2021-08-27 07:49:26,293 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 877 transitions. Word has length 66 [2021-08-27 07:49:26,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:26,293 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 877 transitions. [2021-08-27 07:49:26,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 877 transitions. [2021-08-27 07:49:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-08-27 07:49:26,295 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:26,295 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:26,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-08-27 07:49:26,296 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:26,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1842637067, now seen corresponding path program 1 times [2021-08-27 07:49:26,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:26,296 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913855158] [2021-08-27 07:49:26,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:26,297 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-08-27 07:49:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:26,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:26,596 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913855158] [2021-08-27 07:49:26,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913855158] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:26,596 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:26,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-27 07:49:26,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279628769] [2021-08-27 07:49:26,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-27 07:49:26,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:26,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-27 07:49:26,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:49:26,598 INFO L87 Difference]: Start difference. First operand 684 states and 877 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:28,710 INFO L93 Difference]: Finished difference Result 776 states and 1010 transitions. [2021-08-27 07:49:28,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:49:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (9), 9 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 66 [2021-08-27 07:49:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:28,712 INFO L225 Difference]: With dead ends: 776 [2021-08-27 07:49:28,712 INFO L226 Difference]: Without dead ends: 702 [2021-08-27 07:49:28,713 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 349.3ms TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:49:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2021-08-27 07:49:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 647. [2021-08-27 07:49:28,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 511 states have (on average 1.273972602739726) internal successors, (651), 524 states have internal predecessors, (651), 73 states have call successors, (73), 47 states have call predecessors, (73), 62 states have return successors, (92), 82 states have call predecessors, (92), 68 states have call successors, (92) [2021-08-27 07:49:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 816 transitions. [2021-08-27 07:49:28,721 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 816 transitions. Word has length 66 [2021-08-27 07:49:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:28,722 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 816 transitions. [2021-08-27 07:49:28,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 816 transitions. [2021-08-27 07:49:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 07:49:28,723 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:28,723 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:28,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-08-27 07:49:28,724 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:28,724 INFO L82 PathProgramCache]: Analyzing trace with hash -958641691, now seen corresponding path program 1 times [2021-08-27 07:49:28,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:28,724 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487885973] [2021-08-27 07:49:28,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:28,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-08-27 07:49:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:28,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:28,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487885973] [2021-08-27 07:49:28,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487885973] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:28,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:28,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:28,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955091449] [2021-08-27 07:49:28,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:28,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:28,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:28,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:28,967 INFO L87 Difference]: Start difference. First operand 647 states and 816 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:30,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:30,269 INFO L93 Difference]: Finished difference Result 696 states and 891 transitions. [2021-08-27 07:49:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:30,270 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2021-08-27 07:49:30,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:30,271 INFO L225 Difference]: With dead ends: 696 [2021-08-27 07:49:30,271 INFO L226 Difference]: Without dead ends: 691 [2021-08-27 07:49:30,271 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 377.5ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:49:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2021-08-27 07:49:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 642. [2021-08-27 07:49:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 507 states have (on average 1.2741617357001973) internal successors, (646), 520 states have internal predecessors, (646), 72 states have call successors, (72), 47 states have call predecessors, (72), 62 states have return successors, (91), 81 states have call predecessors, (91), 67 states have call successors, (91) [2021-08-27 07:49:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 809 transitions. [2021-08-27 07:49:30,277 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 809 transitions. Word has length 67 [2021-08-27 07:49:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:30,277 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 809 transitions. [2021-08-27 07:49:30,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 809 transitions. [2021-08-27 07:49:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-27 07:49:30,278 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:30,278 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:30,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-08-27 07:49:30,278 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:30,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:30,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1812691366, now seen corresponding path program 1 times [2021-08-27 07:49:30,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:30,279 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860906097] [2021-08-27 07:49:30,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:30,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:30,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:30,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860906097] [2021-08-27 07:49:30,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860906097] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:30,512 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:30,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-27 07:49:30,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681591169] [2021-08-27 07:49:30,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 07:49:30,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:30,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 07:49:30,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-08-27 07:49:30,514 INFO L87 Difference]: Start difference. First operand 642 states and 809 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:31,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:31,885 INFO L93 Difference]: Finished difference Result 807 states and 1030 transitions. [2021-08-27 07:49:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 07:49:31,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2021-08-27 07:49:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:31,887 INFO L225 Difference]: With dead ends: 807 [2021-08-27 07:49:31,887 INFO L226 Difference]: Without dead ends: 807 [2021-08-27 07:49:31,887 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 254.5ms TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-08-27 07:49:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 684. [2021-08-27 07:49:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 539 states have (on average 1.2671614100185529) internal successors, (683), 554 states have internal predecessors, (683), 74 states have call successors, (74), 49 states have call predecessors, (74), 70 states have return successors, (99), 89 states have call predecessors, (99), 69 states have call successors, (99) [2021-08-27 07:49:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 856 transitions. [2021-08-27 07:49:31,893 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 856 transitions. Word has length 67 [2021-08-27 07:49:31,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:31,894 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 856 transitions. [2021-08-27 07:49:31,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:31,894 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 856 transitions. [2021-08-27 07:49:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-08-27 07:49:31,895 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:31,895 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:31,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-08-27 07:49:31,896 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:31,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash 85012280, now seen corresponding path program 1 times [2021-08-27 07:49:31,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:31,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189211703] [2021-08-27 07:49:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:31,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:32,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-08-27 07:49:32,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:32,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189211703] [2021-08-27 07:49:32,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189211703] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:32,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:32,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:32,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465512248] [2021-08-27 07:49:32,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:32,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:32,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:32,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:32,174 INFO L87 Difference]: Start difference. First operand 684 states and 856 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:33,722 INFO L93 Difference]: Finished difference Result 805 states and 1027 transitions. [2021-08-27 07:49:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:49:33,722 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 9 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 68 [2021-08-27 07:49:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:33,723 INFO L225 Difference]: With dead ends: 805 [2021-08-27 07:49:33,724 INFO L226 Difference]: Without dead ends: 805 [2021-08-27 07:49:33,724 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 554.0ms TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:49:33,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-08-27 07:49:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 684. [2021-08-27 07:49:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 539 states have (on average 1.2653061224489797) internal successors, (682), 554 states have internal predecessors, (682), 74 states have call successors, (74), 49 states have call predecessors, (74), 70 states have return successors, (99), 89 states have call predecessors, (99), 69 states have call successors, (99) [2021-08-27 07:49:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 855 transitions. [2021-08-27 07:49:33,731 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 855 transitions. Word has length 68 [2021-08-27 07:49:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:33,731 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 855 transitions. [2021-08-27 07:49:33,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 855 transitions. [2021-08-27 07:49:33,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-27 07:49:33,733 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:33,733 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:33,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-08-27 07:49:33,733 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:33,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:33,734 INFO L82 PathProgramCache]: Analyzing trace with hash 882393394, now seen corresponding path program 1 times [2021-08-27 07:49:33,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:33,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191025292] [2021-08-27 07:49:33,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:33,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:33,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:33,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:49:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:49:34,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:34,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:34,140 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191025292] [2021-08-27 07:49:34,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191025292] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:34,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:34,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-27 07:49:34,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64645103] [2021-08-27 07:49:34,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:49:34,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:34,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:49:34,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:34,143 INFO L87 Difference]: Start difference. First operand 684 states and 855 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-27 07:49:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:36,481 INFO L93 Difference]: Finished difference Result 770 states and 979 transitions. [2021-08-27 07:49:36,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:49:36,482 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2021-08-27 07:49:36,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:36,483 INFO L225 Difference]: With dead ends: 770 [2021-08-27 07:49:36,483 INFO L226 Difference]: Without dead ends: 748 [2021-08-27 07:49:36,483 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 531.1ms TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:49:36,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-08-27 07:49:36,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 682. [2021-08-27 07:49:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 538 states have (on average 1.2639405204460967) internal successors, (680), 553 states have internal predecessors, (680), 73 states have call successors, (73), 49 states have call predecessors, (73), 70 states have return successors, (98), 88 states have call predecessors, (98), 68 states have call successors, (98) [2021-08-27 07:49:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 851 transitions. [2021-08-27 07:49:36,491 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 851 transitions. Word has length 74 [2021-08-27 07:49:36,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:36,491 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 851 transitions. [2021-08-27 07:49:36,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-27 07:49:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 851 transitions. [2021-08-27 07:49:36,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-27 07:49:36,493 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:36,493 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:36,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-08-27 07:49:36,493 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:36,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:36,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1179932902, now seen corresponding path program 1 times [2021-08-27 07:49:36,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:36,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458730757] [2021-08-27 07:49:36,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:36,494 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:49:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:36,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:36,937 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:36,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458730757] [2021-08-27 07:49:36,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458730757] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:36,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:36,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2021-08-27 07:49:36,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027334114] [2021-08-27 07:49:36,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-27 07:49:36,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:36,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-27 07:49:36,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:49:36,939 INFO L87 Difference]: Start difference. First operand 682 states and 851 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (10), 10 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:39,392 INFO L93 Difference]: Finished difference Result 751 states and 947 transitions. [2021-08-27 07:49:39,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-27 07:49:39,392 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (10), 10 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2021-08-27 07:49:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:39,394 INFO L225 Difference]: With dead ends: 751 [2021-08-27 07:49:39,394 INFO L226 Difference]: Without dead ends: 726 [2021-08-27 07:49:39,394 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 708.2ms TimeCoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2021-08-27 07:49:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2021-08-27 07:49:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 678. [2021-08-27 07:49:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 535 states have (on average 1.263551401869159) internal successors, (676), 550 states have internal predecessors, (676), 72 states have call successors, (72), 49 states have call predecessors, (72), 70 states have return successors, (97), 87 states have call predecessors, (97), 67 states have call successors, (97) [2021-08-27 07:49:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 845 transitions. [2021-08-27 07:49:39,409 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 845 transitions. Word has length 70 [2021-08-27 07:49:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:39,410 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 845 transitions. [2021-08-27 07:49:39,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (10), 10 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 845 transitions. [2021-08-27 07:49:39,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:49:39,411 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:39,411 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:39,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-08-27 07:49:39,412 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:39,412 INFO L82 PathProgramCache]: Analyzing trace with hash -234085728, now seen corresponding path program 1 times [2021-08-27 07:49:39,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:39,413 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191874831] [2021-08-27 07:49:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:39,413 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:39,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:39,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191874831] [2021-08-27 07:49:39,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191874831] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:39,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:39,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:39,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949736044] [2021-08-27 07:49:39,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:39,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:39,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:39,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:39,657 INFO L87 Difference]: Start difference. First operand 678 states and 845 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:40,941 INFO L93 Difference]: Finished difference Result 726 states and 917 transitions. [2021-08-27 07:49:40,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:40,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2021-08-27 07:49:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:40,943 INFO L225 Difference]: With dead ends: 726 [2021-08-27 07:49:40,943 INFO L226 Difference]: Without dead ends: 721 [2021-08-27 07:49:40,943 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 368.2ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:49:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-08-27 07:49:40,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 673. [2021-08-27 07:49:40,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 531 states have (on average 1.2636534839924671) internal successors, (671), 546 states have internal predecessors, (671), 71 states have call successors, (71), 49 states have call predecessors, (71), 70 states have return successors, (96), 86 states have call predecessors, (96), 66 states have call successors, (96) [2021-08-27 07:49:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 838 transitions. [2021-08-27 07:49:40,948 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 838 transitions. Word has length 69 [2021-08-27 07:49:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:40,949 INFO L470 AbstractCegarLoop]: Abstraction has 673 states and 838 transitions. [2021-08-27 07:49:40,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 838 transitions. [2021-08-27 07:49:40,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:49:40,950 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:40,950 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:40,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-08-27 07:49:40,950 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:40,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:40,951 INFO L82 PathProgramCache]: Analyzing trace with hash -354223509, now seen corresponding path program 1 times [2021-08-27 07:49:40,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:40,951 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332329059] [2021-08-27 07:49:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:40,951 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-08-27 07:49:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:41,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:41,271 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332329059] [2021-08-27 07:49:41,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332329059] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:41,271 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:41,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-27 07:49:41,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152974612] [2021-08-27 07:49:41,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 07:49:41,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:41,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 07:49:41,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:49:41,272 INFO L87 Difference]: Start difference. First operand 673 states and 838 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:43,139 INFO L93 Difference]: Finished difference Result 745 states and 938 transitions. [2021-08-27 07:49:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 07:49:43,139 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2021-08-27 07:49:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:43,141 INFO L225 Difference]: With dead ends: 745 [2021-08-27 07:49:43,141 INFO L226 Difference]: Without dead ends: 718 [2021-08-27 07:49:43,142 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 483.5ms TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2021-08-27 07:49:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2021-08-27 07:49:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 670. [2021-08-27 07:49:43,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 529 states have (on average 1.2627599243856333) internal successors, (668), 544 states have internal predecessors, (668), 70 states have call successors, (70), 49 states have call predecessors, (70), 70 states have return successors, (95), 85 states have call predecessors, (95), 65 states have call successors, (95) [2021-08-27 07:49:43,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 833 transitions. [2021-08-27 07:49:43,150 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 833 transitions. Word has length 69 [2021-08-27 07:49:43,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:43,150 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 833 transitions. [2021-08-27 07:49:43,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:43,151 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 833 transitions. [2021-08-27 07:49:43,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:49:43,152 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:43,152 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:43,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-08-27 07:49:43,152 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:43,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:43,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1995059229, now seen corresponding path program 1 times [2021-08-27 07:49:43,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:43,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708246610] [2021-08-27 07:49:43,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:43,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:43,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:43,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:43,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:43,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708246610] [2021-08-27 07:49:43,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708246610] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:43,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:43,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-27 07:49:43,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671933667] [2021-08-27 07:49:43,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 07:49:43,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:43,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 07:49:43,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:49:43,552 INFO L87 Difference]: Start difference. First operand 670 states and 833 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:45,756 INFO L93 Difference]: Finished difference Result 725 states and 912 transitions. [2021-08-27 07:49:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 07:49:45,757 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2021-08-27 07:49:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:45,758 INFO L225 Difference]: With dead ends: 725 [2021-08-27 07:49:45,758 INFO L226 Difference]: Without dead ends: 722 [2021-08-27 07:49:45,758 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 421.0ms TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2021-08-27 07:49:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2021-08-27 07:49:45,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 668. [2021-08-27 07:49:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 527 states have (on average 1.2599620493358634) internal successors, (664), 542 states have internal predecessors, (664), 70 states have call successors, (70), 49 states have call predecessors, (70), 70 states have return successors, (95), 85 states have call predecessors, (95), 65 states have call successors, (95) [2021-08-27 07:49:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 829 transitions. [2021-08-27 07:49:45,780 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 829 transitions. Word has length 69 [2021-08-27 07:49:45,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:45,780 INFO L470 AbstractCegarLoop]: Abstraction has 668 states and 829 transitions. [2021-08-27 07:49:45,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:49:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 829 transitions. [2021-08-27 07:49:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-27 07:49:45,782 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:45,782 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:45,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-08-27 07:49:45,783 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:45,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:45,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1994782399, now seen corresponding path program 1 times [2021-08-27 07:49:45,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:45,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018481104] [2021-08-27 07:49:45,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:45,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:45,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:49:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:46,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:46,056 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018481104] [2021-08-27 07:49:46,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018481104] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:46,057 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:46,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:49:46,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029692538] [2021-08-27 07:49:46,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:49:46,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:46,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:49:46,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:49:46,058 INFO L87 Difference]: Start difference. First operand 668 states and 829 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:47,895 INFO L93 Difference]: Finished difference Result 788 states and 996 transitions. [2021-08-27 07:49:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 07:49:47,895 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), 3 states have call successors, (9), 9 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 69 [2021-08-27 07:49:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:47,896 INFO L225 Difference]: With dead ends: 788 [2021-08-27 07:49:47,896 INFO L226 Difference]: Without dead ends: 730 [2021-08-27 07:49:47,897 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 636.1ms TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:49:47,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2021-08-27 07:49:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 612. [2021-08-27 07:49:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 481 states have (on average 1.2536382536382535) internal successors, (603), 494 states have internal predecessors, (603), 68 states have call successors, (68), 47 states have call predecessors, (68), 62 states have return successors, (87), 77 states have call predecessors, (87), 63 states have call successors, (87) [2021-08-27 07:49:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 758 transitions. [2021-08-27 07:49:47,902 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 758 transitions. Word has length 69 [2021-08-27 07:49:47,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:47,902 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 758 transitions. [2021-08-27 07:49:47,902 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), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:49:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 758 transitions. [2021-08-27 07:49:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:49:47,903 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:47,903 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:47,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-08-27 07:49:47,903 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:47,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1513184160, now seen corresponding path program 1 times [2021-08-27 07:49:47,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:47,904 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929432696] [2021-08-27 07:49:47,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:47,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:47,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:49:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:48,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:48,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929432696] [2021-08-27 07:49:48,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929432696] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:48,171 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:48,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:49:48,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612422759] [2021-08-27 07:49:48,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:49:48,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:48,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:49:48,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:48,172 INFO L87 Difference]: Start difference. First operand 612 states and 758 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:49:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:49,562 INFO L93 Difference]: Finished difference Result 664 states and 835 transitions. [2021-08-27 07:49:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:49:49,563 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2021-08-27 07:49:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:49,566 INFO L225 Difference]: With dead ends: 664 [2021-08-27 07:49:49,566 INFO L226 Difference]: Without dead ends: 664 [2021-08-27 07:49:49,566 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 375.9ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:49:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2021-08-27 07:49:49,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 612. [2021-08-27 07:49:49,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 481 states have (on average 1.2515592515592515) internal successors, (602), 494 states have internal predecessors, (602), 68 states have call successors, (68), 47 states have call predecessors, (68), 62 states have return successors, (87), 77 states have call predecessors, (87), 63 states have call successors, (87) [2021-08-27 07:49:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 757 transitions. [2021-08-27 07:49:49,574 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 757 transitions. Word has length 71 [2021-08-27 07:49:49,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:49,574 INFO L470 AbstractCegarLoop]: Abstraction has 612 states and 757 transitions. [2021-08-27 07:49:49,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:49:49,575 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 757 transitions. [2021-08-27 07:49:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:49:49,576 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:49,576 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:49,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-08-27 07:49:49,576 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:49,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:49,577 INFO L82 PathProgramCache]: Analyzing trace with hash 537799838, now seen corresponding path program 1 times [2021-08-27 07:49:49,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:49,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648065623] [2021-08-27 07:49:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:49,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:49:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:49,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:49,984 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648065623] [2021-08-27 07:49:49,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648065623] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:49,984 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:49,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-27 07:49:49,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757654439] [2021-08-27 07:49:49,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:49:49,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:49,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:49:49,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:49,987 INFO L87 Difference]: Start difference. First operand 612 states and 757 transitions. Second operand has 21 states, 20 states have (on average 2.65) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:52,105 INFO L93 Difference]: Finished difference Result 697 states and 878 transitions. [2021-08-27 07:49:52,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:49:52,106 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2021-08-27 07:49:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:52,107 INFO L225 Difference]: With dead ends: 697 [2021-08-27 07:49:52,107 INFO L226 Difference]: Without dead ends: 662 [2021-08-27 07:49:52,107 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 547.1ms TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:49:52,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-08-27 07:49:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 607. [2021-08-27 07:49:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 477 states have (on average 1.2473794549266248) internal successors, (595), 490 states have internal predecessors, (595), 67 states have call successors, (67), 47 states have call predecessors, (67), 62 states have return successors, (85), 76 states have call predecessors, (85), 62 states have call successors, (85) [2021-08-27 07:49:52,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 747 transitions. [2021-08-27 07:49:52,112 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 747 transitions. Word has length 71 [2021-08-27 07:49:52,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:52,112 INFO L470 AbstractCegarLoop]: Abstraction has 607 states and 747 transitions. [2021-08-27 07:49:52,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2021-08-27 07:49:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 747 transitions. [2021-08-27 07:49:52,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-27 07:49:52,113 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:52,113 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:52,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-08-27 07:49:52,113 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:52,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:52,113 INFO L82 PathProgramCache]: Analyzing trace with hash 494372097, now seen corresponding path program 1 times [2021-08-27 07:49:52,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:52,114 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881924115] [2021-08-27 07:49:52,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:52,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-08-27 07:49:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:49:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:52,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:52,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:52,395 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881924115] [2021-08-27 07:49:52,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881924115] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:52,395 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:52,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:49:52,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823920508] [2021-08-27 07:49:52,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:49:52,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:52,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:49:52,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:52,397 INFO L87 Difference]: Start difference. First operand 607 states and 747 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:49:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:53,531 INFO L93 Difference]: Finished difference Result 657 states and 821 transitions. [2021-08-27 07:49:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:53,531 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2021-08-27 07:49:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:53,532 INFO L225 Difference]: With dead ends: 657 [2021-08-27 07:49:53,532 INFO L226 Difference]: Without dead ends: 651 [2021-08-27 07:49:53,533 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 384.3ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:49:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2021-08-27 07:49:53,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 601. [2021-08-27 07:49:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 472 states have (on average 1.2478813559322033) internal successors, (589), 485 states have internal predecessors, (589), 66 states have call successors, (66), 47 states have call predecessors, (66), 62 states have return successors, (84), 75 states have call predecessors, (84), 61 states have call successors, (84) [2021-08-27 07:49:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 739 transitions. [2021-08-27 07:49:53,538 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 739 transitions. Word has length 71 [2021-08-27 07:49:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:53,538 INFO L470 AbstractCegarLoop]: Abstraction has 601 states and 739 transitions. [2021-08-27 07:49:53,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:49:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 739 transitions. [2021-08-27 07:49:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-27 07:49:53,539 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:53,539 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:53,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-08-27 07:49:53,539 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:53,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:53,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1840886726, now seen corresponding path program 1 times [2021-08-27 07:49:53,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:53,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458117958] [2021-08-27 07:49:53,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:53,540 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:49:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 07:49:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:53,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:53,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458117958] [2021-08-27 07:49:53,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458117958] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:53,912 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:53,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-27 07:49:53,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418657301] [2021-08-27 07:49:53,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-27 07:49:53,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:53,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-27 07:49:53,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:49:53,914 INFO L87 Difference]: Start difference. First operand 601 states and 739 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-27 07:49:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:56,188 INFO L93 Difference]: Finished difference Result 673 states and 839 transitions. [2021-08-27 07:49:56,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:49:56,189 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2021-08-27 07:49:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:56,190 INFO L225 Difference]: With dead ends: 673 [2021-08-27 07:49:56,190 INFO L226 Difference]: Without dead ends: 647 [2021-08-27 07:49:56,190 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 504.3ms TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2021-08-27 07:49:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2021-08-27 07:49:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 599. [2021-08-27 07:49:56,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 470 states have (on average 1.2468085106382978) internal successors, (586), 483 states have internal predecessors, (586), 66 states have call successors, (66), 47 states have call predecessors, (66), 62 states have return successors, (84), 75 states have call predecessors, (84), 61 states have call successors, (84) [2021-08-27 07:49:56,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 736 transitions. [2021-08-27 07:49:56,196 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 736 transitions. Word has length 77 [2021-08-27 07:49:56,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:56,197 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 736 transitions. [2021-08-27 07:49:56,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2021-08-27 07:49:56,197 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 736 transitions. [2021-08-27 07:49:56,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 07:49:56,198 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:56,198 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:56,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-08-27 07:49:56,199 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:56,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:56,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2021942854, now seen corresponding path program 1 times [2021-08-27 07:49:56,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:56,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217504871] [2021-08-27 07:49:56,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:56,200 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:56,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:56,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:56,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:56,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:56,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:49:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:56,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:49:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:56,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:56,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:56,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:56,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217504871] [2021-08-27 07:49:56,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217504871] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:56,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:56,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:49:56,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922178513] [2021-08-27 07:49:56,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:49:56,449 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:56,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:49:56,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:49:56,450 INFO L87 Difference]: Start difference. First operand 599 states and 736 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:49:57,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:57,623 INFO L93 Difference]: Finished difference Result 646 states and 805 transitions. [2021-08-27 07:49:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:49:57,623 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2021-08-27 07:49:57,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:57,624 INFO L225 Difference]: With dead ends: 646 [2021-08-27 07:49:57,624 INFO L226 Difference]: Without dead ends: 635 [2021-08-27 07:49:57,624 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 380.0ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:49:57,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-08-27 07:49:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 587. [2021-08-27 07:49:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 459 states have (on average 1.2418300653594772) internal successors, (570), 472 states have internal predecessors, (570), 65 states have call successors, (65), 47 states have call predecessors, (65), 62 states have return successors, (83), 74 states have call predecessors, (83), 60 states have call successors, (83) [2021-08-27 07:49:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 718 transitions. [2021-08-27 07:49:57,629 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 718 transitions. Word has length 73 [2021-08-27 07:49:57,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:57,629 INFO L470 AbstractCegarLoop]: Abstraction has 587 states and 718 transitions. [2021-08-27 07:49:57,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:49:57,629 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 718 transitions. [2021-08-27 07:49:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-27 07:49:57,630 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:57,630 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:57,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-08-27 07:49:57,631 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash -776628007, now seen corresponding path program 1 times [2021-08-27 07:49:57,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:57,631 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944244989] [2021-08-27 07:49:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:57,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:49:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:49:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:49:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:49:58,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:49:58,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944244989] [2021-08-27 07:49:58,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944244989] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:49:58,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:49:58,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-08-27 07:49:58,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789530026] [2021-08-27 07:49:58,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 07:49:58,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:49:58,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 07:49:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:49:58,028 INFO L87 Difference]: Start difference. First operand 587 states and 718 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (10), 9 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2021-08-27 07:49:59,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:49:59,754 INFO L93 Difference]: Finished difference Result 652 states and 808 transitions. [2021-08-27 07:49:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 07:49:59,755 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (10), 9 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2021-08-27 07:49:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:49:59,756 INFO L225 Difference]: With dead ends: 652 [2021-08-27 07:49:59,756 INFO L226 Difference]: Without dead ends: 627 [2021-08-27 07:49:59,756 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 322.9ms TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2021-08-27 07:49:59,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2021-08-27 07:49:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 582. [2021-08-27 07:49:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 456 states have (on average 1.2412280701754386) internal successors, (566), 469 states have internal predecessors, (566), 63 states have call successors, (63), 47 states have call predecessors, (63), 62 states have return successors, (81), 72 states have call predecessors, (81), 58 states have call successors, (81) [2021-08-27 07:49:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 710 transitions. [2021-08-27 07:49:59,763 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 710 transitions. Word has length 79 [2021-08-27 07:49:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:49:59,763 INFO L470 AbstractCegarLoop]: Abstraction has 582 states and 710 transitions. [2021-08-27 07:49:59,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (10), 9 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2021-08-27 07:49:59,765 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 710 transitions. [2021-08-27 07:49:59,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-08-27 07:49:59,766 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:49:59,766 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:49:59,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-08-27 07:49:59,767 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:49:59,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:49:59,768 INFO L82 PathProgramCache]: Analyzing trace with hash -312001843, now seen corresponding path program 1 times [2021-08-27 07:49:59,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:49:59,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192629701] [2021-08-27 07:49:59,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:49:59,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:49:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:59,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:49:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:49:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:59,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:49:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:49:59,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:49:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:50:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:50:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:00,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:00,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192629701] [2021-08-27 07:50:00,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192629701] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:00,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:00,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:50:00,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036315052] [2021-08-27 07:50:00,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:50:00,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:50:00,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:00,143 INFO L87 Difference]: Start difference. First operand 582 states and 710 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:50:02,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:02,160 INFO L93 Difference]: Finished difference Result 626 states and 775 transitions. [2021-08-27 07:50:02,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:50:02,160 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 72 [2021-08-27 07:50:02,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:02,162 INFO L225 Difference]: With dead ends: 626 [2021-08-27 07:50:02,162 INFO L226 Difference]: Without dead ends: 578 [2021-08-27 07:50:02,162 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 284.8ms TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2021-08-27 07:50:02,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2021-08-27 07:50:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 533. [2021-08-27 07:50:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 416 states have (on average 1.2524038461538463) internal successors, (521), 427 states have internal predecessors, (521), 59 states have call successors, (59), 44 states have call predecessors, (59), 57 states have return successors, (76), 67 states have call predecessors, (76), 55 states have call successors, (76) [2021-08-27 07:50:02,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 656 transitions. [2021-08-27 07:50:02,167 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 656 transitions. Word has length 72 [2021-08-27 07:50:02,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:02,167 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 656 transitions. [2021-08-27 07:50:02,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2021-08-27 07:50:02,167 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 656 transitions. [2021-08-27 07:50:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 07:50:02,168 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:02,168 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:02,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-08-27 07:50:02,168 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:02,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1577876444, now seen corresponding path program 1 times [2021-08-27 07:50:02,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:02,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695501058] [2021-08-27 07:50:02,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:02,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:02,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:02,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:02,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:02,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:50:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:02,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:02,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:50:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:02,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:02,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:02,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:02,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695501058] [2021-08-27 07:50:02,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695501058] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:02,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:02,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:50:02,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327837738] [2021-08-27 07:50:02,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:50:02,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:02,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:50:02,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:02,570 INFO L87 Difference]: Start difference. First operand 533 states and 656 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:50:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:06,979 INFO L93 Difference]: Finished difference Result 1124 states and 1408 transitions. [2021-08-27 07:50:06,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-08-27 07:50:06,980 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 73 [2021-08-27 07:50:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:06,981 INFO L225 Difference]: With dead ends: 1124 [2021-08-27 07:50:06,981 INFO L226 Difference]: Without dead ends: 1094 [2021-08-27 07:50:06,982 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1800.7ms TimeCoverageRelationStatistics Valid=614, Invalid=2356, Unknown=0, NotChecked=0, Total=2970 [2021-08-27 07:50:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2021-08-27 07:50:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 804. [2021-08-27 07:50:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 631 states have (on average 1.2789223454833598) internal successors, (807), 649 states have internal predecessors, (807), 86 states have call successors, (86), 68 states have call predecessors, (86), 86 states have return successors, (114), 92 states have call predecessors, (114), 82 states have call successors, (114) [2021-08-27 07:50:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1007 transitions. [2021-08-27 07:50:06,991 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1007 transitions. Word has length 73 [2021-08-27 07:50:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:06,991 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 1007 transitions. [2021-08-27 07:50:06,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:50:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1007 transitions. [2021-08-27 07:50:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 07:50:06,993 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:06,993 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:06,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-08-27 07:50:06,993 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:06,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:06,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2037818598, now seen corresponding path program 1 times [2021-08-27 07:50:06,994 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:06,994 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264106761] [2021-08-27 07:50:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:06,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:07,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:50:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:50:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-08-27 07:50:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:07,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:07,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264106761] [2021-08-27 07:50:07,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264106761] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:07,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:07,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:50:07,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58469904] [2021-08-27 07:50:07,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:50:07,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:07,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:50:07,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:50:07,259 INFO L87 Difference]: Start difference. First operand 804 states and 1007 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:50:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:09,842 INFO L93 Difference]: Finished difference Result 1038 states and 1307 transitions. [2021-08-27 07:50:09,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 07:50:09,842 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (10), 10 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 73 [2021-08-27 07:50:09,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:09,844 INFO L225 Difference]: With dead ends: 1038 [2021-08-27 07:50:09,844 INFO L226 Difference]: Without dead ends: 1038 [2021-08-27 07:50:09,844 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 562.8ms TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2021-08-27 07:50:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2021-08-27 07:50:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 904. [2021-08-27 07:50:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 710 states have (on average 1.263380281690141) internal successors, (897), 723 states have internal predecessors, (897), 101 states have call successors, (101), 73 states have call predecessors, (101), 92 states have return successors, (131), 111 states have call predecessors, (131), 97 states have call successors, (131) [2021-08-27 07:50:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1129 transitions. [2021-08-27 07:50:09,856 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1129 transitions. Word has length 73 [2021-08-27 07:50:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:09,856 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 1129 transitions. [2021-08-27 07:50:09,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2021-08-27 07:50:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1129 transitions. [2021-08-27 07:50:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-27 07:50:09,858 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:09,858 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:09,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-08-27 07:50:09,859 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:09,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:09,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1309062525, now seen corresponding path program 1 times [2021-08-27 07:50:09,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:09,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486339778] [2021-08-27 07:50:09,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:09,860 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:09,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:50:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:50:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-08-27 07:50:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:50:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:10,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:10,163 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486339778] [2021-08-27 07:50:10,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486339778] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:10,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:10,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-27 07:50:10,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190522041] [2021-08-27 07:50:10,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-27 07:50:10,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:10,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 07:50:10,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:50:10,164 INFO L87 Difference]: Start difference. First operand 904 states and 1129 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:50:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:11,564 INFO L93 Difference]: Finished difference Result 990 states and 1251 transitions. [2021-08-27 07:50:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:11,564 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 10 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 75 [2021-08-27 07:50:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:11,566 INFO L225 Difference]: With dead ends: 990 [2021-08-27 07:50:11,566 INFO L226 Difference]: Without dead ends: 960 [2021-08-27 07:50:11,566 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 418.9ms TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:11,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-08-27 07:50:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 886. [2021-08-27 07:50:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 696 states have (on average 1.2629310344827587) internal successors, (879), 709 states have internal predecessors, (879), 97 states have call successors, (97), 73 states have call predecessors, (97), 92 states have return successors, (125), 107 states have call predecessors, (125), 93 states have call successors, (125) [2021-08-27 07:50:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1101 transitions. [2021-08-27 07:50:11,578 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1101 transitions. Word has length 75 [2021-08-27 07:50:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:11,578 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1101 transitions. [2021-08-27 07:50:11,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:50:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1101 transitions. [2021-08-27 07:50:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-27 07:50:11,579 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:11,579 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:11,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-08-27 07:50:11,579 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:11,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1946908899, now seen corresponding path program 1 times [2021-08-27 07:50:11,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:11,580 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607943896] [2021-08-27 07:50:11,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:11,580 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:11,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:11,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:11,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:11,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:50:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:11,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:50:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:11,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-08-27 07:50:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:11,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-08-27 07:50:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:11,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:11,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607943896] [2021-08-27 07:50:11,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607943896] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:11,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:11,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:11,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651880103] [2021-08-27 07:50:11,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:11,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:11,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:11,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:11,860 INFO L87 Difference]: Start difference. First operand 886 states and 1101 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:50:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:13,112 INFO L93 Difference]: Finished difference Result 956 states and 1203 transitions. [2021-08-27 07:50:13,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:50:13,113 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2021-08-27 07:50:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:13,114 INFO L225 Difference]: With dead ends: 956 [2021-08-27 07:50:13,114 INFO L226 Difference]: Without dead ends: 940 [2021-08-27 07:50:13,114 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 374.8ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:50:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2021-08-27 07:50:13,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 866. [2021-08-27 07:50:13,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 678 states have (on average 1.2640117994100295) internal successors, (857), 691 states have internal predecessors, (857), 95 states have call successors, (95), 73 states have call predecessors, (95), 92 states have return successors, (121), 105 states have call predecessors, (121), 91 states have call successors, (121) [2021-08-27 07:50:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1073 transitions. [2021-08-27 07:50:13,121 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1073 transitions. Word has length 73 [2021-08-27 07:50:13,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:13,122 INFO L470 AbstractCegarLoop]: Abstraction has 866 states and 1073 transitions. [2021-08-27 07:50:13,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-08-27 07:50:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1073 transitions. [2021-08-27 07:50:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-27 07:50:13,123 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:13,123 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:13,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-08-27 07:50:13,123 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:13,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1792063483, now seen corresponding path program 1 times [2021-08-27 07:50:13,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:13,124 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622677891] [2021-08-27 07:50:13,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:13,124 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:13,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 07:50:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-27 07:50:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:13,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:13,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622677891] [2021-08-27 07:50:13,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622677891] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:13,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:13,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:50:13,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617100083] [2021-08-27 07:50:13,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:50:13,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:13,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:50:13,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:50:13,447 INFO L87 Difference]: Start difference. First operand 866 states and 1073 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:50:14,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:14,421 INFO L93 Difference]: Finished difference Result 926 states and 1161 transitions. [2021-08-27 07:50:14,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 07:50:14,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 77 [2021-08-27 07:50:14,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:14,422 INFO L225 Difference]: With dead ends: 926 [2021-08-27 07:50:14,423 INFO L226 Difference]: Without dead ends: 926 [2021-08-27 07:50:14,423 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 234.1ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-08-27 07:50:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2021-08-27 07:50:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 852. [2021-08-27 07:50:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 664 states have (on average 1.2575301204819278) internal successors, (835), 677 states have internal predecessors, (835), 95 states have call successors, (95), 73 states have call predecessors, (95), 92 states have return successors, (121), 105 states have call predecessors, (121), 91 states have call successors, (121) [2021-08-27 07:50:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1051 transitions. [2021-08-27 07:50:14,430 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1051 transitions. Word has length 77 [2021-08-27 07:50:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:14,430 INFO L470 AbstractCegarLoop]: Abstraction has 852 states and 1051 transitions. [2021-08-27 07:50:14,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:50:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1051 transitions. [2021-08-27 07:50:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-27 07:50:14,432 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:14,432 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 07:50:14,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-08-27 07:50:14,432 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:14,432 INFO L82 PathProgramCache]: Analyzing trace with hash -928649569, now seen corresponding path program 1 times [2021-08-27 07:50:14,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:14,432 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365192591] [2021-08-27 07:50:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:14,433 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:50:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:50:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-08-27 07:50:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-08-27 07:50:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 07:50:14,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:14,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365192591] [2021-08-27 07:50:14,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365192591] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:14,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:14,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:14,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367237268] [2021-08-27 07:50:14,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:14,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:14,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:14,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:14,689 INFO L87 Difference]: Start difference. First operand 852 states and 1051 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:50:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:15,607 INFO L93 Difference]: Finished difference Result 926 states and 1159 transitions. [2021-08-27 07:50:15,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:50:15,608 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2021-08-27 07:50:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:15,609 INFO L225 Difference]: With dead ends: 926 [2021-08-27 07:50:15,609 INFO L226 Difference]: Without dead ends: 906 [2021-08-27 07:50:15,609 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 412.2ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-27 07:50:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2021-08-27 07:50:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 832. [2021-08-27 07:50:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 648 states have (on average 1.257716049382716) internal successors, (815), 661 states have internal predecessors, (815), 91 states have call successors, (91), 73 states have call predecessors, (91), 92 states have return successors, (117), 101 states have call predecessors, (117), 87 states have call successors, (117) [2021-08-27 07:50:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1023 transitions. [2021-08-27 07:50:15,616 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1023 transitions. Word has length 75 [2021-08-27 07:50:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:15,616 INFO L470 AbstractCegarLoop]: Abstraction has 832 states and 1023 transitions. [2021-08-27 07:50:15,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:50:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1023 transitions. [2021-08-27 07:50:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-27 07:50:15,618 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:15,618 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:15,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-08-27 07:50:15,618 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:15,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:15,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1345380007, now seen corresponding path program 1 times [2021-08-27 07:50:15,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:15,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044845429] [2021-08-27 07:50:15,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:15,619 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:50:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-08-27 07:50:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:50:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:15,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:15,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:15,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044845429] [2021-08-27 07:50:15,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044845429] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:15,891 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:15,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:50:15,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243838277] [2021-08-27 07:50:15,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:50:15,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:15,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:50:15,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:50:15,892 INFO L87 Difference]: Start difference. First operand 832 states and 1023 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:50:16,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:16,676 INFO L93 Difference]: Finished difference Result 850 states and 1047 transitions. [2021-08-27 07:50:16,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:16,677 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 78 [2021-08-27 07:50:16,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:16,678 INFO L225 Difference]: With dead ends: 850 [2021-08-27 07:50:16,678 INFO L226 Difference]: Without dead ends: 778 [2021-08-27 07:50:16,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 378.4ms TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:50:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2021-08-27 07:50:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 504. [2021-08-27 07:50:16,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 390 states have (on average 1.2179487179487178) internal successors, (475), 400 states have internal predecessors, (475), 53 states have call successors, (53), 47 states have call predecessors, (53), 60 states have return successors, (68), 60 states have call predecessors, (68), 49 states have call successors, (68) [2021-08-27 07:50:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 596 transitions. [2021-08-27 07:50:16,683 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 596 transitions. Word has length 78 [2021-08-27 07:50:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:16,683 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 596 transitions. [2021-08-27 07:50:16,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2021-08-27 07:50:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 596 transitions. [2021-08-27 07:50:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-27 07:50:16,685 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:16,685 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 07:50:16,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-08-27 07:50:16,688 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:16,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash -305187537, now seen corresponding path program 1 times [2021-08-27 07:50:16,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:16,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099297692] [2021-08-27 07:50:16,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:16,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:50:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:50:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-08-27 07:50:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-08-27 07:50:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2021-08-27 07:50:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 07:50:16,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:16,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099297692] [2021-08-27 07:50:16,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099297692] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 07:50:16,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689718945] [2021-08-27 07:50:16,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:16,938 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:50:16,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 07:50:16,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 07:50:16,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-08-27 07:50:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 07:50:17,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 07:50:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:17,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689718945] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:17,587 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 07:50:17,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 12 [2021-08-27 07:50:17,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818042112] [2021-08-27 07:50:17,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 07:50:17,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:17,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 07:50:17,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:17,589 INFO L87 Difference]: Start difference. First operand 504 states and 596 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:50:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:17,596 INFO L93 Difference]: Finished difference Result 471 states and 556 transitions. [2021-08-27 07:50:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 07:50:17,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2021-08-27 07:50:17,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:17,597 INFO L225 Difference]: With dead ends: 471 [2021-08-27 07:50:17,597 INFO L226 Difference]: Without dead ends: 425 [2021-08-27 07:50:17,598 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 168.8ms TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-08-27 07:50:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2021-08-27 07:50:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 329 states have (on average 1.2401215805471124) internal successors, (408), 336 states have internal predecessors, (408), 44 states have call successors, (44), 41 states have call predecessors, (44), 51 states have return successors, (56), 51 states have call predecessors, (56), 40 states have call successors, (56) [2021-08-27 07:50:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 508 transitions. [2021-08-27 07:50:17,604 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 508 transitions. Word has length 77 [2021-08-27 07:50:17,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:17,604 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 508 transitions. [2021-08-27 07:50:17,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-08-27 07:50:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 508 transitions. [2021-08-27 07:50:17,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-27 07:50:17,606 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:17,606 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:17,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-08-27 07:50:17,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 07:50:17,832 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:17,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:17,833 INFO L82 PathProgramCache]: Analyzing trace with hash 921389410, now seen corresponding path program 1 times [2021-08-27 07:50:17,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:17,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555592884] [2021-08-27 07:50:17,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:17,833 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 07:50:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:50:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-08-27 07:50:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:18,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:18,166 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555592884] [2021-08-27 07:50:18,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555592884] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:18,166 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:18,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-27 07:50:18,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057476165] [2021-08-27 07:50:18,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-27 07:50:18,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:18,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-27 07:50:18,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-08-27 07:50:18,168 INFO L87 Difference]: Start difference. First operand 425 states and 508 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (14), 11 states have call predecessors, (14), 5 states have return successors, (10), 6 states have call predecessors, (10), 3 states have call successors, (10) [2021-08-27 07:50:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:18,995 INFO L93 Difference]: Finished difference Result 442 states and 531 transitions. [2021-08-27 07:50:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 07:50:18,995 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (14), 11 states have call predecessors, (14), 5 states have return successors, (10), 6 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2021-08-27 07:50:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:18,996 INFO L225 Difference]: With dead ends: 442 [2021-08-27 07:50:18,996 INFO L226 Difference]: Without dead ends: 442 [2021-08-27 07:50:18,996 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 470.6ms TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2021-08-27 07:50:18,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-08-27 07:50:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 425. [2021-08-27 07:50:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 329 states have (on average 1.237082066869301) internal successors, (407), 336 states have internal predecessors, (407), 44 states have call successors, (44), 41 states have call predecessors, (44), 51 states have return successors, (56), 51 states have call predecessors, (56), 40 states have call successors, (56) [2021-08-27 07:50:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 507 transitions. [2021-08-27 07:50:19,001 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 507 transitions. Word has length 81 [2021-08-27 07:50:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:19,002 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 507 transitions. [2021-08-27 07:50:19,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (14), 11 states have call predecessors, (14), 5 states have return successors, (10), 6 states have call predecessors, (10), 3 states have call successors, (10) [2021-08-27 07:50:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 507 transitions. [2021-08-27 07:50:19,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-27 07:50:19,003 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:19,003 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:19,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-08-27 07:50:19,003 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:19,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:19,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2106930851, now seen corresponding path program 1 times [2021-08-27 07:50:19,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:19,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539725695] [2021-08-27 07:50:19,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:19,004 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:50:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-08-27 07:50:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:50:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-08-27 07:50:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-08-27 07:50:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:19,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:19,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539725695] [2021-08-27 07:50:19,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539725695] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:19,331 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:19,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-27 07:50:19,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753390173] [2021-08-27 07:50:19,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 07:50:19,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:19,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 07:50:19,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:50:19,332 INFO L87 Difference]: Start difference. First operand 425 states and 507 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 9 states have internal predecessors, (58), 5 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:50:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:21,348 INFO L93 Difference]: Finished difference Result 630 states and 772 transitions. [2021-08-27 07:50:21,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 07:50:21,357 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 9 states have internal predecessors, (58), 5 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 78 [2021-08-27 07:50:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:21,358 INFO L225 Difference]: With dead ends: 630 [2021-08-27 07:50:21,358 INFO L226 Difference]: Without dead ends: 586 [2021-08-27 07:50:21,359 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 808.8ms TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2021-08-27 07:50:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2021-08-27 07:50:21,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 288. [2021-08-27 07:50:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.2678571428571428) internal successors, (284), 227 states have internal predecessors, (284), 31 states have call successors, (31), 29 states have call predecessors, (31), 32 states have return successors, (37), 32 states have call predecessors, (37), 28 states have call successors, (37) [2021-08-27 07:50:21,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 352 transitions. [2021-08-27 07:50:21,363 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 352 transitions. Word has length 78 [2021-08-27 07:50:21,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:21,363 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 352 transitions. [2021-08-27 07:50:21,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 9 states have internal predecessors, (58), 5 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2021-08-27 07:50:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 352 transitions. [2021-08-27 07:50:21,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-08-27 07:50:21,365 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:21,365 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:21,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-08-27 07:50:21,365 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:21,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:21,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1801601469, now seen corresponding path program 1 times [2021-08-27 07:50:21,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:21,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545796563] [2021-08-27 07:50:21,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:21,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-08-27 07:50:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:50:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:21,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:21,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545796563] [2021-08-27 07:50:21,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545796563] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:21,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:21,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-27 07:50:21,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639980308] [2021-08-27 07:50:21,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 07:50:21,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:21,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 07:50:21,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2021-08-27 07:50:21,608 INFO L87 Difference]: Start difference. First operand 288 states and 352 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-08-27 07:50:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:22,123 INFO L93 Difference]: Finished difference Result 296 states and 347 transitions. [2021-08-27 07:50:22,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 07:50:22,123 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2021-08-27 07:50:22,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:22,124 INFO L225 Difference]: With dead ends: 296 [2021-08-27 07:50:22,124 INFO L226 Difference]: Without dead ends: 296 [2021-08-27 07:50:22,125 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 336.3ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-08-27 07:50:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 246. [2021-08-27 07:50:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 189 states have (on average 1.1904761904761905) internal successors, (225), 193 states have internal predecessors, (225), 29 states have call successors, (29), 26 states have call predecessors, (29), 27 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2021-08-27 07:50:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 284 transitions. [2021-08-27 07:50:22,127 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 284 transitions. Word has length 83 [2021-08-27 07:50:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:22,127 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 284 transitions. [2021-08-27 07:50:22,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2021-08-27 07:50:22,127 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 284 transitions. [2021-08-27 07:50:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-08-27 07:50:22,128 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:22,128 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:22,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-08-27 07:50:22,128 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash 709862044, now seen corresponding path program 1 times [2021-08-27 07:50:22,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:22,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127148368] [2021-08-27 07:50:22,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:22,129 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:50:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:50:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-08-27 07:50:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:22,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:22,465 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127148368] [2021-08-27 07:50:22,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127148368] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:22,465 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:22,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-27 07:50:22,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795476286] [2021-08-27 07:50:22,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 07:50:22,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:22,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 07:50:22,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:50:22,466 INFO L87 Difference]: Start difference. First operand 246 states and 284 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (14), 11 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2021-08-27 07:50:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:23,388 INFO L93 Difference]: Finished difference Result 301 states and 344 transitions. [2021-08-27 07:50:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-27 07:50:23,388 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (14), 11 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2021-08-27 07:50:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:23,389 INFO L225 Difference]: With dead ends: 301 [2021-08-27 07:50:23,389 INFO L226 Difference]: Without dead ends: 272 [2021-08-27 07:50:23,389 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 494.3ms TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2021-08-27 07:50:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-08-27 07:50:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 245. [2021-08-27 07:50:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 188 states have (on average 1.175531914893617) internal successors, (221), 192 states have internal predecessors, (221), 29 states have call successors, (29), 26 states have call predecessors, (29), 27 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2021-08-27 07:50:23,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 280 transitions. [2021-08-27 07:50:23,391 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 280 transitions. Word has length 99 [2021-08-27 07:50:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:23,391 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 280 transitions. [2021-08-27 07:50:23,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (14), 11 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2021-08-27 07:50:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 280 transitions. [2021-08-27 07:50:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-27 07:50:23,392 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:23,392 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:23,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-08-27 07:50:23,392 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:23,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:23,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2082222504, now seen corresponding path program 1 times [2021-08-27 07:50:23,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:23,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505146339] [2021-08-27 07:50:23,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:23,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:50:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:50:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-08-27 07:50:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:23,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:23,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505146339] [2021-08-27 07:50:23,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505146339] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:23,765 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:23,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-27 07:50:23,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931553558] [2021-08-27 07:50:23,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-27 07:50:23,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:23,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-27 07:50:23,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:23,767 INFO L87 Difference]: Start difference. First operand 245 states and 280 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 9 states have internal predecessors, (75), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-08-27 07:50:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:25,434 INFO L93 Difference]: Finished difference Result 488 states and 556 transitions. [2021-08-27 07:50:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-08-27 07:50:25,437 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 9 states have internal predecessors, (75), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 101 [2021-08-27 07:50:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:25,438 INFO L225 Difference]: With dead ends: 488 [2021-08-27 07:50:25,438 INFO L226 Difference]: Without dead ends: 483 [2021-08-27 07:50:25,438 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 744.1ms TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2021-08-27 07:50:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-08-27 07:50:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 360. [2021-08-27 07:50:25,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 278 states have (on average 1.169064748201439) internal successors, (325), 284 states have internal predecessors, (325), 41 states have call successors, (41), 38 states have call predecessors, (41), 40 states have return successors, (43), 38 states have call predecessors, (43), 39 states have call successors, (43) [2021-08-27 07:50:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 409 transitions. [2021-08-27 07:50:25,442 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 409 transitions. Word has length 101 [2021-08-27 07:50:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:25,442 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 409 transitions. [2021-08-27 07:50:25,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 9 states have internal predecessors, (75), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2021-08-27 07:50:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 409 transitions. [2021-08-27 07:50:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-08-27 07:50:25,443 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:25,443 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 07:50:25,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-08-27 07:50:25,443 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:25,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:25,443 INFO L82 PathProgramCache]: Analyzing trace with hash -205159274, now seen corresponding path program 1 times [2021-08-27 07:50:25,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:25,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231769969] [2021-08-27 07:50:25,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:25,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:50:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-08-27 07:50:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:50:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-08-27 07:50:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 07:50:25,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:25,784 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231769969] [2021-08-27 07:50:25,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231769969] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:25,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:25,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-08-27 07:50:25,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819895727] [2021-08-27 07:50:25,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-27 07:50:25,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:25,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-27 07:50:25,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-08-27 07:50:25,785 INFO L87 Difference]: Start difference. First operand 360 states and 409 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 11 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2021-08-27 07:50:26,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:26,149 INFO L93 Difference]: Finished difference Result 398 states and 455 transitions. [2021-08-27 07:50:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-27 07:50:26,149 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 11 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 101 [2021-08-27 07:50:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:26,150 INFO L225 Difference]: With dead ends: 398 [2021-08-27 07:50:26,150 INFO L226 Difference]: Without dead ends: 345 [2021-08-27 07:50:26,150 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 261.3ms TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2021-08-27 07:50:26,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 146. [2021-08-27 07:50:26,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 112 states have (on average 1.1428571428571428) internal successors, (128), 114 states have internal predecessors, (128), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2021-08-27 07:50:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2021-08-27 07:50:26,152 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 101 [2021-08-27 07:50:26,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:26,153 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2021-08-27 07:50:26,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 11 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2021-08-27 07:50:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2021-08-27 07:50:26,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-08-27 07:50:26,153 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:26,153 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 07:50:26,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-08-27 07:50:26,154 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:26,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:26,154 INFO L82 PathProgramCache]: Analyzing trace with hash 542379080, now seen corresponding path program 1 times [2021-08-27 07:50:26,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:26,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886637613] [2021-08-27 07:50:26,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:26,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:50:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:50:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:50:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-08-27 07:50:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-08-27 07:50:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-27 07:50:26,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:26,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886637613] [2021-08-27 07:50:26,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886637613] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:26,415 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:26,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-27 07:50:26,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083785287] [2021-08-27 07:50:26,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-27 07:50:26,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:26,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 07:50:26,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-08-27 07:50:26,416 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2021-08-27 07:50:26,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:26,835 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2021-08-27 07:50:26,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 07:50:26,835 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 115 [2021-08-27 07:50:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:26,836 INFO L225 Difference]: With dead ends: 158 [2021-08-27 07:50:26,836 INFO L226 Difference]: Without dead ends: 158 [2021-08-27 07:50:26,836 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 344.2ms TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-08-27 07:50:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-08-27 07:50:26,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2021-08-27 07:50:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.1196581196581197) internal successors, (131), 119 states have internal predecessors, (131), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2021-08-27 07:50:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-08-27 07:50:26,838 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 115 [2021-08-27 07:50:26,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:26,838 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-08-27 07:50:26,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.153846153846154) internal successors, (80), 4 states have internal predecessors, (80), 4 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2021-08-27 07:50:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-08-27 07:50:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-27 07:50:26,838 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:26,838 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 07:50:26,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-08-27 07:50:26,839 INFO L402 AbstractCegarLoop]: === Iteration 79 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:26,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:26,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1646165576, now seen corresponding path program 1 times [2021-08-27 07:50:26,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:26,839 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408432628] [2021-08-27 07:50:26,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:26,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:26,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:50:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-08-27 07:50:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:50:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 07:50:27,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-08-27 07:50:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:27,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-27 07:50:27,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:27,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408432628] [2021-08-27 07:50:27,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408432628] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:27,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:27,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-08-27 07:50:27,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408192662] [2021-08-27 07:50:27,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-08-27 07:50:27,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:27,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-08-27 07:50:27,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2021-08-27 07:50:27,199 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 8 states have internal predecessors, (81), 5 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2021-08-27 07:50:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:28,064 INFO L93 Difference]: Finished difference Result 255 states and 277 transitions. [2021-08-27 07:50:28,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-08-27 07:50:28,065 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 8 states have internal predecessors, (81), 5 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2021-08-27 07:50:28,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:28,065 INFO L225 Difference]: With dead ends: 255 [2021-08-27 07:50:28,065 INFO L226 Difference]: Without dead ends: 152 [2021-08-27 07:50:28,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 579.1ms TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2021-08-27 07:50:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-08-27 07:50:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-08-27 07:50:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.1111111111111112) internal successors, (130), 119 states have internal predecessors, (130), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2021-08-27 07:50:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2021-08-27 07:50:28,067 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2021-08-27 07:50:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:28,068 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2021-08-27 07:50:28,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 8 states have internal predecessors, (81), 5 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2021-08-27 07:50:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2021-08-27 07:50:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-08-27 07:50:28,068 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 07:50:28,068 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-08-27 07:50:28,068 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-08-27 07:50:28,069 INFO L402 AbstractCegarLoop]: === Iteration 80 === Targeting errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2021-08-27 07:50:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 07:50:28,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1764607050, now seen corresponding path program 1 times [2021-08-27 07:50:28,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 07:50:28,069 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217508691] [2021-08-27 07:50:28,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 07:50:28,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 07:50:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-08-27 07:50:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-08-27 07:50:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-08-27 07:50:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-08-27 07:50:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-08-27 07:50:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-08-27 07:50:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-08-27 07:50:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2021-08-27 07:50:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-08-27 07:50:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-08-27 07:50:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-08-27 07:50:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 07:50:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-27 07:50:28,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 07:50:28,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217508691] [2021-08-27 07:50:28,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217508691] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 07:50:28,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 07:50:28,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-08-27 07:50:28,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627668302] [2021-08-27 07:50:28,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-08-27 07:50:28,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 07:50:28,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-08-27 07:50:28,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2021-08-27 07:50:28,489 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 20 states, 20 states have (on average 4.05) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2021-08-27 07:50:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 07:50:29,188 INFO L93 Difference]: Finished difference Result 149 states and 162 transitions. [2021-08-27 07:50:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-27 07:50:29,189 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2021-08-27 07:50:29,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 07:50:29,189 INFO L225 Difference]: With dead ends: 149 [2021-08-27 07:50:29,189 INFO L226 Difference]: Without dead ends: 0 [2021-08-27 07:50:29,189 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 533.7ms TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2021-08-27 07:50:29,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-27 07:50:29,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-27 07:50:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 07:50:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 07:50:29,190 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2021-08-27 07:50:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 07:50:29,190 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 07:50:29,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2021-08-27 07:50:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-27 07:50:29,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-27 07:50:29,192 INFO L764 garLoopResultBuilder]: Registering result SAFE for location mainErr0ENSURES_VIOLATIONMEMORY_LEAK [2021-08-27 07:50:29,193 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONMEMORY_LEAK [2021-08-27 07:50:29,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-08-27 07:50:29,196 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 07:50:29,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 07:50:29 BoogieIcfgContainer [2021-08-27 07:50:29,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 07:50:29,199 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 07:50:29,199 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 07:50:29,199 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 07:50:29,199 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 07:47:19" (3/4) ... [2021-08-27 07:50:29,201 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-27 07:50:29,210 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2021-08-27 07:50:29,210 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure SendSrbSynchronous [2021-08-27 07:50:29,210 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2021-08-27 07:50:29,210 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioStartDevice [2021-08-27 07:50:29,210 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure AG_SetStatusAndReturn [2021-08-27 07:50:29,210 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2021-08-27 07:50:29,210 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2021-08-27 07:50:29,210 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2021-08-27 07:50:29,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioIsPlayActive [2021-08-27 07:50:29,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2021-08-27 07:50:29,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioHPCdrDeviceControl [2021-08-27 07:50:29,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2021-08-27 07:50:29,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPower [2021-08-27 07:50:29,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HPCdrCompletion [2021-08-27 07:50:29,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure HpCdrProcessLastSession [2021-08-27 07:50:29,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2021-08-27 07:50:29,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2021-08-27 07:50:29,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSignalCompletion [2021-08-27 07:50:29,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioPnp [2021-08-27 07:50:29,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2021-08-27 07:50:29,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio535DeviceControl [2021-08-27 07:50:29,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2021-08-27 07:50:29,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioSendToNextDriver [2021-08-27 07:50:29,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2021-08-27 07:50:29,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioAtapiDeviceControl [2021-08-27 07:50:29,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioDeviceControl [2021-08-27 07:50:29,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudio435DeviceControl [2021-08-27 07:50:29,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioUnload [2021-08-27 07:50:29,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure CdAudioForwardIrpSynchronous [2021-08-27 07:50:29,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2021-08-27 07:50:29,243 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2021-08-27 07:50:29,246 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2021-08-27 07:50:29,248 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-08-27 07:50:29,250 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-27 07:50:29,398 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 07:50:29,398 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 07:50:29,400 INFO L168 Benchmark]: Toolchain (without parser) took 192141.71 ms. Allocated memory was 60.8 MB in the beginning and 463.5 MB in the end (delta: 402.7 MB). Free memory was 37.8 MB in the beginning and 282.3 MB in the end (delta: -244.5 MB). Peak memory consumption was 158.1 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:29,401 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 60.8 MB. Free memory was 42.8 MB in the beginning and 42.7 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 07:50:29,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 572.08 ms. Allocated memory was 60.8 MB in the beginning and 81.8 MB in the end (delta: 21.0 MB). Free memory was 37.6 MB in the beginning and 51.4 MB in the end (delta: -13.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:29,401 INFO L168 Benchmark]: Boogie Preprocessor took 131.31 ms. Allocated memory is still 81.8 MB. Free memory was 51.4 MB in the beginning and 46.3 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:29,402 INFO L168 Benchmark]: RCFGBuilder took 1447.01 ms. Allocated memory was 81.8 MB in the beginning and 98.6 MB in the end (delta: 16.8 MB). Free memory was 46.3 MB in the beginning and 72.0 MB in the end (delta: -25.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:29,402 INFO L168 Benchmark]: TraceAbstraction took 189783.70 ms. Allocated memory was 98.6 MB in the beginning and 463.5 MB in the end (delta: 364.9 MB). Free memory was 71.3 MB in the beginning and 317.3 MB in the end (delta: -246.0 MB). Peak memory consumption was 119.2 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:29,402 INFO L168 Benchmark]: Witness Printer took 199.95 ms. Allocated memory is still 463.5 MB. Free memory was 317.3 MB in the beginning and 282.3 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2021-08-27 07:50:29,403 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 60.8 MB. Free memory was 42.8 MB in the beginning and 42.7 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 572.08 ms. Allocated memory was 60.8 MB in the beginning and 81.8 MB in the end (delta: 21.0 MB). Free memory was 37.6 MB in the beginning and 51.4 MB in the end (delta: -13.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 131.31 ms. Allocated memory is still 81.8 MB. Free memory was 51.4 MB in the beginning and 46.3 MB in the end (delta: 5.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1447.01 ms. Allocated memory was 81.8 MB in the beginning and 98.6 MB in the end (delta: 16.8 MB). Free memory was 46.3 MB in the beginning and 72.0 MB in the end (delta: -25.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 189783.70 ms. Allocated memory was 98.6 MB in the beginning and 463.5 MB in the end (delta: 364.9 MB). Free memory was 71.3 MB in the beginning and 317.3 MB in the end (delta: -246.0 MB). Peak memory consumption was 119.2 MB. Max. memory is 16.1 GB. * Witness Printer took 199.95 ms. Allocated memory is still 463.5 MB. Free memory was 317.3 MB in the beginning and 282.3 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1717]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 59]: 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, 519 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 189727.3ms, OverallIterations: 80, TraceHistogramMax: 2, EmptinessCheckTime: 130.2ms, AutomataDifference: 163825.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 26.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 41735 SDtfs, 71040 SDslu, 105039 SDs, 0 SdLazy, 185491 SolverSat, 25094 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 118880.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2338 GetRequests, 978 SyntacticMatches, 2 SemanticMatches, 1358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3559 ImplicationChecksByTransitivity, 32098.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=5, InterpolantAutomatonStates: 1076, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 995.0ms AutomataMinimizationTime, 80 MinimizatonAttempts, 9591 StatesRemovedByMinimization, 77 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 289.9ms SsaConstructionTime, 803.5ms SatisfiabilityAnalysisTime, 22521.2ms InterpolantComputationTime, 5168 NumberOfCodeBlocks, 5168 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 5087 ConstructedInterpolants, 0 QuantifiedInterpolants, 26402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 942 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 81 InterpolantComputations, 80 PerfectInterpolantSequences, 43/45 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-08-27 07:50:29,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...