./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9a8b2e8d 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.3.100.v20150511-1540.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/kbfiltr_simpl2.cil-1.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 3e0d5536f9cd1f3a5d711f95a0369e25308fe790 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 06:16:04,798 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 06:16:04,801 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 06:16:04,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 06:16:04,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 06:16:04,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 06:16:04,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 06:16:04,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 06:16:04,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 06:16:04,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 06:16:04,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 06:16:04,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 06:16:04,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 06:16:04,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 06:16:04,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 06:16:04,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 06:16:04,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 06:16:04,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 06:16:04,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 06:16:04,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 06:16:04,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 06:16:04,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 06:16:04,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 06:16:04,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 06:16:04,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 06:16:04,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 06:16:04,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 06:16:04,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 06:16:04,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 06:16:04,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 06:16:04,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 06:16:04,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 06:16:04,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 06:16:04,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 06:16:04,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 06:16:04,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 06:16:04,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 06:16:04,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 06:16:04,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 06:16:04,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 06:16:04,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 06:16:04,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-10-20 06:16:04,904 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 06:16:04,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 06:16:04,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 06:16:04,906 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 06:16:04,906 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 06:16:04,906 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 06:16:04,907 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 06:16:04,907 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 06:16:04,907 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 06:16:04,907 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 06:16:04,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 06:16:04,908 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-20 06:16:04,908 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-20 06:16:04,908 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-20 06:16:04,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 06:16:04,909 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-20 06:16:04,909 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 06:16:04,909 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 06:16:04,909 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 06:16:04,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 06:16:04,910 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 06:16:04,910 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 06:16:04,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 06:16:04,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 06:16:04,911 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 06:16:04,911 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 06:16:04,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 06:16:04,912 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 06:16:04,912 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 3e0d5536f9cd1f3a5d711f95a0369e25308fe790 [2020-10-20 06:16:05,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 06:16:05,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 06:16:05,133 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 06:16:05,137 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 06:16:05,138 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 06:16:05,138 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2020-10-20 06:16:05,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105e8be6a/0adff3c2773e4a789dd977fba8f0e53b/FLAG25dcb9b99 [2020-10-20 06:16:05,665 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 06:16:05,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2020-10-20 06:16:05,679 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105e8be6a/0adff3c2773e4a789dd977fba8f0e53b/FLAG25dcb9b99 [2020-10-20 06:16:06,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105e8be6a/0adff3c2773e4a789dd977fba8f0e53b [2020-10-20 06:16:06,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 06:16:06,074 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-20 06:16:06,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 06:16:06,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 06:16:06,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 06:16:06,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:16:06" (1/1) ... [2020-10-20 06:16:06,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329302a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:16:06, skipping insertion in model container [2020-10-20 06:16:06,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 06:16:06" (1/1) ... [2020-10-20 06:16:06,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 06:16:06,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 06:16:06,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:16:06,645 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 06:16:06,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 06:16:06,739 INFO L208 MainTranslator]: Completed translation [2020-10-20 06:16:06,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:16:06 WrapperNode [2020-10-20 06:16:06,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 06:16:06,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 06:16:06,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 06:16:06,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 06:16:06,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:16:06" (1/1) ... [2020-10-20 06:16:06,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:16:06" (1/1) ... [2020-10-20 06:16:06,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:16:06" (1/1) ... [2020-10-20 06:16:06,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:16:06" (1/1) ... [2020-10-20 06:16:06,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:16:06" (1/1) ... [2020-10-20 06:16:06,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:16:06" (1/1) ... [2020-10-20 06:16:06,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:16:06" (1/1) ... [2020-10-20 06:16:06,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 06:16:06,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 06:16:06,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 06:16:06,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 06:16:06,823 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:16:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 06:16:06,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-20 06:16:06,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 06:16:06,920 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-20 06:16:06,920 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2020-10-20 06:16:06,921 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2020-10-20 06:16:06,922 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2020-10-20 06:16:06,922 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-20 06:16:06,923 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2020-10-20 06:16:06,923 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2020-10-20 06:16:06,923 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2020-10-20 06:16:06,924 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2020-10-20 06:16:06,925 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2020-10-20 06:16:06,925 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2020-10-20 06:16:06,925 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_CreateClose [2020-10-20 06:16:06,925 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_DispatchPassThrough [2020-10-20 06:16:06,926 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Power [2020-10-20 06:16:06,928 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2020-10-20 06:16:06,928 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_InternIoCtl [2020-10-20 06:16:06,928 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2020-10-20 06:16:06,929 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-20 06:16:06,930 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-20 06:16:06,930 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-20 06:16:06,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 06:16:06,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2020-10-20 06:16:06,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-20 06:16:06,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2020-10-20 06:16:06,932 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2020-10-20 06:16:06,932 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2020-10-20 06:16:06,932 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2020-10-20 06:16:06,932 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2020-10-20 06:16:06,933 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2020-10-20 06:16:06,933 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2020-10-20 06:16:06,933 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_CreateClose [2020-10-20 06:16:06,933 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_DispatchPassThrough [2020-10-20 06:16:06,934 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Power [2020-10-20 06:16:06,934 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_InternIoCtl [2020-10-20 06:16:06,934 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2020-10-20 06:16:06,934 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2020-10-20 06:16:06,934 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2020-10-20 06:16:06,935 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2020-10-20 06:16:06,935 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-20 06:16:06,935 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2020-10-20 06:16:06,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-20 06:16:06,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 06:16:06,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 06:16:06,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 06:16:06,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 06:16:06,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 06:16:07,267 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-20 06:16:07,430 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2020-10-20 06:16:07,430 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2020-10-20 06:16:07,453 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-20 06:16:07,534 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2020-10-20 06:16:07,535 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2020-10-20 06:16:07,634 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-20 06:16:07,658 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2020-10-20 06:16:07,658 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2020-10-20 06:16:07,669 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-20 06:16:07,818 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##43: assume false; [2020-10-20 06:16:07,818 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume !false; [2020-10-20 06:16:07,823 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-20 06:16:07,849 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2020-10-20 06:16:07,850 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2020-10-20 06:16:07,856 WARN L798 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-10-20 06:16:07,886 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2020-10-20 06:16:07,886 INFO L751 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2020-10-20 06:16:07,953 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 06:16:07,954 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-20 06:16:07,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:16:07 BoogieIcfgContainer [2020-10-20 06:16:07,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 06:16:07,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 06:16:07,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 06:16:07,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 06:16:07,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 06:16:06" (1/3) ... [2020-10-20 06:16:07,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3368cf47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 06:16:07, skipping insertion in model container [2020-10-20 06:16:07,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 06:16:06" (2/3) ... [2020-10-20 06:16:07,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3368cf47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 06:16:07, skipping insertion in model container [2020-10-20 06:16:07,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:16:07" (3/3) ... [2020-10-20 06:16:07,965 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2020-10-20 06:16:07,977 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 06:16:07,985 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 06:16:08,001 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-20 06:16:08,024 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 06:16:08,024 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-20 06:16:08,024 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 06:16:08,024 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 06:16:08,024 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 06:16:08,025 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 06:16:08,025 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 06:16:08,025 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 06:16:08,046 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states. [2020-10-20 06:16:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 06:16:08,055 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:08,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:16:08,057 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:08,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:08,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1218581619, now seen corresponding path program 1 times [2020-10-20 06:16:08,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:08,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139154904] [2020-10-20 06:16:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:08,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:08,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:08,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139154904] [2020-10-20 06:16:08,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:08,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 06:16:08,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376406188] [2020-10-20 06:16:08,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 06:16:08,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:08,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 06:16:08,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:16:08,611 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 4 states. [2020-10-20 06:16:09,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:09,289 INFO L93 Difference]: Finished difference Result 266 states and 385 transitions. [2020-10-20 06:16:09,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 06:16:09,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-20 06:16:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:09,308 INFO L225 Difference]: With dead ends: 266 [2020-10-20 06:16:09,308 INFO L226 Difference]: Without dead ends: 257 [2020-10-20 06:16:09,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 06:16:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-10-20 06:16:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 229. [2020-10-20 06:16:09,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-10-20 06:16:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 324 transitions. [2020-10-20 06:16:09,377 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 324 transitions. Word has length 15 [2020-10-20 06:16:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:09,378 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 324 transitions. [2020-10-20 06:16:09,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 06:16:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 324 transitions. [2020-10-20 06:16:09,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 06:16:09,380 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:09,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 06:16:09,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 06:16:09,381 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:09,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:09,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1146815466, now seen corresponding path program 1 times [2020-10-20 06:16:09,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:09,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286231023] [2020-10-20 06:16:09,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:09,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:09,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:09,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286231023] [2020-10-20 06:16:09,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:09,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 06:16:09,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259762767] [2020-10-20 06:16:09,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 06:16:09,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:09,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 06:16:09,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:16:09,641 INFO L87 Difference]: Start difference. First operand 229 states and 324 transitions. Second operand 5 states. [2020-10-20 06:16:10,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:10,588 INFO L93 Difference]: Finished difference Result 257 states and 364 transitions. [2020-10-20 06:16:10,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 06:16:10,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-10-20 06:16:10,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:10,593 INFO L225 Difference]: With dead ends: 257 [2020-10-20 06:16:10,593 INFO L226 Difference]: Without dead ends: 257 [2020-10-20 06:16:10,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 06:16:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2020-10-20 06:16:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 229. [2020-10-20 06:16:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-10-20 06:16:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 323 transitions. [2020-10-20 06:16:10,629 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 323 transitions. Word has length 21 [2020-10-20 06:16:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:10,630 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 323 transitions. [2020-10-20 06:16:10,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 06:16:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 323 transitions. [2020-10-20 06:16:10,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 06:16:10,632 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:10,632 INFO L422 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] [2020-10-20 06:16:10,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 06:16:10,633 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:10,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:10,634 INFO L82 PathProgramCache]: Analyzing trace with hash 533223039, now seen corresponding path program 1 times [2020-10-20 06:16:10,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:10,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264851787] [2020-10-20 06:16:10,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:10,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:10,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:10,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:10,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264851787] [2020-10-20 06:16:10,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:10,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 06:16:10,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359742647] [2020-10-20 06:16:10,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 06:16:10,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:10,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:16:10,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:16:10,866 INFO L87 Difference]: Start difference. First operand 229 states and 323 transitions. Second operand 6 states. [2020-10-20 06:16:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:12,361 INFO L93 Difference]: Finished difference Result 346 states and 472 transitions. [2020-10-20 06:16:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:16:12,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-10-20 06:16:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:12,366 INFO L225 Difference]: With dead ends: 346 [2020-10-20 06:16:12,366 INFO L226 Difference]: Without dead ends: 345 [2020-10-20 06:16:12,367 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:16:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2020-10-20 06:16:12,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 302. [2020-10-20 06:16:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-10-20 06:16:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 412 transitions. [2020-10-20 06:16:12,394 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 412 transitions. Word has length 29 [2020-10-20 06:16:12,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:12,397 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 412 transitions. [2020-10-20 06:16:12,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 06:16:12,398 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 412 transitions. [2020-10-20 06:16:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-20 06:16:12,399 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:12,401 INFO L422 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] [2020-10-20 06:16:12,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 06:16:12,402 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:12,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:12,403 INFO L82 PathProgramCache]: Analyzing trace with hash -339825698, now seen corresponding path program 1 times [2020-10-20 06:16:12,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:12,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147532551] [2020-10-20 06:16:12,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:12,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:12,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:12,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:12,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147532551] [2020-10-20 06:16:12,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:12,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 06:16:12,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456049072] [2020-10-20 06:16:12,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 06:16:12,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:12,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:16:12,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:16:12,676 INFO L87 Difference]: Start difference. First operand 302 states and 412 transitions. Second operand 6 states. [2020-10-20 06:16:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:13,618 INFO L93 Difference]: Finished difference Result 364 states and 488 transitions. [2020-10-20 06:16:13,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:16:13,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2020-10-20 06:16:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:13,622 INFO L225 Difference]: With dead ends: 364 [2020-10-20 06:16:13,622 INFO L226 Difference]: Without dead ends: 364 [2020-10-20 06:16:13,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:16:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2020-10-20 06:16:13,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 342. [2020-10-20 06:16:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2020-10-20 06:16:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 463 transitions. [2020-10-20 06:16:13,644 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 463 transitions. Word has length 29 [2020-10-20 06:16:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:13,644 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 463 transitions. [2020-10-20 06:16:13,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 06:16:13,645 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 463 transitions. [2020-10-20 06:16:13,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-10-20 06:16:13,648 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:13,648 INFO L422 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] [2020-10-20 06:16:13,648 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 06:16:13,648 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:13,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:13,649 INFO L82 PathProgramCache]: Analyzing trace with hash -504962935, now seen corresponding path program 1 times [2020-10-20 06:16:13,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:13,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705097873] [2020-10-20 06:16:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:13,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:13,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:13,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:13,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:13,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705097873] [2020-10-20 06:16:13,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:13,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 06:16:13,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017571983] [2020-10-20 06:16:13,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 06:16:13,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:13,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 06:16:13,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 06:16:13,880 INFO L87 Difference]: Start difference. First operand 342 states and 463 transitions. Second operand 6 states. [2020-10-20 06:16:14,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:14,677 INFO L93 Difference]: Finished difference Result 341 states and 460 transitions. [2020-10-20 06:16:14,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 06:16:14,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-10-20 06:16:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:14,681 INFO L225 Difference]: With dead ends: 341 [2020-10-20 06:16:14,682 INFO L226 Difference]: Without dead ends: 341 [2020-10-20 06:16:14,682 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 06:16:14,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2020-10-20 06:16:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2020-10-20 06:16:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-10-20 06:16:14,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 460 transitions. [2020-10-20 06:16:14,710 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 460 transitions. Word has length 39 [2020-10-20 06:16:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:14,711 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 460 transitions. [2020-10-20 06:16:14,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 06:16:14,711 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 460 transitions. [2020-10-20 06:16:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-20 06:16:14,723 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:14,723 INFO L422 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] [2020-10-20 06:16:14,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 06:16:14,724 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:14,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:14,724 INFO L82 PathProgramCache]: Analyzing trace with hash -164117486, now seen corresponding path program 1 times [2020-10-20 06:16:14,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:14,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777990824] [2020-10-20 06:16:14,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:14,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:14,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:14,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:14,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:14,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777990824] [2020-10-20 06:16:14,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:14,986 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 06:16:14,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277691742] [2020-10-20 06:16:14,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 06:16:14,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:14,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:16:14,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:16:14,988 INFO L87 Difference]: Start difference. First operand 341 states and 460 transitions. Second operand 8 states. [2020-10-20 06:16:16,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:16,423 INFO L93 Difference]: Finished difference Result 321 states and 425 transitions. [2020-10-20 06:16:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:16:16,424 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-10-20 06:16:16,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:16,428 INFO L225 Difference]: With dead ends: 321 [2020-10-20 06:16:16,428 INFO L226 Difference]: Without dead ends: 321 [2020-10-20 06:16:16,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:16:16,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-10-20 06:16:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 302. [2020-10-20 06:16:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-10-20 06:16:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 403 transitions. [2020-10-20 06:16:16,442 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 403 transitions. Word has length 47 [2020-10-20 06:16:16,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:16,443 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 403 transitions. [2020-10-20 06:16:16,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 06:16:16,443 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 403 transitions. [2020-10-20 06:16:16,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-20 06:16:16,445 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:16,446 INFO L422 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] [2020-10-20 06:16:16,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 06:16:16,446 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:16,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:16,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1322033219, now seen corresponding path program 1 times [2020-10-20 06:16:16,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:16,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752283193] [2020-10-20 06:16:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:16,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:16,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:16,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:16,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-20 06:16:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:16,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-20 06:16:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:16,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752283193] [2020-10-20 06:16:16,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:16,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 06:16:16,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596018543] [2020-10-20 06:16:16,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 06:16:16,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:16,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:16:16,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:16:16,829 INFO L87 Difference]: Start difference. First operand 302 states and 403 transitions. Second operand 12 states. [2020-10-20 06:16:17,920 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-10-20 06:16:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:18,063 INFO L93 Difference]: Finished difference Result 324 states and 427 transitions. [2020-10-20 06:16:18,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:16:18,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2020-10-20 06:16:18,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:18,067 INFO L225 Difference]: With dead ends: 324 [2020-10-20 06:16:18,067 INFO L226 Difference]: Without dead ends: 324 [2020-10-20 06:16:18,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-10-20 06:16:18,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-10-20 06:16:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 316. [2020-10-20 06:16:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-10-20 06:16:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 419 transitions. [2020-10-20 06:16:18,080 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 419 transitions. Word has length 46 [2020-10-20 06:16:18,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:18,081 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 419 transitions. [2020-10-20 06:16:18,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 06:16:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 419 transitions. [2020-10-20 06:16:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-20 06:16:18,083 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:18,084 INFO L422 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] [2020-10-20 06:16:18,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 06:16:18,084 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:18,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:18,085 INFO L82 PathProgramCache]: Analyzing trace with hash -840477701, now seen corresponding path program 1 times [2020-10-20 06:16:18,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:18,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897542043] [2020-10-20 06:16:18,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:18,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:18,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:18,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:18,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-20 06:16:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:18,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-20 06:16:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:18,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897542043] [2020-10-20 06:16:18,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:18,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 06:16:18,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2958027] [2020-10-20 06:16:18,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 06:16:18,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:18,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:16:18,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:16:18,417 INFO L87 Difference]: Start difference. First operand 316 states and 419 transitions. Second operand 12 states. [2020-10-20 06:16:19,862 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2020-10-20 06:16:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:20,154 INFO L93 Difference]: Finished difference Result 324 states and 426 transitions. [2020-10-20 06:16:20,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:16:20,155 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2020-10-20 06:16:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:20,158 INFO L225 Difference]: With dead ends: 324 [2020-10-20 06:16:20,158 INFO L226 Difference]: Without dead ends: 324 [2020-10-20 06:16:20,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2020-10-20 06:16:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-10-20 06:16:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 317. [2020-10-20 06:16:20,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-10-20 06:16:20,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 420 transitions. [2020-10-20 06:16:20,171 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 420 transitions. Word has length 47 [2020-10-20 06:16:20,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:20,172 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 420 transitions. [2020-10-20 06:16:20,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 06:16:20,172 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 420 transitions. [2020-10-20 06:16:20,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-20 06:16:20,174 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:20,174 INFO L422 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] [2020-10-20 06:16:20,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 06:16:20,175 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:20,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:20,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1756698701, now seen corresponding path program 1 times [2020-10-20 06:16:20,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:20,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118485728] [2020-10-20 06:16:20,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:20,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:20,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:20,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:20,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-10-20 06:16:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:20,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-10-20 06:16:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:20,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118485728] [2020-10-20 06:16:20,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:20,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 06:16:20,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959832194] [2020-10-20 06:16:20,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 06:16:20,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:20,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:16:20,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:16:20,411 INFO L87 Difference]: Start difference. First operand 317 states and 420 transitions. Second operand 8 states. [2020-10-20 06:16:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:21,226 INFO L93 Difference]: Finished difference Result 311 states and 409 transitions. [2020-10-20 06:16:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:16:21,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2020-10-20 06:16:21,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:21,228 INFO L225 Difference]: With dead ends: 311 [2020-10-20 06:16:21,228 INFO L226 Difference]: Without dead ends: 103 [2020-10-20 06:16:21,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:16:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-10-20 06:16:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-10-20 06:16:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-20 06:16:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2020-10-20 06:16:21,233 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 48 [2020-10-20 06:16:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:21,234 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2020-10-20 06:16:21,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 06:16:21,234 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2020-10-20 06:16:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-20 06:16:21,235 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:21,235 INFO L422 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] [2020-10-20 06:16:21,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 06:16:21,236 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:21,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:21,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1076219426, now seen corresponding path program 1 times [2020-10-20 06:16:21,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:21,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184626751] [2020-10-20 06:16:21,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:21,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:21,392 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:21,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:21,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-10-20 06:16:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:21,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:21,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-10-20 06:16:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:21,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184626751] [2020-10-20 06:16:21,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:21,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 06:16:21,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281181919] [2020-10-20 06:16:21,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 06:16:21,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:21,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:16:21,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:16:21,472 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 8 states. [2020-10-20 06:16:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:21,814 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2020-10-20 06:16:21,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:16:21,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-10-20 06:16:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:21,816 INFO L225 Difference]: With dead ends: 101 [2020-10-20 06:16:21,816 INFO L226 Difference]: Without dead ends: 101 [2020-10-20 06:16:21,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:16:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-20 06:16:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-10-20 06:16:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-20 06:16:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 115 transitions. [2020-10-20 06:16:21,821 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 115 transitions. Word has length 54 [2020-10-20 06:16:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:21,822 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 115 transitions. [2020-10-20 06:16:21,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 06:16:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 115 transitions. [2020-10-20 06:16:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-20 06:16:21,823 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:21,823 INFO L422 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] [2020-10-20 06:16:21,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 06:16:21,824 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:21,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2078497852, now seen corresponding path program 1 times [2020-10-20 06:16:21,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:21,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520462247] [2020-10-20 06:16:21,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:21,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:21,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:22,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:22,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:22,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:16:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:22,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:22,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520462247] [2020-10-20 06:16:22,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:22,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 06:16:22,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021280015] [2020-10-20 06:16:22,086 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 06:16:22,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:22,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:16:22,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:16:22,087 INFO L87 Difference]: Start difference. First operand 101 states and 115 transitions. Second operand 11 states. [2020-10-20 06:16:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:22,428 INFO L93 Difference]: Finished difference Result 122 states and 140 transitions. [2020-10-20 06:16:22,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:16:22,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2020-10-20 06:16:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:22,430 INFO L225 Difference]: With dead ends: 122 [2020-10-20 06:16:22,430 INFO L226 Difference]: Without dead ends: 122 [2020-10-20 06:16:22,430 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2020-10-20 06:16:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2020-10-20 06:16:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 113. [2020-10-20 06:16:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-20 06:16:22,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2020-10-20 06:16:22,435 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 58 [2020-10-20 06:16:22,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:22,436 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2020-10-20 06:16:22,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 06:16:22,436 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2020-10-20 06:16:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-20 06:16:22,437 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:22,437 INFO L422 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] [2020-10-20 06:16:22,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 06:16:22,438 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:22,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1308229357, now seen corresponding path program 1 times [2020-10-20 06:16:22,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:22,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21119817] [2020-10-20 06:16:22,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:22,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:22,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:22,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:22,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:22,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:16:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:22,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:22,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21119817] [2020-10-20 06:16:22,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:22,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 06:16:22,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904815850] [2020-10-20 06:16:22,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 06:16:22,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:22,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:16:22,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:16:22,723 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand 11 states. [2020-10-20 06:16:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:23,036 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2020-10-20 06:16:23,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:16:23,036 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2020-10-20 06:16:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:23,037 INFO L225 Difference]: With dead ends: 119 [2020-10-20 06:16:23,037 INFO L226 Difference]: Without dead ends: 112 [2020-10-20 06:16:23,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:16:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-20 06:16:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2020-10-20 06:16:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-20 06:16:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2020-10-20 06:16:23,042 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 58 [2020-10-20 06:16:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:23,043 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2020-10-20 06:16:23,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 06:16:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2020-10-20 06:16:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-20 06:16:23,044 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:23,044 INFO L422 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] [2020-10-20 06:16:23,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 06:16:23,045 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:23,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:23,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1901754731, now seen corresponding path program 1 times [2020-10-20 06:16:23,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:23,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011712434] [2020-10-20 06:16:23,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:16:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:23,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011712434] [2020-10-20 06:16:23,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:23,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 06:16:23,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298752185] [2020-10-20 06:16:23,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 06:16:23,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:23,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 06:16:23,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-20 06:16:23,236 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 8 states. [2020-10-20 06:16:23,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:23,542 INFO L93 Difference]: Finished difference Result 198 states and 224 transitions. [2020-10-20 06:16:23,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 06:16:23,543 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2020-10-20 06:16:23,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:23,545 INFO L225 Difference]: With dead ends: 198 [2020-10-20 06:16:23,545 INFO L226 Difference]: Without dead ends: 198 [2020-10-20 06:16:23,546 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:16:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-10-20 06:16:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 185. [2020-10-20 06:16:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-10-20 06:16:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 211 transitions. [2020-10-20 06:16:23,552 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 211 transitions. Word has length 59 [2020-10-20 06:16:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:23,553 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 211 transitions. [2020-10-20 06:16:23,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 06:16:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 211 transitions. [2020-10-20 06:16:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-20 06:16:23,555 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:23,555 INFO L422 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] [2020-10-20 06:16:23,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 06:16:23,555 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:23,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:23,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1583865939, now seen corresponding path program 1 times [2020-10-20 06:16:23,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:23,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347974410] [2020-10-20 06:16:23,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:16:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:23,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:23,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347974410] [2020-10-20 06:16:23,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:23,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 06:16:23,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138172150] [2020-10-20 06:16:23,813 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-20 06:16:23,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:23,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 06:16:23,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:16:23,814 INFO L87 Difference]: Start difference. First operand 185 states and 211 transitions. Second operand 10 states. [2020-10-20 06:16:23,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:23,985 INFO L93 Difference]: Finished difference Result 173 states and 193 transitions. [2020-10-20 06:16:23,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:16:23,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2020-10-20 06:16:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:23,988 INFO L225 Difference]: With dead ends: 173 [2020-10-20 06:16:23,988 INFO L226 Difference]: Without dead ends: 173 [2020-10-20 06:16:23,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:16:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-10-20 06:16:23,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-10-20 06:16:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-10-20 06:16:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 193 transitions. [2020-10-20 06:16:23,995 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 193 transitions. Word has length 59 [2020-10-20 06:16:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:23,995 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 193 transitions. [2020-10-20 06:16:23,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-20 06:16:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 193 transitions. [2020-10-20 06:16:23,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-20 06:16:23,997 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:23,997 INFO L422 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] [2020-10-20 06:16:23,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 06:16:23,998 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash -458128180, now seen corresponding path program 1 times [2020-10-20 06:16:23,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:23,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75914912] [2020-10-20 06:16:23,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:24,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:24,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:24,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:24,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:24,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:16:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:24,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:24,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-20 06:16:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:24,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75914912] [2020-10-20 06:16:24,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:24,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 06:16:24,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474260724] [2020-10-20 06:16:24,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 06:16:24,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:24,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:16:24,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:16:24,276 INFO L87 Difference]: Start difference. First operand 173 states and 193 transitions. Second operand 12 states. [2020-10-20 06:16:24,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:24,774 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2020-10-20 06:16:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 06:16:24,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2020-10-20 06:16:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:24,776 INFO L225 Difference]: With dead ends: 161 [2020-10-20 06:16:24,777 INFO L226 Difference]: Without dead ends: 157 [2020-10-20 06:16:24,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2020-10-20 06:16:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-10-20 06:16:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2020-10-20 06:16:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-10-20 06:16:24,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2020-10-20 06:16:24,783 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 63 [2020-10-20 06:16:24,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:24,784 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2020-10-20 06:16:24,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 06:16:24,784 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2020-10-20 06:16:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-20 06:16:24,785 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:24,786 INFO L422 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] [2020-10-20 06:16:24,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-20 06:16:24,786 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:24,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1363713922, now seen corresponding path program 1 times [2020-10-20 06:16:24,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:24,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270578919] [2020-10-20 06:16:24,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:24,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:24,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:24,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:24,990 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:25,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:16:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:25,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:25,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-20 06:16:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:25,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:25,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270578919] [2020-10-20 06:16:25,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:25,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 06:16:25,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764665347] [2020-10-20 06:16:25,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 06:16:25,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:25,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:16:25,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:16:25,072 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand 9 states. [2020-10-20 06:16:25,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:25,386 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2020-10-20 06:16:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 06:16:25,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-10-20 06:16:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:25,389 INFO L225 Difference]: With dead ends: 169 [2020-10-20 06:16:25,389 INFO L226 Difference]: Without dead ends: 169 [2020-10-20 06:16:25,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:16:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2020-10-20 06:16:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2020-10-20 06:16:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-10-20 06:16:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 179 transitions. [2020-10-20 06:16:25,402 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 179 transitions. Word has length 65 [2020-10-20 06:16:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:25,403 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 179 transitions. [2020-10-20 06:16:25,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 06:16:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2020-10-20 06:16:25,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-20 06:16:25,405 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:25,405 INFO L422 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] [2020-10-20 06:16:25,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-20 06:16:25,406 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:25,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:25,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1149867629, now seen corresponding path program 1 times [2020-10-20 06:16:25,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:25,408 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048398269] [2020-10-20 06:16:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:25,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:25,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:25,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:25,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:25,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:16:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:25,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:25,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-20 06:16:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:25,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048398269] [2020-10-20 06:16:25,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:25,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 06:16:25,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554328141] [2020-10-20 06:16:25,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 06:16:25,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:25,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:16:25,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:16:25,695 INFO L87 Difference]: Start difference. First operand 163 states and 179 transitions. Second operand 9 states. [2020-10-20 06:16:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:25,964 INFO L93 Difference]: Finished difference Result 181 states and 198 transitions. [2020-10-20 06:16:25,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:16:25,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2020-10-20 06:16:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:25,966 INFO L225 Difference]: With dead ends: 181 [2020-10-20 06:16:25,967 INFO L226 Difference]: Without dead ends: 179 [2020-10-20 06:16:25,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-10-20 06:16:25,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-20 06:16:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2020-10-20 06:16:25,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-10-20 06:16:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2020-10-20 06:16:25,975 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 182 transitions. Word has length 65 [2020-10-20 06:16:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:25,976 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 182 transitions. [2020-10-20 06:16:25,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 06:16:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 182 transitions. [2020-10-20 06:16:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-20 06:16:25,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:25,980 INFO L422 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] [2020-10-20 06:16:25,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-20 06:16:25,981 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash -651239234, now seen corresponding path program 1 times [2020-10-20 06:16:25,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:25,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493215057] [2020-10-20 06:16:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:26,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:26,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:26,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:26,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:26,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:16:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:26,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:26,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-20 06:16:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:26,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493215057] [2020-10-20 06:16:26,346 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:26,346 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 06:16:26,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089621907] [2020-10-20 06:16:26,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 06:16:26,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:26,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:16:26,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:16:26,359 INFO L87 Difference]: Start difference. First operand 167 states and 182 transitions. Second operand 12 states. [2020-10-20 06:16:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:26,839 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2020-10-20 06:16:26,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:16:26,840 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2020-10-20 06:16:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:26,841 INFO L225 Difference]: With dead ends: 176 [2020-10-20 06:16:26,842 INFO L226 Difference]: Without dead ends: 176 [2020-10-20 06:16:26,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:16:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-20 06:16:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 167. [2020-10-20 06:16:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2020-10-20 06:16:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 180 transitions. [2020-10-20 06:16:26,853 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 180 transitions. Word has length 65 [2020-10-20 06:16:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:26,854 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 180 transitions. [2020-10-20 06:16:26,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 06:16:26,854 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2020-10-20 06:16:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-20 06:16:26,858 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:26,858 INFO L422 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] [2020-10-20 06:16:26,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-20 06:16:26,859 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:26,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:26,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1790483582, now seen corresponding path program 1 times [2020-10-20 06:16:26,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:26,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516195090] [2020-10-20 06:16:26,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:27,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:27,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:27,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:27,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:27,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:16:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:27,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:27,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-20 06:16:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:27,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516195090] [2020-10-20 06:16:27,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:27,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 06:16:27,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129626955] [2020-10-20 06:16:27,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 06:16:27,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:27,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:16:27,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:16:27,227 INFO L87 Difference]: Start difference. First operand 167 states and 180 transitions. Second operand 12 states. [2020-10-20 06:16:27,589 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-20 06:16:28,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:28,004 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2020-10-20 06:16:28,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 06:16:28,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2020-10-20 06:16:28,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:28,006 INFO L225 Difference]: With dead ends: 164 [2020-10-20 06:16:28,006 INFO L226 Difference]: Without dead ends: 145 [2020-10-20 06:16:28,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2020-10-20 06:16:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-20 06:16:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-10-20 06:16:28,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-10-20 06:16:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2020-10-20 06:16:28,012 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 66 [2020-10-20 06:16:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:28,013 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2020-10-20 06:16:28,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 06:16:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2020-10-20 06:16:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-20 06:16:28,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:28,014 INFO L422 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] [2020-10-20 06:16:28,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-20 06:16:28,014 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:28,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:28,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1433605103, now seen corresponding path program 1 times [2020-10-20 06:16:28,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:28,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172640492] [2020-10-20 06:16:28,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:28,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:28,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:28,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:28,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:28,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:16:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:28,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:28,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-20 06:16:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:28,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172640492] [2020-10-20 06:16:28,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:28,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-20 06:16:28,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532547469] [2020-10-20 06:16:28,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 06:16:28,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:28,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 06:16:28,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:16:28,336 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 12 states. [2020-10-20 06:16:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:28,785 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2020-10-20 06:16:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 06:16:28,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2020-10-20 06:16:28,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:28,787 INFO L225 Difference]: With dead ends: 145 [2020-10-20 06:16:28,788 INFO L226 Difference]: Without dead ends: 145 [2020-10-20 06:16:28,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:16:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-20 06:16:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-10-20 06:16:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-10-20 06:16:28,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2020-10-20 06:16:28,794 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 66 [2020-10-20 06:16:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:28,794 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2020-10-20 06:16:28,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 06:16:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2020-10-20 06:16:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-20 06:16:28,796 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:28,796 INFO L422 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] [2020-10-20 06:16:28,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-20 06:16:28,796 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:28,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:28,797 INFO L82 PathProgramCache]: Analyzing trace with hash 101258944, now seen corresponding path program 1 times [2020-10-20 06:16:28,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:28,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201505487] [2020-10-20 06:16:28,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:28,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:28,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:16:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-20 06:16:29,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:29,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201505487] [2020-10-20 06:16:29,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:29,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-20 06:16:29,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235688528] [2020-10-20 06:16:29,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 06:16:29,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:29,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 06:16:29,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-10-20 06:16:29,148 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand 9 states. [2020-10-20 06:16:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:29,431 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2020-10-20 06:16:29,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:16:29,432 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-10-20 06:16:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:29,433 INFO L225 Difference]: With dead ends: 140 [2020-10-20 06:16:29,434 INFO L226 Difference]: Without dead ends: 138 [2020-10-20 06:16:29,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-10-20 06:16:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-10-20 06:16:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2020-10-20 06:16:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-20 06:16:29,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2020-10-20 06:16:29,440 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 66 [2020-10-20 06:16:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:29,440 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2020-10-20 06:16:29,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 06:16:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2020-10-20 06:16:29,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-20 06:16:29,442 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 06:16:29,442 INFO L422 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] [2020-10-20 06:16:29,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-20 06:16:29,443 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2020-10-20 06:16:29,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 06:16:29,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1317067693, now seen corresponding path program 1 times [2020-10-20 06:16:29,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 06:16:29,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96517904] [2020-10-20 06:16:29,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 06:16:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 06:16:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 06:16:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-10-20 06:16:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-10-20 06:16:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-20 06:16:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,631 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-10-20 06:16:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-20 06:16:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2020-10-20 06:16:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 06:16:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 06:16:29,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96517904] [2020-10-20 06:16:29,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 06:16:29,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 06:16:29,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225848755] [2020-10-20 06:16:29,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 06:16:29,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 06:16:29,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 06:16:29,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-10-20 06:16:29,680 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand 11 states. [2020-10-20 06:16:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 06:16:29,888 INFO L93 Difference]: Finished difference Result 108 states and 107 transitions. [2020-10-20 06:16:29,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 06:16:29,890 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2020-10-20 06:16:29,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 06:16:29,891 INFO L225 Difference]: With dead ends: 108 [2020-10-20 06:16:29,891 INFO L226 Difference]: Without dead ends: 0 [2020-10-20 06:16:29,892 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2020-10-20 06:16:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-20 06:16:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-20 06:16:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-20 06:16:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 06:16:29,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2020-10-20 06:16:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 06:16:29,893 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 06:16:29,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 06:16:29,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-20 06:16:29,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-20 06:16:29,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-20 06:16:29,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 06:16:29 BoogieIcfgContainer [2020-10-20 06:16:29,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 06:16:29,899 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 06:16:29,899 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 06:16:29,899 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 06:16:29,899 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 06:16:07" (3/4) ... [2020-10-20 06:16:29,903 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-20 06:16:29,909 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reach_error [2020-10-20 06:16:29,909 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2020-10-20 06:16:29,909 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2020-10-20 06:16:29,909 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2020-10-20 06:16:29,909 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Power [2020-10-20 06:16:29,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2020-10-20 06:16:29,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2020-10-20 06:16:29,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-10-20 06:16:29,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2020-10-20 06:16:29,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2020-10-20 06:16:29,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2020-10-20 06:16:29,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-10-20 06:16:29,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_CreateClose [2020-10-20 06:16:29,911 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_InternIoCtl [2020-10-20 06:16:29,911 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2020-10-20 06:16:29,911 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2020-10-20 06:16:29,911 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_DispatchPassThrough [2020-10-20 06:16:29,911 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_PnP [2020-10-20 06:16:29,930 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2020-10-20 06:16:29,932 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2020-10-20 06:16:29,933 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-20 06:16:29,935 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-20 06:16:30,100 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 06:16:30,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 06:16:30,102 INFO L168 Benchmark]: Toolchain (without parser) took 24036.09 ms. Allocated memory was 36.7 MB in the beginning and 166.2 MB in the end (delta: 129.5 MB). Free memory was 17.6 MB in the beginning and 115.3 MB in the end (delta: -97.7 MB). Peak memory consumption was 31.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:16:30,102 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 34.1 MB. Free memory was 10.8 MB in the beginning and 10.7 MB in the end (delta: 47.6 kB). Peak memory consumption was 47.6 kB. Max. memory is 14.3 GB. [2020-10-20 06:16:30,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.23 ms. Allocated memory was 36.7 MB in the beginning and 45.1 MB in the end (delta: 8.4 MB). Free memory was 16.6 MB in the beginning and 18.4 MB in the end (delta: -1.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:16:30,104 INFO L168 Benchmark]: Boogie Preprocessor took 80.10 ms. Allocated memory was 45.1 MB in the beginning and 46.1 MB in the end (delta: 1.0 MB). Free memory was 18.4 MB in the beginning and 26.9 MB in the end (delta: -8.5 MB). Peak memory consumption was 5.7 MB. Max. memory is 14.3 GB. [2020-10-20 06:16:30,104 INFO L168 Benchmark]: RCFGBuilder took 1134.94 ms. Allocated memory was 46.1 MB in the beginning and 51.4 MB in the end (delta: 5.2 MB). Free memory was 26.9 MB in the beginning and 28.3 MB in the end (delta: -1.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 14.3 GB. [2020-10-20 06:16:30,104 INFO L168 Benchmark]: TraceAbstraction took 21940.79 ms. Allocated memory was 51.4 MB in the beginning and 166.2 MB in the end (delta: 114.8 MB). Free memory was 27.9 MB in the beginning and 134.2 MB in the end (delta: -106.3 MB). Peak memory consumption was 8.5 MB. Max. memory is 14.3 GB. [2020-10-20 06:16:30,105 INFO L168 Benchmark]: Witness Printer took 201.66 ms. Allocated memory is still 166.2 MB. Free memory was 134.2 MB in the beginning and 115.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 14.3 GB. [2020-10-20 06:16:30,107 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.61 ms. Allocated memory is still 34.1 MB. Free memory was 10.8 MB in the beginning and 10.7 MB in the end (delta: 47.6 kB). Peak memory consumption was 47.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 663.23 ms. Allocated memory was 36.7 MB in the beginning and 45.1 MB in the end (delta: 8.4 MB). Free memory was 16.6 MB in the beginning and 18.4 MB in the end (delta: -1.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 80.10 ms. Allocated memory was 45.1 MB in the beginning and 46.1 MB in the end (delta: 1.0 MB). Free memory was 18.4 MB in the beginning and 26.9 MB in the end (delta: -8.5 MB). Peak memory consumption was 5.7 MB. Max. memory is 14.3 GB. * RCFGBuilder took 1134.94 ms. Allocated memory was 46.1 MB in the beginning and 51.4 MB in the end (delta: 5.2 MB). Free memory was 26.9 MB in the beginning and 28.3 MB in the end (delta: -1.4 MB). Peak memory consumption was 18.8 MB. Max. memory is 14.3 GB. * TraceAbstraction took 21940.79 ms. Allocated memory was 51.4 MB in the beginning and 166.2 MB in the end (delta: 114.8 MB). Free memory was 27.9 MB in the beginning and 134.2 MB in the end (delta: -106.3 MB). Peak memory consumption was 8.5 MB. Max. memory is 14.3 GB. * Witness Printer took 201.66 ms. Allocated memory is still 166.2 MB. Free memory was 134.2 MB in the beginning and 115.3 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 295]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 19 procedures, 244 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 21.8s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3459 SDtfs, 5150 SDslu, 3843 SDs, 0 SdLazy, 7594 SolverSat, 1274 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 209 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1142 NumberOfCodeBlocks, 1142 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1120 ConstructedInterpolants, 0 QuantifiedInterpolants, 309831 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...