./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i -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 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 00:12:44,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 00:12:44,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 00:12:44,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 00:12:44,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 00:12:44,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 00:12:44,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 00:12:44,923 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 00:12:44,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 00:12:44,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 00:12:44,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 00:12:44,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 00:12:44,932 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 00:12:44,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 00:12:44,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 00:12:44,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 00:12:44,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 00:12:44,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 00:12:44,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 00:12:44,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 00:12:44,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 00:12:44,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 00:12:44,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 00:12:44,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 00:12:44,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 00:12:44,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 00:12:44,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 00:12:44,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 00:12:44,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 00:12:44,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 00:12:44,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 00:12:44,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 00:12:44,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 00:12:44,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 00:12:44,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 00:12:44,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 00:12:44,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 00:12:44,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 00:12:44,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 00:12:44,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 00:12:44,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 00:12:44,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 00:12:45,005 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 00:12:45,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 00:12:45,006 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 00:12:45,006 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 00:12:45,007 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 00:12:45,007 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 00:12:45,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 00:12:45,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 00:12:45,008 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 00:12:45,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 00:12:45,009 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 00:12:45,009 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 00:12:45,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 00:12:45,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 00:12:45,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 00:12:45,010 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 00:12:45,010 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 00:12:45,010 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 00:12:45,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 00:12:45,011 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 00:12:45,011 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 00:12:45,011 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 00:12:45,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 00:12:45,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 00:12:45,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 00:12:45,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:12:45,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 00:12:45,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 00:12:45,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 00:12:45,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 00:12:45,014 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 00:12:45,014 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2021-12-22 00:12:45,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 00:12:45,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 00:12:45,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 00:12:45,302 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 00:12:45,303 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 00:12:45,304 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2021-12-22 00:12:45,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58f638c26/ea949905f3884ad0830024a511749627/FLAG311a0bcf9 [2021-12-22 00:12:45,748 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 00:12:45,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2021-12-22 00:12:45,775 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58f638c26/ea949905f3884ad0830024a511749627/FLAG311a0bcf9 [2021-12-22 00:12:46,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58f638c26/ea949905f3884ad0830024a511749627 [2021-12-22 00:12:46,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 00:12:46,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 00:12:46,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 00:12:46,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 00:12:46,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 00:12:46,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:12:46" (1/1) ... [2021-12-22 00:12:46,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59998d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46, skipping insertion in model container [2021-12-22 00:12:46,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:12:46" (1/1) ... [2021-12-22 00:12:46,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 00:12:46,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 00:12:46,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2021-12-22 00:12:46,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2021-12-22 00:12:46,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2021-12-22 00:12:46,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:12:46,419 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 00:12:46,445 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2021-12-22 00:12:46,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2021-12-22 00:12:46,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2021-12-22 00:12:46,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:12:46,471 INFO L208 MainTranslator]: Completed translation [2021-12-22 00:12:46,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46 WrapperNode [2021-12-22 00:12:46,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 00:12:46,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 00:12:46,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 00:12:46,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 00:12:46,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46" (1/1) ... [2021-12-22 00:12:46,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46" (1/1) ... [2021-12-22 00:12:46,520 INFO L137 Inliner]: procedures = 119, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2021-12-22 00:12:46,520 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 00:12:46,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 00:12:46,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 00:12:46,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 00:12:46,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46" (1/1) ... [2021-12-22 00:12:46,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46" (1/1) ... [2021-12-22 00:12:46,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46" (1/1) ... [2021-12-22 00:12:46,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46" (1/1) ... [2021-12-22 00:12:46,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46" (1/1) ... [2021-12-22 00:12:46,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46" (1/1) ... [2021-12-22 00:12:46,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46" (1/1) ... [2021-12-22 00:12:46,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 00:12:46,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 00:12:46,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 00:12:46,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 00:12:46,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46" (1/1) ... [2021-12-22 00:12:46,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:12:46,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:46,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 00:12:46,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 00:12:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 00:12:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 00:12:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 00:12:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 00:12:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 00:12:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 00:12:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 00:12:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 00:12:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 00:12:46,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 00:12:46,717 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 00:12:46,718 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 00:12:47,012 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 00:12:47,016 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 00:12:47,016 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-22 00:12:47,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:12:47 BoogieIcfgContainer [2021-12-22 00:12:47,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 00:12:47,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 00:12:47,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 00:12:47,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 00:12:47,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 12:12:46" (1/3) ... [2021-12-22 00:12:47,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4670bc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:12:47, skipping insertion in model container [2021-12-22 00:12:47,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:46" (2/3) ... [2021-12-22 00:12:47,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4670bc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:12:47, skipping insertion in model container [2021-12-22 00:12:47,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:12:47" (3/3) ... [2021-12-22 00:12:47,025 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2021-12-22 00:12:47,029 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 00:12:47,029 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2021-12-22 00:12:47,061 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 00:12:47,067 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 00:12:47,067 INFO L340 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2021-12-22 00:12:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 65 states have (on average 2.123076923076923) internal successors, (138), 120 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 00:12:47,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:47,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 00:12:47,085 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:47,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:47,088 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 00:12:47,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:47,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939094732] [2021-12-22 00:12:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:47,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:47,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:47,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:47,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939094732] [2021-12-22 00:12:47,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939094732] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:47,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:47,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:12:47,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342000055] [2021-12-22 00:12:47,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:47,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:47,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:47,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:47,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:47,227 INFO L87 Difference]: Start difference. First operand has 121 states, 65 states have (on average 2.123076923076923) internal successors, (138), 120 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:47,353 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-12-22 00:12:47,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:47,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 00:12:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:47,361 INFO L225 Difference]: With dead ends: 123 [2021-12-22 00:12:47,361 INFO L226 Difference]: Without dead ends: 119 [2021-12-22 00:12:47,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:47,366 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:47,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 73 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:47,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-22 00:12:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2021-12-22 00:12:47,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 114 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2021-12-22 00:12:47,393 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 3 [2021-12-22 00:12:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:47,393 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2021-12-22 00:12:47,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2021-12-22 00:12:47,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 00:12:47,394 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:47,394 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 00:12:47,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 00:12:47,395 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:47,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:47,395 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 00:12:47,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:47,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372737148] [2021-12-22 00:12:47,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:47,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:47,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:47,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372737148] [2021-12-22 00:12:47,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372737148] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:47,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:47,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:12:47,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229097294] [2021-12-22 00:12:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:47,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:47,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:47,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:47,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:47,426 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:47,497 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2021-12-22 00:12:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:47,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 00:12:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:47,498 INFO L225 Difference]: With dead ends: 133 [2021-12-22 00:12:47,499 INFO L226 Difference]: Without dead ends: 133 [2021-12-22 00:12:47,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:47,500 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 98 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:47,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 78 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:47,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-22 00:12:47,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2021-12-22 00:12:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.7397260273972603) internal successors, (127), 119 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2021-12-22 00:12:47,506 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 3 [2021-12-22 00:12:47,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:47,506 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2021-12-22 00:12:47,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2021-12-22 00:12:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 00:12:47,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:47,507 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:47,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 00:12:47,507 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:47,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2021-12-22 00:12:47,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:47,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758110603] [2021-12-22 00:12:47,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:47,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:47,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:47,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758110603] [2021-12-22 00:12:47,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758110603] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:47,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:47,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:12:47,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770369300] [2021-12-22 00:12:47,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:47,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:12:47,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:47,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:12:47,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:12:47,554 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:47,651 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2021-12-22 00:12:47,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:12:47,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-22 00:12:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:47,653 INFO L225 Difference]: With dead ends: 127 [2021-12-22 00:12:47,653 INFO L226 Difference]: Without dead ends: 127 [2021-12-22 00:12:47,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:47,654 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 161 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:47,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 61 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:47,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-22 00:12:47,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 112. [2021-12-22 00:12:47,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 76 states have (on average 1.605263157894737) internal successors, (122), 111 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2021-12-22 00:12:47,659 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 8 [2021-12-22 00:12:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:47,659 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2021-12-22 00:12:47,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2021-12-22 00:12:47,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-22 00:12:47,660 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:47,660 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:47,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 00:12:47,661 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:47,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2021-12-22 00:12:47,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:47,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862374069] [2021-12-22 00:12:47,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:47,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:47,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:47,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:47,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862374069] [2021-12-22 00:12:47,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862374069] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:47,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:47,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:47,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881515613] [2021-12-22 00:12:47,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:47,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:47,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:47,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:47,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:47,731 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:47,982 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2021-12-22 00:12:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:12:47,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-22 00:12:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:47,983 INFO L225 Difference]: With dead ends: 151 [2021-12-22 00:12:47,983 INFO L226 Difference]: Without dead ends: 151 [2021-12-22 00:12:47,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:12:47,984 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 152 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:47,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 115 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:47,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-22 00:12:47,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 122. [2021-12-22 00:12:47,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.5402298850574712) internal successors, (134), 121 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2021-12-22 00:12:47,990 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 8 [2021-12-22 00:12:47,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:47,990 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2021-12-22 00:12:47,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:47,990 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2021-12-22 00:12:47,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 00:12:47,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:47,991 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:47,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 00:12:47,991 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:47,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1117785369, now seen corresponding path program 1 times [2021-12-22 00:12:47,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:47,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655792531] [2021-12-22 00:12:47,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:47,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:48,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:48,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655792531] [2021-12-22 00:12:48,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655792531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:48,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:48,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:12:48,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321627986] [2021-12-22 00:12:48,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:48,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:12:48,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:48,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:12:48,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:12:48,031 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:48,112 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2021-12-22 00:12:48,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:12:48,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-22 00:12:48,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:48,113 INFO L225 Difference]: With dead ends: 136 [2021-12-22 00:12:48,113 INFO L226 Difference]: Without dead ends: 136 [2021-12-22 00:12:48,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:48,114 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 121 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:48,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 130 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:48,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-22 00:12:48,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2021-12-22 00:12:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 86 states have (on average 1.5116279069767442) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2021-12-22 00:12:48,119 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 10 [2021-12-22 00:12:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:48,119 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2021-12-22 00:12:48,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2021-12-22 00:12:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 00:12:48,120 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:48,120 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:48,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 00:12:48,120 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:48,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:48,121 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-22 00:12:48,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:48,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583333692] [2021-12-22 00:12:48,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:48,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:48,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:48,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583333692] [2021-12-22 00:12:48,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583333692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:48,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:48,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:48,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107858734] [2021-12-22 00:12:48,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:48,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:48,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:48,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:48,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:48,172 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:48,318 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2021-12-22 00:12:48,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 00:12:48,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 00:12:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:48,319 INFO L225 Difference]: With dead ends: 121 [2021-12-22 00:12:48,319 INFO L226 Difference]: Without dead ends: 121 [2021-12-22 00:12:48,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:12:48,320 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:48,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 240 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:48,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-22 00:12:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2021-12-22 00:12:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 86 states have (on average 1.5) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2021-12-22 00:12:48,324 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 12 [2021-12-22 00:12:48,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:48,324 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2021-12-22 00:12:48,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2021-12-22 00:12:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 00:12:48,325 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:48,325 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:48,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 00:12:48,325 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:48,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-22 00:12:48,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:48,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027505110] [2021-12-22 00:12:48,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:48,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:48,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:48,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027505110] [2021-12-22 00:12:48,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027505110] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:48,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:48,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:48,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793198134] [2021-12-22 00:12:48,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:48,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:48,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:48,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:48,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:48,385 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:48,543 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2021-12-22 00:12:48,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 00:12:48,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 00:12:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:48,544 INFO L225 Difference]: With dead ends: 121 [2021-12-22 00:12:48,544 INFO L226 Difference]: Without dead ends: 121 [2021-12-22 00:12:48,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:12:48,545 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 18 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:48,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 276 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-22 00:12:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2021-12-22 00:12:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 86 states have (on average 1.441860465116279) internal successors, (124), 113 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2021-12-22 00:12:48,547 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 12 [2021-12-22 00:12:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:48,548 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2021-12-22 00:12:48,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2021-12-22 00:12:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-22 00:12:48,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:48,548 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:48,548 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 00:12:48,548 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:48,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1066467192, now seen corresponding path program 1 times [2021-12-22 00:12:48,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:48,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310771441] [2021-12-22 00:12:48,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:48,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:48,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:48,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:48,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310771441] [2021-12-22 00:12:48,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310771441] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:48,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:48,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 00:12:48,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973838022] [2021-12-22 00:12:48,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:48,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:48,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:48,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:48,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:48,603 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:48,731 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2021-12-22 00:12:48,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:12:48,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-22 00:12:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:48,733 INFO L225 Difference]: With dead ends: 177 [2021-12-22 00:12:48,733 INFO L226 Difference]: Without dead ends: 177 [2021-12-22 00:12:48,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:12:48,734 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 160 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:48,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 235 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-12-22 00:12:48,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 121. [2021-12-22 00:12:48,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 120 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2021-12-22 00:12:48,737 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 13 [2021-12-22 00:12:48,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:48,737 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2021-12-22 00:12:48,737 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2021-12-22 00:12:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 00:12:48,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:48,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:48,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 00:12:48,738 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:48,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:48,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1154665855, now seen corresponding path program 1 times [2021-12-22 00:12:48,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:48,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031670856] [2021-12-22 00:12:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:48,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:48,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 00:12:48,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031670856] [2021-12-22 00:12:48,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031670856] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:48,799 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:48,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:48,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938108364] [2021-12-22 00:12:48,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:48,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:12:48,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 00:12:48,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:12:48,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:48,800 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:48,884 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2021-12-22 00:12:48,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:12:48,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-22 00:12:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:48,885 INFO L225 Difference]: With dead ends: 127 [2021-12-22 00:12:48,885 INFO L226 Difference]: Without dead ends: 127 [2021-12-22 00:12:48,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:48,886 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 14 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:48,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 266 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-22 00:12:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 120. [2021-12-22 00:12:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2021-12-22 00:12:48,889 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 19 [2021-12-22 00:12:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:48,889 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2021-12-22 00:12:48,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2021-12-22 00:12:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-22 00:12:48,890 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:48,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:48,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 00:12:48,890 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:48,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1154976737, now seen corresponding path program 1 times [2021-12-22 00:12:48,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 00:12:48,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687287340] [2021-12-22 00:12:48,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:48,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 00:12:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 00:12:48,900 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 00:12:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 00:12:48,922 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 00:12:48,922 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 00:12:48,923 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2021-12-22 00:12:48,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (53 of 55 remaining) [2021-12-22 00:12:48,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (52 of 55 remaining) [2021-12-22 00:12:48,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (51 of 55 remaining) [2021-12-22 00:12:48,924 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (50 of 55 remaining) [2021-12-22 00:12:48,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (49 of 55 remaining) [2021-12-22 00:12:48,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (48 of 55 remaining) [2021-12-22 00:12:48,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (47 of 55 remaining) [2021-12-22 00:12:48,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (46 of 55 remaining) [2021-12-22 00:12:48,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (45 of 55 remaining) [2021-12-22 00:12:48,925 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (44 of 55 remaining) [2021-12-22 00:12:48,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (43 of 55 remaining) [2021-12-22 00:12:48,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (42 of 55 remaining) [2021-12-22 00:12:48,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (41 of 55 remaining) [2021-12-22 00:12:48,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (40 of 55 remaining) [2021-12-22 00:12:48,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (39 of 55 remaining) [2021-12-22 00:12:48,926 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (38 of 55 remaining) [2021-12-22 00:12:48,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (37 of 55 remaining) [2021-12-22 00:12:48,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (36 of 55 remaining) [2021-12-22 00:12:48,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (35 of 55 remaining) [2021-12-22 00:12:48,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (34 of 55 remaining) [2021-12-22 00:12:48,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (33 of 55 remaining) [2021-12-22 00:12:48,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (32 of 55 remaining) [2021-12-22 00:12:48,927 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (31 of 55 remaining) [2021-12-22 00:12:48,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (30 of 55 remaining) [2021-12-22 00:12:48,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (29 of 55 remaining) [2021-12-22 00:12:48,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (28 of 55 remaining) [2021-12-22 00:12:48,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (27 of 55 remaining) [2021-12-22 00:12:48,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (26 of 55 remaining) [2021-12-22 00:12:48,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (25 of 55 remaining) [2021-12-22 00:12:48,928 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (24 of 55 remaining) [2021-12-22 00:12:48,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (23 of 55 remaining) [2021-12-22 00:12:48,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (22 of 55 remaining) [2021-12-22 00:12:48,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (21 of 55 remaining) [2021-12-22 00:12:48,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (20 of 55 remaining) [2021-12-22 00:12:48,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (19 of 55 remaining) [2021-12-22 00:12:48,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (18 of 55 remaining) [2021-12-22 00:12:48,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (17 of 55 remaining) [2021-12-22 00:12:48,929 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (16 of 55 remaining) [2021-12-22 00:12:48,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (15 of 55 remaining) [2021-12-22 00:12:48,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (14 of 55 remaining) [2021-12-22 00:12:48,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (13 of 55 remaining) [2021-12-22 00:12:48,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (12 of 55 remaining) [2021-12-22 00:12:48,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (11 of 55 remaining) [2021-12-22 00:12:48,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (10 of 55 remaining) [2021-12-22 00:12:48,930 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (9 of 55 remaining) [2021-12-22 00:12:48,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (8 of 55 remaining) [2021-12-22 00:12:48,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (7 of 55 remaining) [2021-12-22 00:12:48,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (6 of 55 remaining) [2021-12-22 00:12:48,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (5 of 55 remaining) [2021-12-22 00:12:48,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (4 of 55 remaining) [2021-12-22 00:12:48,931 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (3 of 55 remaining) [2021-12-22 00:12:48,932 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (2 of 55 remaining) [2021-12-22 00:12:48,932 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (1 of 55 remaining) [2021-12-22 00:12:48,932 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (0 of 55 remaining) [2021-12-22 00:12:48,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 00:12:48,934 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:48,936 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 00:12:48,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 12:12:48 BoogieIcfgContainer [2021-12-22 00:12:48,951 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 00:12:48,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 00:12:48,951 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 00:12:48,952 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 00:12:48,952 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:12:47" (3/4) ... [2021-12-22 00:12:48,954 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-22 00:12:48,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 00:12:48,954 INFO L158 Benchmark]: Toolchain (without parser) took 2866.76ms. Allocated memory was 119.5MB in the beginning and 155.2MB in the end (delta: 35.7MB). Free memory was 83.0MB in the beginning and 91.8MB in the end (delta: -8.7MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2021-12-22 00:12:48,954 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 00:12:48,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.74ms. Allocated memory is still 119.5MB. Free memory was 82.8MB in the beginning and 88.5MB in the end (delta: -5.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 00:12:48,955 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.27ms. Allocated memory is still 119.5MB. Free memory was 88.5MB in the beginning and 86.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 00:12:48,955 INFO L158 Benchmark]: Boogie Preprocessor took 22.59ms. Allocated memory is still 119.5MB. Free memory was 86.5MB in the beginning and 84.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 00:12:48,955 INFO L158 Benchmark]: RCFGBuilder took 473.95ms. Allocated memory is still 119.5MB. Free memory was 84.5MB in the beginning and 66.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-22 00:12:48,955 INFO L158 Benchmark]: TraceAbstraction took 1932.36ms. Allocated memory was 119.5MB in the beginning and 155.2MB in the end (delta: 35.7MB). Free memory was 65.6MB in the beginning and 91.8MB in the end (delta: -26.1MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2021-12-22 00:12:48,956 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 155.2MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 00:12:48,957 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.14ms. Allocated memory is still 119.5MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.74ms. Allocated memory is still 119.5MB. Free memory was 82.8MB in the beginning and 88.5MB in the end (delta: -5.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.27ms. Allocated memory is still 119.5MB. Free memory was 88.5MB in the beginning and 86.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.59ms. Allocated memory is still 119.5MB. Free memory was 86.5MB in the beginning and 84.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 473.95ms. Allocated memory is still 119.5MB. Free memory was 84.5MB in the beginning and 66.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1932.36ms. Allocated memory was 119.5MB in the beginning and 155.2MB in the end (delta: 35.7MB). Free memory was 65.6MB in the beginning and 91.8MB in the end (delta: -26.1MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 155.2MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1049. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) VAL [list={-1:0}] [L1008] list->colour = BLACK VAL [list={-1:0}] [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={-1:0}, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1039] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}] [L1043] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}] [L1049] COND TRUE !(end->next) [L1049] reach_error() VAL [end={-1:0}, list={-1:0}] - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 121 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 876 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 876 mSDsluCounter, 1474 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 848 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1369 IncrementalHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 626 mSDtfsCounter, 1369 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=4, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 149 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 could not prove your program: unable to determine feasibility of some traces [2021-12-22 00:12:48,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 00:12:50,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 00:12:50,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 00:12:50,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 00:12:50,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 00:12:50,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 00:12:50,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 00:12:50,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 00:12:50,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 00:12:50,803 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 00:12:50,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 00:12:50,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 00:12:50,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 00:12:50,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 00:12:50,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 00:12:50,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 00:12:50,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 00:12:50,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 00:12:50,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 00:12:50,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 00:12:50,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 00:12:50,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 00:12:50,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 00:12:50,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 00:12:50,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 00:12:50,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 00:12:50,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 00:12:50,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 00:12:50,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 00:12:50,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 00:12:50,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 00:12:50,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 00:12:50,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 00:12:50,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 00:12:50,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 00:12:50,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 00:12:50,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 00:12:50,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 00:12:50,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 00:12:50,836 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 00:12:50,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 00:12:50,838 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-22 00:12:50,858 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 00:12:50,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 00:12:50,859 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 00:12:50,860 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 00:12:50,860 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 00:12:50,860 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 00:12:50,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 00:12:50,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 00:12:50,862 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 00:12:50,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 00:12:50,862 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 00:12:50,863 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 00:12:50,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 00:12:50,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 00:12:50,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 00:12:50,863 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 00:12:50,864 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 00:12:50,864 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 00:12:50,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 00:12:50,864 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 00:12:50,864 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-22 00:12:50,864 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-22 00:12:50,865 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 00:12:50,865 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 00:12:50,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 00:12:50,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 00:12:50,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 00:12:50,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:12:50,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 00:12:50,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 00:12:50,866 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-22 00:12:50,867 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-22 00:12:50,867 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 00:12:50,867 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-22 00:12:50,867 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2021-12-22 00:12:51,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 00:12:51,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 00:12:51,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 00:12:51,118 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 00:12:51,118 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 00:12:51,120 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2021-12-22 00:12:51,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f790bf7c/52967e7beac14f138a3adf3960b28302/FLAG47d3ac416 [2021-12-22 00:12:51,600 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 00:12:51,600 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2021-12-22 00:12:51,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f790bf7c/52967e7beac14f138a3adf3960b28302/FLAG47d3ac416 [2021-12-22 00:12:51,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f790bf7c/52967e7beac14f138a3adf3960b28302 [2021-12-22 00:12:51,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 00:12:51,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 00:12:51,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 00:12:51,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 00:12:51,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 00:12:51,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:12:51" (1/1) ... [2021-12-22 00:12:51,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b28302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:51, skipping insertion in model container [2021-12-22 00:12:51,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:12:51" (1/1) ... [2021-12-22 00:12:51,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 00:12:51,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 00:12:51,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2021-12-22 00:12:51,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2021-12-22 00:12:51,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2021-12-22 00:12:51,969 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:12:51,976 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 00:12:51,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22480,22493] [2021-12-22 00:12:51,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22552,22565] [2021-12-22 00:12:51,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i[22720,22733] [2021-12-22 00:12:51,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:12:52,016 INFO L208 MainTranslator]: Completed translation [2021-12-22 00:12:52,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:52 WrapperNode [2021-12-22 00:12:52,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 00:12:52,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 00:12:52,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 00:12:52,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 00:12:52,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:52" (1/1) ... [2021-12-22 00:12:52,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:52" (1/1) ... [2021-12-22 00:12:52,050 INFO L137 Inliner]: procedures = 122, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 120 [2021-12-22 00:12:52,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 00:12:52,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 00:12:52,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 00:12:52,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 00:12:52,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:52" (1/1) ... [2021-12-22 00:12:52,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:52" (1/1) ... [2021-12-22 00:12:52,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:52" (1/1) ... [2021-12-22 00:12:52,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:52" (1/1) ... [2021-12-22 00:12:52,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:52" (1/1) ... [2021-12-22 00:12:52,068 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:52" (1/1) ... [2021-12-22 00:12:52,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:52" (1/1) ... [2021-12-22 00:12:52,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 00:12:52,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 00:12:52,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 00:12:52,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 00:12:52,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:52" (1/1) ... [2021-12-22 00:12:52,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:12:52,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:12:52,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 00:12:52,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 00:12:52,132 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-22 00:12:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 00:12:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 00:12:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 00:12:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 00:12:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 00:12:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-22 00:12:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-22 00:12:52,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 00:12:52,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 00:12:52,204 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 00:12:52,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 00:12:52,685 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 00:12:52,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 00:12:52,690 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-22 00:12:52,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:12:52 BoogieIcfgContainer [2021-12-22 00:12:52,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 00:12:52,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 00:12:52,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 00:12:52,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 00:12:52,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 12:12:51" (1/3) ... [2021-12-22 00:12:52,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eeff868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:12:52, skipping insertion in model container [2021-12-22 00:12:52,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:12:52" (2/3) ... [2021-12-22 00:12:52,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eeff868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:12:52, skipping insertion in model container [2021-12-22 00:12:52,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:12:52" (3/3) ... [2021-12-22 00:12:52,697 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2021-12-22 00:12:52,700 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 00:12:52,700 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2021-12-22 00:12:52,725 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 00:12:52,729 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 00:12:52,730 INFO L340 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2021-12-22 00:12:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 63 states have (on average 2.1587301587301586) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 00:12:52,745 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:52,745 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 00:12:52,746 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:52,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:52,749 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-22 00:12:52,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:12:52,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897944295] [2021-12-22 00:12:52,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:52,757 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:12:52,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:12:52,760 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:12:52,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-22 00:12:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:52,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 00:12:52,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:52,855 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:52,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:12:52,862 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:12:52,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897944295] [2021-12-22 00:12:52,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897944295] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:52,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:52,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:12:52,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027279030] [2021-12-22 00:12:52,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:52,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:52,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:12:52,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:52,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:52,886 INFO L87 Difference]: Start difference. First operand has 119 states, 63 states have (on average 2.1587301587301586) internal successors, (136), 118 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:53,038 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-12-22 00:12:53,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:53,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 00:12:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:53,045 INFO L225 Difference]: With dead ends: 121 [2021-12-22 00:12:53,045 INFO L226 Difference]: Without dead ends: 117 [2021-12-22 00:12:53,046 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:53,050 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:53,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 71 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:53,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-22 00:12:53,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2021-12-22 00:12:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 64 states have (on average 1.875) internal successors, (120), 112 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-22 00:12:53,091 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 3 [2021-12-22 00:12:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:53,091 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-22 00:12:53,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-22 00:12:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-22 00:12:53,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:53,092 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-22 00:12:53,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:53,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:12:53,300 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:53,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-22 00:12:53,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:12:53,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398665652] [2021-12-22 00:12:53,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:53,303 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:12:53,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:12:53,304 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:12:53,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-22 00:12:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:53,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 00:12:53,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:53,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:53,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:12:53,384 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:12:53,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398665652] [2021-12-22 00:12:53,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398665652] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:53,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:53,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 00:12:53,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743424365] [2021-12-22 00:12:53,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:53,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 00:12:53,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:12:53,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 00:12:53,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:53,387 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:53,543 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2021-12-22 00:12:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 00:12:53,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-22 00:12:53,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:53,545 INFO L225 Difference]: With dead ends: 131 [2021-12-22 00:12:53,545 INFO L226 Difference]: Without dead ends: 131 [2021-12-22 00:12:53,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 00:12:53,546 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 96 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:53,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 76 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:12:53,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-22 00:12:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2021-12-22 00:12:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.7605633802816902) internal successors, (125), 117 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2021-12-22 00:12:53,551 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 3 [2021-12-22 00:12:53,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:53,551 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2021-12-22 00:12:53,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2021-12-22 00:12:53,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-22 00:12:53,552 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:53,552 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:53,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:53,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:12:53,758 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:53,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:53,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2021-12-22 00:12:53,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:12:53,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886169964] [2021-12-22 00:12:53,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:53,760 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:12:53,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:12:53,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:12:53,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-22 00:12:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:53,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 00:12:53,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:53,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:53,853 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-22 00:12:53,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2021-12-22 00:12:53,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:53,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:12:53,862 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:12:53,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886169964] [2021-12-22 00:12:53,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886169964] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:53,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:53,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:12:53,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626469159] [2021-12-22 00:12:53,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:53,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:12:53,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:12:53,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:12:53,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:12:53,865 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:54,050 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-12-22 00:12:54,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:12:54,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-22 00:12:54,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:54,051 INFO L225 Difference]: With dead ends: 125 [2021-12-22 00:12:54,051 INFO L226 Difference]: Without dead ends: 125 [2021-12-22 00:12:54,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:54,052 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 158 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:54,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 59 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-22 00:12:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 110. [2021-12-22 00:12:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 74 states have (on average 1.6216216216216217) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:54,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2021-12-22 00:12:54,056 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 7 [2021-12-22 00:12:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:54,057 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2021-12-22 00:12:54,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:54,057 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2021-12-22 00:12:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-22 00:12:54,057 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:54,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:54,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:54,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:12:54,264 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:54,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:54,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2021-12-22 00:12:54,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:12:54,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171624937] [2021-12-22 00:12:54,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:54,265 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:12:54,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:12:54,268 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:12:54,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-22 00:12:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:54,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 00:12:54,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:54,341 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:54,445 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-22 00:12:54,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-22 00:12:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:54,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:12:54,461 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:12:54,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171624937] [2021-12-22 00:12:54,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171624937] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:54,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:54,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:12:54,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315287314] [2021-12-22 00:12:54,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:54,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:12:54,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:12:54,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:12:54,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:12:54,464 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:54,748 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2021-12-22 00:12:54,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:12:54,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-22 00:12:54,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:54,750 INFO L225 Difference]: With dead ends: 148 [2021-12-22 00:12:54,750 INFO L226 Difference]: Without dead ends: 148 [2021-12-22 00:12:54,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:54,750 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 147 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:54,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 85 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:12:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-22 00:12:54,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2021-12-22 00:12:54,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.5595238095238095) internal successors, (131), 118 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2021-12-22 00:12:54,755 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 7 [2021-12-22 00:12:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:54,756 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2021-12-22 00:12:54,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2021-12-22 00:12:54,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-22 00:12:54,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:54,756 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:54,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:54,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:12:54,960 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:54,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1837273936, now seen corresponding path program 1 times [2021-12-22 00:12:54,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:12:54,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651134636] [2021-12-22 00:12:54,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:54,963 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:12:54,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:12:54,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:12:54,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-22 00:12:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:55,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 00:12:55,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:55,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:55,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:12:55,034 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:12:55,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651134636] [2021-12-22 00:12:55,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651134636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:55,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:55,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:12:55,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554605955] [2021-12-22 00:12:55,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:55,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:12:55,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:12:55,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:12:55,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:12:55,036 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:55,223 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2021-12-22 00:12:55,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:12:55,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-22 00:12:55,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:55,224 INFO L225 Difference]: With dead ends: 133 [2021-12-22 00:12:55,224 INFO L226 Difference]: Without dead ends: 133 [2021-12-22 00:12:55,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:55,225 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 119 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:55,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 126 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:55,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-22 00:12:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2021-12-22 00:12:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.5301204819277108) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2021-12-22 00:12:55,231 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 9 [2021-12-22 00:12:55,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:55,232 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2021-12-22 00:12:55,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:55,232 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2021-12-22 00:12:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 00:12:55,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:55,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:55,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:55,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:12:55,439 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:55,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:55,440 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2021-12-22 00:12:55,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:12:55,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922055683] [2021-12-22 00:12:55,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:55,441 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:12:55,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:12:55,442 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:12:55,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-22 00:12:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:55,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 00:12:55,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:55,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:55,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:55,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-22 00:12:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:55,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:12:55,550 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:12:55,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922055683] [2021-12-22 00:12:55,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922055683] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:55,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:55,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:55,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353610171] [2021-12-22 00:12:55,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:55,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:55,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:12:55,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:55,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:55,552 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:55,870 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2021-12-22 00:12:55,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 00:12:55,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-22 00:12:55,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:55,871 INFO L225 Difference]: With dead ends: 118 [2021-12-22 00:12:55,871 INFO L226 Difference]: Without dead ends: 118 [2021-12-22 00:12:55,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:12:55,872 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 47 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:55,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 227 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:12:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-22 00:12:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2021-12-22 00:12:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 115 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2021-12-22 00:12:55,875 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 11 [2021-12-22 00:12:55,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:55,876 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2021-12-22 00:12:55,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:55,876 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2021-12-22 00:12:55,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 00:12:55,876 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:55,876 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:55,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-22 00:12:56,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:12:56,086 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:56,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2021-12-22 00:12:56,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:12:56,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895904881] [2021-12-22 00:12:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:56,087 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:12:56,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:12:56,088 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:12:56,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-22 00:12:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:56,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-22 00:12:56,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:56,159 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:12:56,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:56,183 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-22 00:12:56,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-22 00:12:56,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-22 00:12:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:56,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:12:56,253 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:12:56,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895904881] [2021-12-22 00:12:56,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1895904881] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:56,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:56,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:56,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995875179] [2021-12-22 00:12:56,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:56,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:12:56,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:12:56,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:12:56,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:12:56,255 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:56,614 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2021-12-22 00:12:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 00:12:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-22 00:12:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:56,615 INFO L225 Difference]: With dead ends: 117 [2021-12-22 00:12:56,616 INFO L226 Difference]: Without dead ends: 117 [2021-12-22 00:12:56,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:12:56,616 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 16 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:56,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 263 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:12:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-22 00:12:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2021-12-22 00:12:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2021-12-22 00:12:56,621 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 11 [2021-12-22 00:12:56,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:56,622 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2021-12-22 00:12:56,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:56,622 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2021-12-22 00:12:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 00:12:56,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:56,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:56,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:56,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:12:56,830 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:56,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash -831409633, now seen corresponding path program 1 times [2021-12-22 00:12:56,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:12:56,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486612511] [2021-12-22 00:12:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:56,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:12:56,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:12:56,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:12:56,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-22 00:12:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:56,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 00:12:56,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:56,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 00:12:56,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-22 00:12:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:56,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:12:56,960 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:12:56,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486612511] [2021-12-22 00:12:56,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486612511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:56,960 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:56,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:56,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040033607] [2021-12-22 00:12:56,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:56,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:12:56,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:12:56,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:12:56,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:56,962 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:57,218 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2021-12-22 00:12:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:12:57,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-22 00:12:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:57,220 INFO L225 Difference]: With dead ends: 173 [2021-12-22 00:12:57,220 INFO L226 Difference]: Without dead ends: 173 [2021-12-22 00:12:57,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:12:57,220 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 81 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:57,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 217 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:12:57,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-22 00:12:57,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 117. [2021-12-22 00:12:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 116 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2021-12-22 00:12:57,223 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 12 [2021-12-22 00:12:57,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:57,224 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2021-12-22 00:12:57,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2021-12-22 00:12:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-22 00:12:57,224 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:57,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:57,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:57,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:12:57,432 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:57,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:57,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1081092570, now seen corresponding path program 1 times [2021-12-22 00:12:57,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:12:57,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796269950] [2021-12-22 00:12:57,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:57,433 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:12:57,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:12:57,435 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:12:57,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-22 00:12:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:12:57,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 00:12:57,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:12:57,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-22 00:12:57,530 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-22 00:12:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:12:57,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:12:57,541 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:12:57,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796269950] [2021-12-22 00:12:57,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796269950] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:12:57,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:12:57,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:12:57,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596445962] [2021-12-22 00:12:57,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:12:57,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:12:57,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:12:57,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:12:57,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:12:57,543 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:12:57,856 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2021-12-22 00:12:57,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:12:57,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-22 00:12:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:12:57,858 INFO L225 Difference]: With dead ends: 171 [2021-12-22 00:12:57,858 INFO L226 Difference]: Without dead ends: 171 [2021-12-22 00:12:57,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:12:57,858 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 72 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:12:57,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 219 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:12:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-22 00:12:57,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 121. [2021-12-22 00:12:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 120 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:57,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2021-12-22 00:12:57,862 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 18 [2021-12-22 00:12:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:12:57,862 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2021-12-22 00:12:57,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 00:12:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2021-12-22 00:12:57,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-22 00:12:57,863 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:12:57,864 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:57,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-22 00:12:58,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:12:58,073 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2021-12-22 00:12:58,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:12:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1080781688, now seen corresponding path program 1 times [2021-12-22 00:12:58,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:12:58,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143341627] [2021-12-22 00:12:58,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:12:58,074 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:12:58,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:12:58,075 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:12:58,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-22 00:12:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 00:12:58,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 00:12:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 00:12:58,224 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-22 00:12:58,224 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 00:12:58,225 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2021-12-22 00:12:58,226 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (53 of 55 remaining) [2021-12-22 00:12:58,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (52 of 55 remaining) [2021-12-22 00:12:58,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (51 of 55 remaining) [2021-12-22 00:12:58,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (50 of 55 remaining) [2021-12-22 00:12:58,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (49 of 55 remaining) [2021-12-22 00:12:58,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (48 of 55 remaining) [2021-12-22 00:12:58,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (47 of 55 remaining) [2021-12-22 00:12:58,227 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (46 of 55 remaining) [2021-12-22 00:12:58,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (45 of 55 remaining) [2021-12-22 00:12:58,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (44 of 55 remaining) [2021-12-22 00:12:58,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (43 of 55 remaining) [2021-12-22 00:12:58,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (42 of 55 remaining) [2021-12-22 00:12:58,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (41 of 55 remaining) [2021-12-22 00:12:58,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (40 of 55 remaining) [2021-12-22 00:12:58,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (39 of 55 remaining) [2021-12-22 00:12:58,228 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (38 of 55 remaining) [2021-12-22 00:12:58,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (37 of 55 remaining) [2021-12-22 00:12:58,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (36 of 55 remaining) [2021-12-22 00:12:58,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (35 of 55 remaining) [2021-12-22 00:12:58,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (34 of 55 remaining) [2021-12-22 00:12:58,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (33 of 55 remaining) [2021-12-22 00:12:58,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (32 of 55 remaining) [2021-12-22 00:12:58,229 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (31 of 55 remaining) [2021-12-22 00:12:58,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (30 of 55 remaining) [2021-12-22 00:12:58,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (29 of 55 remaining) [2021-12-22 00:12:58,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (28 of 55 remaining) [2021-12-22 00:12:58,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (27 of 55 remaining) [2021-12-22 00:12:58,230 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (26 of 55 remaining) [2021-12-22 00:12:58,237 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (25 of 55 remaining) [2021-12-22 00:12:58,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (24 of 55 remaining) [2021-12-22 00:12:58,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (23 of 55 remaining) [2021-12-22 00:12:58,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (22 of 55 remaining) [2021-12-22 00:12:58,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (21 of 55 remaining) [2021-12-22 00:12:58,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (20 of 55 remaining) [2021-12-22 00:12:58,238 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (19 of 55 remaining) [2021-12-22 00:12:58,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (18 of 55 remaining) [2021-12-22 00:12:58,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (17 of 55 remaining) [2021-12-22 00:12:58,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (16 of 55 remaining) [2021-12-22 00:12:58,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (15 of 55 remaining) [2021-12-22 00:12:58,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (14 of 55 remaining) [2021-12-22 00:12:58,239 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (13 of 55 remaining) [2021-12-22 00:12:58,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (12 of 55 remaining) [2021-12-22 00:12:58,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (11 of 55 remaining) [2021-12-22 00:12:58,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (10 of 55 remaining) [2021-12-22 00:12:58,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (9 of 55 remaining) [2021-12-22 00:12:58,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (8 of 55 remaining) [2021-12-22 00:12:58,240 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (7 of 55 remaining) [2021-12-22 00:12:58,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (6 of 55 remaining) [2021-12-22 00:12:58,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (5 of 55 remaining) [2021-12-22 00:12:58,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (4 of 55 remaining) [2021-12-22 00:12:58,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (3 of 55 remaining) [2021-12-22 00:12:58,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (2 of 55 remaining) [2021-12-22 00:12:58,241 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (1 of 55 remaining) [2021-12-22 00:12:58,242 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK (0 of 55 remaining) [2021-12-22 00:12:58,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-22 00:12:58,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:12:58,445 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:12:58,447 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 00:12:58,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 12:12:58 BoogieIcfgContainer [2021-12-22 00:12:58,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 00:12:58,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 00:12:58,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 00:12:58,465 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 00:12:58,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:12:52" (3/4) ... [2021-12-22 00:12:58,468 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-22 00:12:58,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 00:12:58,468 INFO L158 Benchmark]: Toolchain (without parser) took 6839.78ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 52.3MB in the beginning and 58.5MB in the end (delta: -6.2MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2021-12-22 00:12:58,468 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 53.2MB in the beginning and 53.2MB in the end (delta: 38.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 00:12:58,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.44ms. Allocated memory is still 71.3MB. Free memory was 52.2MB in the beginning and 47.0MB in the end (delta: 5.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 00:12:58,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.23ms. Allocated memory is still 71.3MB. Free memory was 47.0MB in the beginning and 44.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 00:12:58,469 INFO L158 Benchmark]: Boogie Preprocessor took 19.50ms. Allocated memory is still 71.3MB. Free memory was 44.8MB in the beginning and 43.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 00:12:58,469 INFO L158 Benchmark]: RCFGBuilder took 620.63ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 42.8MB in the beginning and 74.2MB in the end (delta: -31.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-22 00:12:58,469 INFO L158 Benchmark]: TraceAbstraction took 5771.79ms. Allocated memory is still 100.7MB. Free memory was 73.9MB in the beginning and 58.5MB in the end (delta: 15.4MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2021-12-22 00:12:58,470 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 100.7MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 00:12:58,471 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.15ms. Allocated memory is still 71.3MB. Free memory was 53.2MB in the beginning and 53.2MB in the end (delta: 38.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.44ms. Allocated memory is still 71.3MB. Free memory was 52.2MB in the beginning and 47.0MB in the end (delta: 5.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.23ms. Allocated memory is still 71.3MB. Free memory was 47.0MB in the beginning and 44.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.50ms. Allocated memory is still 71.3MB. Free memory was 44.8MB in the beginning and 43.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 620.63ms. Allocated memory was 71.3MB in the beginning and 100.7MB in the end (delta: 29.4MB). Free memory was 42.8MB in the beginning and 74.2MB in the end (delta: -31.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5771.79ms. Allocated memory is still 100.7MB. Free memory was 73.9MB in the beginning and 58.5MB in the end (delta: 15.4MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 100.7MB. Free memory is still 58.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1049. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) VAL [list={6:0}] [L1008] list->colour = BLACK VAL [list={6:0}] [L1010] SLL* end = list; VAL [end={6:0}, list={6:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={6:0}, list={6:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}] [L1039] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={6:0}, list={6:0}] [L1043] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next VAL [end={6:0}, end->next={0:0}, list={6:0}] [L1049] COND TRUE !(end->next) [L1049] reach_error() VAL [end={6:0}, list={6:0}] - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 55 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 837 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 837 mSDsluCounter, 1343 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 751 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 592 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=9, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 191 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 378 SizeOfPredicates, 26 NumberOfNonLiveVariables, 526 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 could not prove your program: unable to determine feasibility of some traces [2021-12-22 00:12:58,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample