./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 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/ldv-memsafety/memleaks_test22_3-1.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 cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:56:13,190 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:56:13,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:56:13,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:56:13,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:56:13,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:56:13,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:56:13,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:56:13,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:56:13,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:56:13,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:56:13,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:56:13,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:56:13,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:56:13,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:56:13,250 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:56:13,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:56:13,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:56:13,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:56:13,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:56:13,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:56:13,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:56:13,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:56:13,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:56:13,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:56:13,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:56:13,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:56:13,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:56:13,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:56:13,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:56:13,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:56:13,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:56:13,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:56:13,279 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:56:13,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:56:13,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:56:13,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:56:13,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:56:13,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:56:13,282 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:56:13,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:56:13,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-28 05:56:13,313 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:56:13,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:56:13,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:56:13,315 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:56:13,316 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:56:13,316 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:56:13,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:56:13,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:56:13,317 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:56:13,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:56:13,318 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:56:13,318 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:56:13,319 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:56:13,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:56:13,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:56:13,319 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:56:13,319 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:56:13,319 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 05:56:13,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:56:13,320 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:56:13,320 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:56:13,320 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:56:13,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:56:13,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:56:13,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:56:13,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:56:13,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:56:13,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:56:13,321 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:56:13,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:56:13,322 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 -> cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 [2021-12-28 05:56:13,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:56:13,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:56:13,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:56:13,675 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:56:13,675 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:56:13,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2021-12-28 05:56:13,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362262c16/bb37074935ab47a7a8ce89f9da2503b6/FLAGb5a8481da [2021-12-28 05:56:14,262 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:56:14,263 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2021-12-28 05:56:14,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362262c16/bb37074935ab47a7a8ce89f9da2503b6/FLAGb5a8481da [2021-12-28 05:56:14,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/362262c16/bb37074935ab47a7a8ce89f9da2503b6 [2021-12-28 05:56:14,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:56:14,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:56:14,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:56:14,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:56:14,587 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:56:14,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:56:14" (1/1) ... [2021-12-28 05:56:14,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b9f232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:14, skipping insertion in model container [2021-12-28 05:56:14,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:56:14" (1/1) ... [2021-12-28 05:56:14,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:56:14,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:56:14,987 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:56:15,009 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-28 05:56:15,011 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@70d29527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:15, skipping insertion in model container [2021-12-28 05:56:15,011 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:56:15,012 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-28 05:56:15,013 INFO L158 Benchmark]: Toolchain (without parser) took 437.25ms. Allocated memory is still 65.0MB. Free memory was 44.1MB in the beginning and 45.3MB in the end (delta: -1.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 05:56:15,014 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory was 47.5MB in the beginning and 47.5MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 05:56:15,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.47ms. Allocated memory is still 65.0MB. Free memory was 43.8MB in the beginning and 45.3MB in the end (delta: -1.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 05:56:15,017 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.17ms. Allocated memory is still 65.0MB. Free memory was 47.5MB in the beginning and 47.5MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.47ms. Allocated memory is still 65.0MB. Free memory was 43.8MB in the beginning and 45.3MB in the end (delta: -1.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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/ldv-memsafety/memleaks_test22_3-1.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 cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:56:16,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:56:16,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:56:16,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:56:16,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:56:16,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:56:16,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:56:16,729 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:56:16,732 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:56:16,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:56:16,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:56:16,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:56:16,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:56:16,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:56:16,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:56:16,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:56:16,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:56:16,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:56:16,751 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:56:16,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:56:16,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:56:16,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:56:16,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:56:16,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:56:16,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:56:16,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:56:16,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:56:16,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:56:16,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:56:16,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:56:16,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:56:16,771 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:56:16,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:56:16,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:56:16,774 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:56:16,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:56:16,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:56:16,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:56:16,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:56:16,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:56:16,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:56:16,778 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-28 05:56:16,812 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:56:16,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:56:16,814 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:56:16,814 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:56:16,815 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:56:16,815 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:56:16,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:56:16,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:56:16,816 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:56:16,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:56:16,817 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:56:16,818 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:56:16,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:56:16,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:56:16,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:56:16,818 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:56:16,819 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:56:16,819 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 05:56:16,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:56:16,819 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:56:16,819 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-28 05:56:16,820 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-28 05:56:16,820 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:56:16,820 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:56:16,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:56:16,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:56:16,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:56:16,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:56:16,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:56:16,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:56:16,821 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-28 05:56:16,821 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-28 05:56:16,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-28 05:56:16,822 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 -> cac2372de612a50e6cea0e2672ab51101a6ffa3bb2603a06b5c5aa59090db116 [2021-12-28 05:56:17,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:56:17,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:56:17,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:56:17,168 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:56:17,169 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:56:17,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2021-12-28 05:56:17,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39052febd/444015d6e8d1451ab61c2ecf905534da/FLAG2edd11114 [2021-12-28 05:56:17,761 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:56:17,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2021-12-28 05:56:17,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39052febd/444015d6e8d1451ab61c2ecf905534da/FLAG2edd11114 [2021-12-28 05:56:18,234 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39052febd/444015d6e8d1451ab61c2ecf905534da [2021-12-28 05:56:18,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:56:18,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:56:18,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:56:18,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:56:18,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:56:18,250 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:56:18" (1/1) ... [2021-12-28 05:56:18,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ecd735a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18, skipping insertion in model container [2021-12-28 05:56:18,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:56:18" (1/1) ... [2021-12-28 05:56:18,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:56:18,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:56:18,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:56:18,714 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-28 05:56:18,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:56:18,780 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:56:18,792 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:56:18,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:56:18,889 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:56:18,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18 WrapperNode [2021-12-28 05:56:18,890 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:56:18,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:56:18,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:56:18,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:56:18,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18" (1/1) ... [2021-12-28 05:56:18,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18" (1/1) ... [2021-12-28 05:56:18,964 INFO L137 Inliner]: procedures = 167, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 124 [2021-12-28 05:56:18,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:56:18,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:56:18,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:56:18,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:56:18,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18" (1/1) ... [2021-12-28 05:56:18,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18" (1/1) ... [2021-12-28 05:56:18,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18" (1/1) ... [2021-12-28 05:56:18,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18" (1/1) ... [2021-12-28 05:56:18,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18" (1/1) ... [2021-12-28 05:56:19,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18" (1/1) ... [2021-12-28 05:56:19,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18" (1/1) ... [2021-12-28 05:56:19,017 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:56:19,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:56:19,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:56:19,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:56:19,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18" (1/1) ... [2021-12-28 05:56:19,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:56:19,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:56:19,047 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-28 05:56:19,051 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-28 05:56:19,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-28 05:56:19,078 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2021-12-28 05:56:19,078 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2021-12-28 05:56:19,078 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-28 05:56:19,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-28 05:56:19,079 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2021-12-28 05:56:19,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2021-12-28 05:56:19,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:56:19,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:56:19,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:56:19,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:56:19,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-28 05:56:19,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:56:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 05:56:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:56:19,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:56:19,243 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:56:19,244 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:56:19,598 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:56:19,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:56:19,605 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 05:56:19,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:56:19 BoogieIcfgContainer [2021-12-28 05:56:19,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:56:19,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:56:19,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:56:19,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:56:19,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:56:18" (1/3) ... [2021-12-28 05:56:19,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5700eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:56:19, skipping insertion in model container [2021-12-28 05:56:19,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:56:18" (2/3) ... [2021-12-28 05:56:19,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5700eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:56:19, skipping insertion in model container [2021-12-28 05:56:19,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:56:19" (3/3) ... [2021-12-28 05:56:19,612 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2021-12-28 05:56:19,615 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:56:19,615 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-12-28 05:56:19,649 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:56:19,653 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-28 05:56:19,654 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-12-28 05:56:19,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 59 states have (on average 1.576271186440678) internal successors, (93), 85 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-28 05:56:19,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:19,670 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:19,671 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash 886333963, now seen corresponding path program 1 times [2021-12-28 05:56:19,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:19,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1506580] [2021-12-28 05:56:19,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:19,692 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:19,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:19,697 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-28 05:56:19,698 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-28 05:56:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:19,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 05:56:19,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:19,858 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-28 05:56:19,907 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-28 05:56:19,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:19,908 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:19,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1506580] [2021-12-28 05:56:19,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1506580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:19,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:19,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:56:19,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517667671] [2021-12-28 05:56:19,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:19,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:56:19,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:19,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:56:19,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:56:19,943 INFO L87 Difference]: Start difference. First operand has 92 states, 59 states have (on average 1.576271186440678) internal successors, (93), 85 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:20,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:20,310 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2021-12-28 05:56:20,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:56:20,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-12-28 05:56:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:20,326 INFO L225 Difference]: With dead ends: 158 [2021-12-28 05:56:20,326 INFO L226 Difference]: Without dead ends: 156 [2021-12-28 05:56:20,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:56:20,336 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 97 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:20,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 387 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:56:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-28 05:56:20,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 95. [2021-12-28 05:56:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 87 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-28 05:56:20,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2021-12-28 05:56:20,370 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 10 [2021-12-28 05:56:20,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:20,371 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2021-12-28 05:56:20,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:20,371 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2021-12-28 05:56:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-28 05:56:20,372 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:20,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:20,379 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-28 05:56:20,575 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-28 05:56:20,575 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:20,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:20,576 INFO L85 PathProgramCache]: Analyzing trace with hash 914963114, now seen corresponding path program 1 times [2021-12-28 05:56:20,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:20,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633665139] [2021-12-28 05:56:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:20,577 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:20,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:20,578 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-28 05:56:20,579 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-28 05:56:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:20,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 05:56:20,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:20,688 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-28 05:56:20,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:20,688 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:20,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633665139] [2021-12-28 05:56:20,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633665139] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:20,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:20,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:56:20,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405744589] [2021-12-28 05:56:20,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:20,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:56:20,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:20,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:56:20,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:56:20,692 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:20,720 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2021-12-28 05:56:20,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:56:20,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-12-28 05:56:20,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:20,726 INFO L225 Difference]: With dead ends: 114 [2021-12-28 05:56:20,727 INFO L226 Difference]: Without dead ends: 114 [2021-12-28 05:56:20,728 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:56:20,729 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 19 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:20,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 394 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:56:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-28 05:56:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2021-12-28 05:56:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.5245901639344261) internal successors, (93), 85 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-28 05:56:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2021-12-28 05:56:20,739 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 10 [2021-12-28 05:56:20,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:20,739 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2021-12-28 05:56:20,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:20,740 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2021-12-28 05:56:20,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:56:20,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:20,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:20,751 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-28 05:56:20,949 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-28 05:56:20,949 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:20,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:20,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1706549126, now seen corresponding path program 1 times [2021-12-28 05:56:20,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:20,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388212578] [2021-12-28 05:56:20,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:20,951 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:20,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:20,952 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-28 05:56:20,954 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-28 05:56:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:21,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-28 05:56:21,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:21,036 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-28 05:56:21,137 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-28 05:56:21,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:21,138 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:21,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388212578] [2021-12-28 05:56:21,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388212578] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:21,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:21,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:56:21,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099123021] [2021-12-28 05:56:21,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:21,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:56:21,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:21,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:56:21,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:56:21,140 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:21,502 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2021-12-28 05:56:21,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:56:21,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-12-28 05:56:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:21,504 INFO L225 Difference]: With dead ends: 134 [2021-12-28 05:56:21,504 INFO L226 Difference]: Without dead ends: 134 [2021-12-28 05:56:21,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:56:21,505 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 73 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:21,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 469 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:56:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-28 05:56:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 92. [2021-12-28 05:56:21,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 84 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-28 05:56:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2021-12-28 05:56:21,513 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 11 [2021-12-28 05:56:21,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:21,513 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2021-12-28 05:56:21,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2021-12-28 05:56:21,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 05:56:21,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:21,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:21,525 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-28 05:56:21,722 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-28 05:56:21,723 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:21,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1363388625, now seen corresponding path program 1 times [2021-12-28 05:56:21,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:21,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779055884] [2021-12-28 05:56:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:21,724 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:21,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:21,726 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-28 05:56:21,728 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-28 05:56:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:21,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 05:56:21,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:21,816 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-28 05:56:21,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:21,816 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:21,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779055884] [2021-12-28 05:56:21,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779055884] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:21,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:21,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:56:21,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27690632] [2021-12-28 05:56:21,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:21,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:56:21,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:21,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:56:21,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:56:21,818 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:21,835 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2021-12-28 05:56:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:56:21,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-12-28 05:56:21,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:21,838 INFO L225 Difference]: With dead ends: 113 [2021-12-28 05:56:21,838 INFO L226 Difference]: Without dead ends: 113 [2021-12-28 05:56:21,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:56:21,839 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 35 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:21,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 424 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:56:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-28 05:56:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2021-12-28 05:56:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 84 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-28 05:56:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2021-12-28 05:56:21,845 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 12 [2021-12-28 05:56:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:21,845 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2021-12-28 05:56:21,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:21,846 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2021-12-28 05:56:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 05:56:21,846 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:21,846 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:21,857 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-28 05:56:22,054 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-28 05:56:22,055 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:22,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1188768336, now seen corresponding path program 1 times [2021-12-28 05:56:22,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:22,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401006944] [2021-12-28 05:56:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:22,056 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:22,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:22,057 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-28 05:56:22,059 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-28 05:56:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:22,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-28 05:56:22,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:22,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:56:22,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:22,161 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:22,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401006944] [2021-12-28 05:56:22,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401006944] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:22,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:22,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:56:22,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908023325] [2021-12-28 05:56:22,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:22,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:56:22,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:22,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:56:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:56:22,163 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:22,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:22,192 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2021-12-28 05:56:22,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:56:22,192 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-12-28 05:56:22,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:22,193 INFO L225 Difference]: With dead ends: 112 [2021-12-28 05:56:22,193 INFO L226 Difference]: Without dead ends: 112 [2021-12-28 05:56:22,193 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-28 05:56:22,194 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 21 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:22,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 288 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:56:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-28 05:56:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2021-12-28 05:56:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 86 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-28 05:56:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2021-12-28 05:56:22,200 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 12 [2021-12-28 05:56:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:22,200 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2021-12-28 05:56:22,200 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2021-12-28 05:56:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:56:22,201 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:22,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:22,208 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-28 05:56:22,407 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-28 05:56:22,408 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:22,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:22,408 INFO L85 PathProgramCache]: Analyzing trace with hash 86428473, now seen corresponding path program 1 times [2021-12-28 05:56:22,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:22,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741268344] [2021-12-28 05:56:22,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:22,409 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:22,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:22,410 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-28 05:56:22,411 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-28 05:56:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:22,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:56:22,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:22,523 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-28 05:56:22,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:22,524 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:22,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741268344] [2021-12-28 05:56:22,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741268344] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:22,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:22,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:56:22,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108843969] [2021-12-28 05:56:22,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:22,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:56:22,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:22,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:56:22,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:56:22,526 INFO L87 Difference]: Start difference. First operand 94 states and 102 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:22,550 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2021-12-28 05:56:22,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:56:22,551 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-12-28 05:56:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:22,552 INFO L225 Difference]: With dead ends: 104 [2021-12-28 05:56:22,552 INFO L226 Difference]: Without dead ends: 104 [2021-12-28 05:56:22,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:56:22,554 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 33 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:22,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 208 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:56:22,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-28 05:56:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2021-12-28 05:56:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.46875) internal successors, (94), 87 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-28 05:56:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2021-12-28 05:56:22,590 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 16 [2021-12-28 05:56:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:22,590 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2021-12-28 05:56:22,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2021-12-28 05:56:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 05:56:22,592 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:22,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:22,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:22,800 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-28 05:56:22,800 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:22,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:22,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1674943760, now seen corresponding path program 1 times [2021-12-28 05:56:22,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:22,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736514982] [2021-12-28 05:56:22,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:22,802 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:22,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:22,803 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-28 05:56:22,804 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-28 05:56:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:22,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 05:56:22,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:56:22,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:56:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:56:23,007 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:23,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736514982] [2021-12-28 05:56:23,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736514982] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:56:23,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:56:23,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-28 05:56:23,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760154915] [2021-12-28 05:56:23,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:56:23,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:56:23,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:23,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:56:23,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:56:23,009 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:23,075 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2021-12-28 05:56:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:56:23,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-28 05:56:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:23,076 INFO L225 Difference]: With dead ends: 107 [2021-12-28 05:56:23,076 INFO L226 Difference]: Without dead ends: 107 [2021-12-28 05:56:23,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:56:23,077 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 66 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:23,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 381 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:56:23,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-28 05:56:23,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2021-12-28 05:56:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 90 states have internal predecessors, (97), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-12-28 05:56:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-12-28 05:56:23,081 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 17 [2021-12-28 05:56:23,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:23,081 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-12-28 05:56:23,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-12-28 05:56:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-28 05:56:23,082 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:23,082 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-28 05:56:23,091 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-28 05:56:23,291 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-28 05:56:23,292 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1276371002, now seen corresponding path program 1 times [2021-12-28 05:56:23,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:23,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154515648] [2021-12-28 05:56:23,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:23,293 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:23,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:23,293 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-28 05:56:23,294 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-28 05:56:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:23,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-28 05:56:23,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:23,488 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-28 05:56:23,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:23,488 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:23,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154515648] [2021-12-28 05:56:23,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154515648] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:23,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:23,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:56:23,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172145929] [2021-12-28 05:56:23,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:23,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:56:23,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:23,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:56:23,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:56:23,490 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:23,565 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-12-28 05:56:23,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:56:23,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-12-28 05:56:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:23,566 INFO L225 Difference]: With dead ends: 113 [2021-12-28 05:56:23,566 INFO L226 Difference]: Without dead ends: 113 [2021-12-28 05:56:23,566 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:56:23,567 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 21 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:23,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 553 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:56:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-28 05:56:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2021-12-28 05:56:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 98 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2021-12-28 05:56:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2021-12-28 05:56:23,571 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 18 [2021-12-28 05:56:23,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:23,571 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2021-12-28 05:56:23,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2021-12-28 05:56:23,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-28 05:56:23,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:23,572 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:23,587 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-28 05:56:23,781 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-28 05:56:23,782 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:23,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:23,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1965719801, now seen corresponding path program 2 times [2021-12-28 05:56:23,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:23,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176528758] [2021-12-28 05:56:23,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 05:56:23,783 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:23,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:23,783 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-28 05:56:23,784 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-28 05:56:23,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 05:56:23,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 05:56:23,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 05:56:23,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:23,879 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-28 05:56:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 05:56:23,957 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:23,957 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:23,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176528758] [2021-12-28 05:56:23,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176528758] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:23,957 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:23,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:56:23,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945220791] [2021-12-28 05:56:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:23,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:56:23,958 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:23,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:56:23,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:56:23,959 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:24,287 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2021-12-28 05:56:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:56:24,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-12-28 05:56:24,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:24,288 INFO L225 Difference]: With dead ends: 142 [2021-12-28 05:56:24,289 INFO L226 Difference]: Without dead ends: 142 [2021-12-28 05:56:24,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-28 05:56:24,289 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 95 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:24,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 537 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:56:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-28 05:56:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 107. [2021-12-28 05:56:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 97 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2021-12-28 05:56:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2021-12-28 05:56:24,294 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 20 [2021-12-28 05:56:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:24,294 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2021-12-28 05:56:24,294 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2021-12-28 05:56:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-28 05:56:24,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:24,295 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:24,305 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-28 05:56:24,499 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-28 05:56:24,499 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:24,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:24,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1965719802, now seen corresponding path program 1 times [2021-12-28 05:56:24,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:24,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593446504] [2021-12-28 05:56:24,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:24,500 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:24,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:24,501 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-28 05:56:24,502 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-28 05:56:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:24,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 05:56:24,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:56:24,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:56:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:56:24,831 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:24,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593446504] [2021-12-28 05:56:24,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593446504] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:56:24,831 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:56:24,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-28 05:56:24,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143657719] [2021-12-28 05:56:24,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:56:24,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 05:56:24,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:24,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 05:56:24,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:56:24,832 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:25,061 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2021-12-28 05:56:25,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:56:25,062 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-12-28 05:56:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:25,063 INFO L225 Difference]: With dead ends: 116 [2021-12-28 05:56:25,063 INFO L226 Difference]: Without dead ends: 116 [2021-12-28 05:56:25,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2021-12-28 05:56:25,064 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 64 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:25,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 782 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:56:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-28 05:56:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2021-12-28 05:56:25,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.3625) internal successors, (109), 103 states have internal predecessors, (109), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2021-12-28 05:56:25,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2021-12-28 05:56:25,068 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 20 [2021-12-28 05:56:25,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:25,068 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2021-12-28 05:56:25,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2021-12-28 05:56:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 05:56:25,069 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:25,069 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:25,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:25,269 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-28 05:56:25,269 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:25,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1184735654, now seen corresponding path program 1 times [2021-12-28 05:56:25,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:25,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959642978] [2021-12-28 05:56:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:25,271 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:25,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:25,272 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:25,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-28 05:56:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:25,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 05:56:25,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 05:56:25,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:25,396 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:25,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959642978] [2021-12-28 05:56:25,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959642978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:25,396 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:25,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:56:25,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340457978] [2021-12-28 05:56:25,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:25,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:56:25,397 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:25,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:56:25,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:56:25,398 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-28 05:56:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:25,492 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2021-12-28 05:56:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:56:25,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2021-12-28 05:56:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:25,495 INFO L225 Difference]: With dead ends: 119 [2021-12-28 05:56:25,495 INFO L226 Difference]: Without dead ends: 101 [2021-12-28 05:56:25,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:56:25,496 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 31 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:25,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 188 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:56:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-28 05:56:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2021-12-28 05:56:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.411764705882353) internal successors, (96), 90 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2021-12-28 05:56:25,499 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 27 [2021-12-28 05:56:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:25,499 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2021-12-28 05:56:25,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2021-12-28 05:56:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2021-12-28 05:56:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:56:25,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:25,500 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:25,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-28 05:56:25,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:25,709 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:25,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:25,709 INFO L85 PathProgramCache]: Analyzing trace with hash -103060070, now seen corresponding path program 2 times [2021-12-28 05:56:25,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:25,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200450650] [2021-12-28 05:56:25,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 05:56:25,710 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:25,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:25,711 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:25,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-28 05:56:25,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 05:56:25,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 05:56:25,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-28 05:56:25,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:25,804 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-28 05:56:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-28 05:56:25,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:25,991 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:25,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200450650] [2021-12-28 05:56:25,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200450650] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:25,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:25,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:56:25,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982743991] [2021-12-28 05:56:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:25,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:56:25,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:25,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:56:25,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:56:25,993 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:26,408 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2021-12-28 05:56:26,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:56:26,411 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2021-12-28 05:56:26,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:26,412 INFO L225 Difference]: With dead ends: 141 [2021-12-28 05:56:26,412 INFO L226 Difference]: Without dead ends: 141 [2021-12-28 05:56:26,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:56:26,413 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 105 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:26,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 621 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:56:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-28 05:56:26,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2021-12-28 05:56:26,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 89 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2021-12-28 05:56:26,417 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2021-12-28 05:56:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:26,417 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2021-12-28 05:56:26,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:26,418 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2021-12-28 05:56:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 05:56:26,418 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:26,419 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:26,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:26,627 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:26,627 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:26,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:26,627 INFO L85 PathProgramCache]: Analyzing trace with hash -257987495, now seen corresponding path program 1 times [2021-12-28 05:56:26,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:26,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167546040] [2021-12-28 05:56:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:26,628 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:26,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:26,629 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:26,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-28 05:56:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:26,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-28 05:56:26,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:56:26,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:56:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:56:27,402 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:27,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167546040] [2021-12-28 05:56:27,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167546040] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:56:27,402 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:56:27,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-28 05:56:27,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767805446] [2021-12-28 05:56:27,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:56:27,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-28 05:56:27,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:27,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-28 05:56:27,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2021-12-28 05:56:27,404 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:27,783 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2021-12-28 05:56:27,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 05:56:27,784 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2021-12-28 05:56:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:27,785 INFO L225 Difference]: With dead ends: 102 [2021-12-28 05:56:27,785 INFO L226 Difference]: Without dead ends: 102 [2021-12-28 05:56:27,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2021-12-28 05:56:27,790 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 31 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:27,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 1236 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:56:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-28 05:56:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-28 05:56:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.364864864864865) internal successors, (101), 95 states have internal predecessors, (101), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2021-12-28 05:56:27,793 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 28 [2021-12-28 05:56:27,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:27,793 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2021-12-28 05:56:27,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:27,793 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2021-12-28 05:56:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-28 05:56:27,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:27,796 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:27,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:28,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:28,010 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:28,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2039891719, now seen corresponding path program 2 times [2021-12-28 05:56:28,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:28,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144369713] [2021-12-28 05:56:28,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 05:56:28,011 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:28,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:28,012 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:28,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-28 05:56:28,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-28 05:56:28,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 05:56:28,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 05:56:28,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:28,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:28,166 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:28,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144369713] [2021-12-28 05:56:28,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144369713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:28,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:28,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:56:28,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074024682] [2021-12-28 05:56:28,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:28,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:56:28,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:28,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:56:28,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:56:28,168 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:28,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:28,199 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2021-12-28 05:56:28,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:56:28,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2021-12-28 05:56:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:28,201 INFO L225 Difference]: With dead ends: 102 [2021-12-28 05:56:28,202 INFO L226 Difference]: Without dead ends: 102 [2021-12-28 05:56:28,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:56:28,202 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 53 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:28,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 372 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:56:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-28 05:56:28,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-28 05:56:28,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 95 states have internal predecessors, (100), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2021-12-28 05:56:28,206 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 34 [2021-12-28 05:56:28,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:28,207 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2021-12-28 05:56:28,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2021-12-28 05:56:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-28 05:56:28,207 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:28,207 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:28,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:28,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:28,415 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:28,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:28,416 INFO L85 PathProgramCache]: Analyzing trace with hash -382086172, now seen corresponding path program 1 times [2021-12-28 05:56:28,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:28,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403665783] [2021-12-28 05:56:28,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:28,417 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:28,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:28,418 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:28,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-28 05:56:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:28,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 05:56:28,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:28,588 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-28 05:56:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:28,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:28,703 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:28,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403665783] [2021-12-28 05:56:28,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403665783] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:28,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:28,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:56:28,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165668158] [2021-12-28 05:56:28,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:28,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:56:28,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:28,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:56:28,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:56:28,704 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:28,938 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2021-12-28 05:56:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:56:28,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-12-28 05:56:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:28,939 INFO L225 Difference]: With dead ends: 100 [2021-12-28 05:56:28,939 INFO L226 Difference]: Without dead ends: 100 [2021-12-28 05:56:28,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:56:28,940 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 77 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:28,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 391 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:56:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-28 05:56:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-12-28 05:56:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 93 states have internal predecessors, (98), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2021-12-28 05:56:28,942 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 36 [2021-12-28 05:56:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:28,943 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2021-12-28 05:56:28,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:28,943 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2021-12-28 05:56:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-28 05:56:28,944 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:28,944 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:28,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:29,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:29,155 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:29,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:29,155 INFO L85 PathProgramCache]: Analyzing trace with hash -382086171, now seen corresponding path program 1 times [2021-12-28 05:56:29,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:29,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446692421] [2021-12-28 05:56:29,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:29,156 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:29,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:29,157 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:29,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-28 05:56:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:29,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-28 05:56:29,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:29,326 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-28 05:56:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:29,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:29,575 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:29,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446692421] [2021-12-28 05:56:29,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446692421] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:29,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:29,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 05:56:29,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204642900] [2021-12-28 05:56:29,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:29,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 05:56:29,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:29,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 05:56:29,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:56:29,576 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:29,857 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-12-28 05:56:29,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:56:29,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-12-28 05:56:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:29,858 INFO L225 Difference]: With dead ends: 98 [2021-12-28 05:56:29,858 INFO L226 Difference]: Without dead ends: 98 [2021-12-28 05:56:29,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:56:29,859 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 84 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:29,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 473 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:56:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-28 05:56:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-12-28 05:56:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 91 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2021-12-28 05:56:29,862 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 36 [2021-12-28 05:56:29,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:29,862 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2021-12-28 05:56:29,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:29,862 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2021-12-28 05:56:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-28 05:56:29,862 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:29,862 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:29,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-28 05:56:30,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:30,071 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:30,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:30,072 INFO L85 PathProgramCache]: Analyzing trace with hash -432796251, now seen corresponding path program 1 times [2021-12-28 05:56:30,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:30,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151409434] [2021-12-28 05:56:30,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:30,072 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:30,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:30,073 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:30,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-28 05:56:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:30,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 05:56:30,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:30,303 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:30,303 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:30,303 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:30,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151409434] [2021-12-28 05:56:30,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151409434] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:30,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:30,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:56:30,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318308685] [2021-12-28 05:56:30,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:30,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:56:30,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:30,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:56:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:56:30,306 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:30,348 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2021-12-28 05:56:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:56:30,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2021-12-28 05:56:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:30,349 INFO L225 Difference]: With dead ends: 98 [2021-12-28 05:56:30,349 INFO L226 Difference]: Without dead ends: 98 [2021-12-28 05:56:30,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:56:30,350 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 75 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:30,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 402 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:56:30,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-28 05:56:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-12-28 05:56:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 90 states have internal predecessors, (95), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2021-12-28 05:56:30,355 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 36 [2021-12-28 05:56:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:30,355 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2021-12-28 05:56:30,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 05:56:30,356 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2021-12-28 05:56:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 05:56:30,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:30,356 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:30,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:30,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:30,568 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:30,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:30,568 INFO L85 PathProgramCache]: Analyzing trace with hash 74876930, now seen corresponding path program 1 times [2021-12-28 05:56:30,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:30,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399584613] [2021-12-28 05:56:30,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:30,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:30,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:30,608 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:30,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-28 05:56:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:30,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-28 05:56:30,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:30,825 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-28 05:56:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:30,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:30,973 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:30,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399584613] [2021-12-28 05:56:30,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399584613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:30,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:30,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:56:30,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829126267] [2021-12-28 05:56:30,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:30,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:56:30,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:30,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:56:30,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:56:30,978 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:31,199 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2021-12-28 05:56:31,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:56:31,199 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2021-12-28 05:56:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:31,200 INFO L225 Difference]: With dead ends: 100 [2021-12-28 05:56:31,200 INFO L226 Difference]: Without dead ends: 100 [2021-12-28 05:56:31,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:56:31,201 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 65 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:31,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 347 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 20 Unchecked, 0.2s Time] [2021-12-28 05:56:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-28 05:56:31,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2021-12-28 05:56:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 88 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2021-12-28 05:56:31,208 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 44 [2021-12-28 05:56:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:31,208 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2021-12-28 05:56:31,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2021-12-28 05:56:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 05:56:31,210 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:31,210 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:31,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:31,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:31,423 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash 74876931, now seen corresponding path program 1 times [2021-12-28 05:56:31,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:31,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326717304] [2021-12-28 05:56:31,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:31,424 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:31,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:31,425 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:31,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-28 05:56:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:31,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-28 05:56:31,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:31,653 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-28 05:56:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:31,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:31,920 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:31,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326717304] [2021-12-28 05:56:31,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326717304] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:31,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:31,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 05:56:31,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129210010] [2021-12-28 05:56:31,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:31,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 05:56:31,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:31,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 05:56:31,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:56:31,921 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:32,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:32,214 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2021-12-28 05:56:32,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:56:32,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2021-12-28 05:56:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:32,216 INFO L225 Difference]: With dead ends: 103 [2021-12-28 05:56:32,216 INFO L226 Difference]: Without dead ends: 103 [2021-12-28 05:56:32,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:56:32,216 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 70 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:32,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 473 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 173 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2021-12-28 05:56:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-28 05:56:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2021-12-28 05:56:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 86 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2021-12-28 05:56:32,219 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 44 [2021-12-28 05:56:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:32,220 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2021-12-28 05:56:32,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2021-12-28 05:56:32,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-28 05:56:32,220 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:32,220 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:32,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:32,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:32,421 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:32,421 INFO L85 PathProgramCache]: Analyzing trace with hash 496438540, now seen corresponding path program 1 times [2021-12-28 05:56:32,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:32,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715671146] [2021-12-28 05:56:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:32,422 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:32,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:32,423 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:32,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-28 05:56:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:32,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 05:56:32,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:32,740 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:32,741 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:32,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715671146] [2021-12-28 05:56:32,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715671146] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:32,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:32,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:56:32,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579713140] [2021-12-28 05:56:32,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:32,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:56:32,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:32,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:56:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:56:32,742 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:32,788 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-12-28 05:56:32,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:56:32,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2021-12-28 05:56:32,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:32,789 INFO L225 Difference]: With dead ends: 94 [2021-12-28 05:56:32,789 INFO L226 Difference]: Without dead ends: 94 [2021-12-28 05:56:32,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:56:32,790 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 42 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:32,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 395 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:56:32,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-28 05:56:32,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-28 05:56:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 86 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-12-28 05:56:32,793 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 50 [2021-12-28 05:56:32,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:32,793 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-12-28 05:56:32,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:32,793 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2021-12-28 05:56:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-28 05:56:32,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:32,793 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:32,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:32,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:32,994 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:32,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash -774905870, now seen corresponding path program 1 times [2021-12-28 05:56:32,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:32,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116678359] [2021-12-28 05:56:32,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:32,995 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:32,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:32,996 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:32,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-28 05:56:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:33,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-28 05:56:33,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:33,232 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-28 05:56:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:33,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:33,427 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:33,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116678359] [2021-12-28 05:56:33,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116678359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:33,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:33,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-28 05:56:33,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625887879] [2021-12-28 05:56:33,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:33,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 05:56:33,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:33,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 05:56:33,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:56:33,428 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 12 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:33,748 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2021-12-28 05:56:33,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:56:33,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2021-12-28 05:56:33,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:33,749 INFO L225 Difference]: With dead ends: 123 [2021-12-28 05:56:33,749 INFO L226 Difference]: Without dead ends: 123 [2021-12-28 05:56:33,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-28 05:56:33,750 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 138 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:33,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 346 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 0 Unknown, 17 Unchecked, 0.3s Time] [2021-12-28 05:56:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-28 05:56:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2021-12-28 05:56:33,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 100 states have internal predecessors, (107), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-28 05:56:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2021-12-28 05:56:33,753 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 56 [2021-12-28 05:56:33,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:33,753 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2021-12-28 05:56:33,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2021-12-28 05:56:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-28 05:56:33,754 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:33,754 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:33,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-28 05:56:33,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:33,955 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:33,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:33,955 INFO L85 PathProgramCache]: Analyzing trace with hash -774905869, now seen corresponding path program 1 times [2021-12-28 05:56:33,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:33,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713971351] [2021-12-28 05:56:33,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:33,956 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:33,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:33,956 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:33,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-28 05:56:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:34,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-28 05:56:34,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:34,200 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-28 05:56:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:34,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:34,600 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:34,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713971351] [2021-12-28 05:56:34,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713971351] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:34,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:34,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 05:56:34,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789185091] [2021-12-28 05:56:34,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:34,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 05:56:34,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:34,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 05:56:34,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:56:34,601 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:34,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:34,992 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-12-28 05:56:34,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:56:34,995 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2021-12-28 05:56:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:34,995 INFO L225 Difference]: With dead ends: 111 [2021-12-28 05:56:34,995 INFO L226 Difference]: Without dead ends: 111 [2021-12-28 05:56:34,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-28 05:56:34,996 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 150 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:34,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 433 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 233 Invalid, 0 Unknown, 8 Unchecked, 0.3s Time] [2021-12-28 05:56:34,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-28 05:56:34,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2021-12-28 05:56:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.1704545454545454) internal successors, (103), 98 states have internal predecessors, (103), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-28 05:56:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2021-12-28 05:56:35,000 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 56 [2021-12-28 05:56:35,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:35,000 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2021-12-28 05:56:35,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2021-12-28 05:56:35,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-28 05:56:35,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:35,001 INFO L514 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:35,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:35,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:35,215 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:35,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:35,215 INFO L85 PathProgramCache]: Analyzing trace with hash -178952659, now seen corresponding path program 1 times [2021-12-28 05:56:35,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:35,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760982817] [2021-12-28 05:56:35,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:35,216 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:35,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:35,216 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:35,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-28 05:56:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:35,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 05:56:35,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:35,583 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:35,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:35,583 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:35,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760982817] [2021-12-28 05:56:35,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760982817] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:35,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:35,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 05:56:35,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793480276] [2021-12-28 05:56:35,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:35,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 05:56:35,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:35,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 05:56:35,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:56:35,585 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 05:56:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:35,681 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-12-28 05:56:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:56:35,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2021-12-28 05:56:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:35,682 INFO L225 Difference]: With dead ends: 111 [2021-12-28 05:56:35,682 INFO L226 Difference]: Without dead ends: 107 [2021-12-28 05:56:35,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:56:35,683 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 71 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:35,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 527 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:56:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-28 05:56:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-28 05:56:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 98 states have internal predecessors, (101), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-28 05:56:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2021-12-28 05:56:35,686 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 62 [2021-12-28 05:56:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:35,686 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2021-12-28 05:56:35,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 05:56:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2021-12-28 05:56:35,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-28 05:56:35,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:35,687 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:35,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:35,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:35,895 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:35,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:35,896 INFO L85 PathProgramCache]: Analyzing trace with hash 59491574, now seen corresponding path program 1 times [2021-12-28 05:56:35,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:35,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812734557] [2021-12-28 05:56:35,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:35,897 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:35,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:35,898 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:35,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-28 05:56:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:36,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-28 05:56:36,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:36,164 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-28 05:56:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:36,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:36,362 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:36,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812734557] [2021-12-28 05:56:36,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812734557] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:36,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:36,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 05:56:36,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530516337] [2021-12-28 05:56:36,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:36,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 05:56:36,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:36,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 05:56:36,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:56:36,363 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:36,719 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2021-12-28 05:56:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 05:56:36,719 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2021-12-28 05:56:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:36,720 INFO L225 Difference]: With dead ends: 116 [2021-12-28 05:56:36,720 INFO L226 Difference]: Without dead ends: 116 [2021-12-28 05:56:36,720 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-12-28 05:56:36,720 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 98 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:36,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 465 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 330 Invalid, 0 Unknown, 18 Unchecked, 0.3s Time] [2021-12-28 05:56:36,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-28 05:56:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2021-12-28 05:56:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.146067415730337) internal successors, (102), 98 states have internal predecessors, (102), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-28 05:56:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2021-12-28 05:56:36,728 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 62 [2021-12-28 05:56:36,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:36,728 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2021-12-28 05:56:36,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2021-12-28 05:56:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-28 05:56:36,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:36,729 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:36,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-28 05:56:36,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:36,935 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:36,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash 59491575, now seen corresponding path program 1 times [2021-12-28 05:56:36,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:36,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107639375] [2021-12-28 05:56:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:36,936 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:36,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:36,937 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:36,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-28 05:56:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:37,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-28 05:56:37,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:37,202 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-28 05:56:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:37,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:37,550 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:37,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107639375] [2021-12-28 05:56:37,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107639375] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:37,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:37,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 05:56:37,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407154129] [2021-12-28 05:56:37,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:37,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 05:56:37,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:37,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 05:56:37,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:56:37,551 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:38,007 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2021-12-28 05:56:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:56:38,007 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 62 [2021-12-28 05:56:38,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:38,008 INFO L225 Difference]: With dead ends: 126 [2021-12-28 05:56:38,008 INFO L226 Difference]: Without dead ends: 126 [2021-12-28 05:56:38,008 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-12-28 05:56:38,009 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 166 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:38,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 474 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 247 Invalid, 0 Unknown, 13 Unchecked, 0.3s Time] [2021-12-28 05:56:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-28 05:56:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2021-12-28 05:56:38,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.175257731958763) internal successors, (114), 105 states have internal predecessors, (114), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2021-12-28 05:56:38,012 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 62 [2021-12-28 05:56:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:38,012 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2021-12-28 05:56:38,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:38,012 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2021-12-28 05:56:38,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-28 05:56:38,013 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:38,013 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:38,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-12-28 05:56:38,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:38,219 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:38,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:38,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1507930724, now seen corresponding path program 1 times [2021-12-28 05:56:38,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:38,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953602980] [2021-12-28 05:56:38,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:38,220 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:38,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:38,221 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:38,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-28 05:56:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:38,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-28 05:56:38,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:39,028 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:39,029 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:39,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953602980] [2021-12-28 05:56:39,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953602980] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:39,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:39,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 05:56:39,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922925294] [2021-12-28 05:56:39,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:39,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 05:56:39,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:39,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 05:56:39,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:56:39,031 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 14 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:39,355 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2021-12-28 05:56:39,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:56:39,356 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 65 [2021-12-28 05:56:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:39,357 INFO L225 Difference]: With dead ends: 121 [2021-12-28 05:56:39,357 INFO L226 Difference]: Without dead ends: 121 [2021-12-28 05:56:39,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2021-12-28 05:56:39,358 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 207 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:39,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 432 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 189 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2021-12-28 05:56:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-28 05:56:39,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2021-12-28 05:56:39,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 104 states have internal predecessors, (112), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-28 05:56:39,361 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 65 [2021-12-28 05:56:39,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:39,361 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-28 05:56:39,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-28 05:56:39,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-28 05:56:39,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:39,362 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:39,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2021-12-28 05:56:39,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:39,567 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:39,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:39,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1701102758, now seen corresponding path program 1 times [2021-12-28 05:56:39,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:39,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150372258] [2021-12-28 05:56:39,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:39,568 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:39,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:39,569 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:39,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-28 05:56:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:39,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 86 conjunts are in the unsatisfiable core [2021-12-28 05:56:39,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:40,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:40,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:40,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:40,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:40,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:40,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:40,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2021-12-28 05:56:43,388 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2050 (_ BitVec 8)) (v_ArrVal_2049 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2049) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2050)))) is different from true [2021-12-28 05:56:43,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:43,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:43,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:43,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2021-12-28 05:56:43,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:43,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:43,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:43,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:43,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:43,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:43,719 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:56:43,722 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:56:43,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 69 [2021-12-28 05:56:43,993 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:56:43,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 23 [2021-12-28 05:56:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:44,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:44,224 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:44,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150372258] [2021-12-28 05:56:44,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150372258] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:44,225 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:44,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-12-28 05:56:44,225 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519967835] [2021-12-28 05:56:44,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:44,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-28 05:56:44,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:44,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-28 05:56:44,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=641, Unknown=2, NotChecked=50, Total=756 [2021-12-28 05:56:44,226 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:45,047 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2021-12-28 05:56:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-28 05:56:45,048 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2021-12-28 05:56:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:45,049 INFO L225 Difference]: With dead ends: 101 [2021-12-28 05:56:45,049 INFO L226 Difference]: Without dead ends: 101 [2021-12-28 05:56:45,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=136, Invalid=1198, Unknown=2, NotChecked=70, Total=1406 [2021-12-28 05:56:45,050 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 36 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 331 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:45,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1105 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 249 Invalid, 0 Unknown, 331 Unchecked, 0.4s Time] [2021-12-28 05:56:45,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-28 05:56:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-28 05:56:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.1176470588235294) internal successors, (95), 92 states have internal predecessors, (95), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2021-12-28 05:56:45,059 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 68 [2021-12-28 05:56:45,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:45,059 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2021-12-28 05:56:45,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 25 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-28 05:56:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2021-12-28 05:56:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-28 05:56:45,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:45,060 INFO L514 BasicCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:45,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-28 05:56:45,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:45,260 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:45,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash -756328715, now seen corresponding path program 1 times [2021-12-28 05:56:45,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:45,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901092416] [2021-12-28 05:56:45,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:45,261 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:45,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:45,262 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:45,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-28 05:56:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:45,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-28 05:56:45,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:45,568 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-28 05:56:45,775 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:45,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:56:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:45,995 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:45,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901092416] [2021-12-28 05:56:45,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901092416] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:56:45,995 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:56:45,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2021-12-28 05:56:45,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224752521] [2021-12-28 05:56:45,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:56:45,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 05:56:45,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:45,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 05:56:45,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:56:45,996 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand has 13 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-28 05:56:46,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:46,245 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2021-12-28 05:56:46,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:56:46,246 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 70 [2021-12-28 05:56:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:46,247 INFO L225 Difference]: With dead ends: 107 [2021-12-28 05:56:46,247 INFO L226 Difference]: Without dead ends: 107 [2021-12-28 05:56:46,247 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-12-28 05:56:46,248 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 108 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:46,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 363 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 200 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2021-12-28 05:56:46,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-28 05:56:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2021-12-28 05:56:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 91 states have internal predecessors, (94), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:46,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2021-12-28 05:56:46,250 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 70 [2021-12-28 05:56:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:46,251 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2021-12-28 05:56:46,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.25) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-28 05:56:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2021-12-28 05:56:46,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-28 05:56:46,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:46,252 INFO L514 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:46,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:46,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:46,465 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash 681881017, now seen corresponding path program 1 times [2021-12-28 05:56:46,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:46,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952478089] [2021-12-28 05:56:46,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:46,466 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:46,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:46,466 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:46,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-28 05:56:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:46,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-28 05:56:46,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:46,804 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-28 05:56:47,034 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:47,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:56:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:47,266 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:47,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952478089] [2021-12-28 05:56:47,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952478089] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:56:47,267 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:56:47,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2021-12-28 05:56:47,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463064260] [2021-12-28 05:56:47,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:56:47,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 05:56:47,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:47,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 05:56:47,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:56:47,269 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 14 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-28 05:56:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:47,657 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2021-12-28 05:56:47,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:56:47,657 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 76 [2021-12-28 05:56:47,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:47,658 INFO L225 Difference]: With dead ends: 106 [2021-12-28 05:56:47,658 INFO L226 Difference]: Without dead ends: 106 [2021-12-28 05:56:47,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-28 05:56:47,659 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 91 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:47,659 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 441 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 51 Unchecked, 0.3s Time] [2021-12-28 05:56:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-28 05:56:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2021-12-28 05:56:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 85 states have (on average 1.0941176470588236) internal successors, (93), 90 states have internal predecessors, (93), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2021-12-28 05:56:47,661 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 76 [2021-12-28 05:56:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:47,662 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2021-12-28 05:56:47,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 12 states have internal predecessors, (69), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-28 05:56:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2021-12-28 05:56:47,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-28 05:56:47,662 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:47,662 INFO L514 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:47,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-28 05:56:47,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:47,863 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:47,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:47,863 INFO L85 PathProgramCache]: Analyzing trace with hash 681881018, now seen corresponding path program 1 times [2021-12-28 05:56:47,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:47,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226691327] [2021-12-28 05:56:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:47,864 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:47,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:47,865 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:47,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-28 05:56:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:48,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-28 05:56:48,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:48,249 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-28 05:56:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-28 05:56:48,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:56:48,702 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:56:48,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226691327] [2021-12-28 05:56:48,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226691327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:56:48,702 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:56:48,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 05:56:48,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124656388] [2021-12-28 05:56:48,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:56:48,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 05:56:48,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:56:48,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 05:56:48,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:56:48,703 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand has 13 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 05:56:49,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:56:49,023 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2021-12-28 05:56:49,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 05:56:49,024 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 76 [2021-12-28 05:56:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:56:49,024 INFO L225 Difference]: With dead ends: 101 [2021-12-28 05:56:49,024 INFO L226 Difference]: Without dead ends: 101 [2021-12-28 05:56:49,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2021-12-28 05:56:49,026 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 92 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:56:49,026 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 513 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2021-12-28 05:56:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-28 05:56:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2021-12-28 05:56:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 88 states have internal predecessors, (91), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-28 05:56:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2021-12-28 05:56:49,028 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 76 [2021-12-28 05:56:49,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:56:49,029 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2021-12-28 05:56:49,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-28 05:56:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2021-12-28 05:56:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-28 05:56:49,030 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:56:49,030 INFO L514 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:56:49,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2021-12-28 05:56:49,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:56:49,243 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-28 05:56:49,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:56:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1200120414, now seen corresponding path program 1 times [2021-12-28 05:56:49,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:56:49,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067998393] [2021-12-28 05:56:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:56:49,244 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:56:49,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:56:49,245 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:56:49,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-28 05:56:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:56:49,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 122 conjunts are in the unsatisfiable core [2021-12-28 05:56:49,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:56:49,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:49,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:49,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:49,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:49,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:49,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:49,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:49,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:49,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:49,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:56:49,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:56:49,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2021-12-28 05:56:52,944 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2734 (_ BitVec 8)) (v_ArrVal_2733 (_ BitVec 8))) (= |c_#memory_int| (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2733) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2734)))) is different from true [2021-12-28 05:56:52,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:52,973 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:56:52,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2021-12-28 05:56:53,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:53,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:53,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:53,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:53,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:53,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:53,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:53,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:53,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:53,330 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:56:53,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:53,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:56:53,332 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:56:53,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:53,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:53,334 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:56:53,343 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:56:53,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 165 [2021-12-28 05:56:54,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:54,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:54,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:54,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:54,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:54,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:56:54,013 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:56:54,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 137 [2021-12-28 05:56:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-12-28 05:56:58,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:57:10,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select |c_#memory_int| |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2021-12-28 05:57:12,804 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (store (store (store (store (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32)) ((_ extract 15 8) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) ((_ extract 23 16) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32)) ((_ extract 31 24) |c_ldv_kobject_put_ldv_atomic_sub_return_~temp~1#1|))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2021-12-28 05:57:14,857 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (let ((.cse5 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_#t~mem28#1| (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|)))) (store (store (store (store (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) .cse5)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32)) ((_ extract 15 8) .cse5)) (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|) ((_ extract 23 16) .cse5)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32)) ((_ extract 31 24) .cse5)))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32)) (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse6 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse12 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse11 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse7 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse9 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse7 .cse12) (select .cse7 .cse11)) (select .cse7 .cse10)) (select .cse7 .cse8))))) (store (store (store (store .cse7 .cse8 ((_ extract 7 0) .cse9)) .cse10 ((_ extract 15 8) .cse9)) .cse11 ((_ extract 23 16) .cse9)) .cse12 ((_ extract 31 24) .cse9))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse6 .cse1) (select .cse6 .cse2)) (select .cse6 .cse3)) (select .cse6 .cse4))))))))) is different from false [2021-12-28 05:57:16,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))))) (= (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (let ((.cse16 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32))) (.cse15 (bvadd (_ bv2 32) |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|)) (.cse14 (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32))) (.cse12 (select |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base|))) (let ((.cse13 (bvadd (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|) (concat (concat (concat (select .cse12 .cse16) (select .cse12 .cse15)) (select .cse12 .cse14)) (select .cse12 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset|))))) (store (store (store (store .cse12 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| ((_ extract 7 0) .cse13)) .cse14 ((_ extract 15 8) .cse13)) .cse15 ((_ extract 23 16) .cse13)) .cse16 ((_ extract 31 24) .cse13))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4)))) (_ bv0 32))))) is different from false [2021-12-28 05:57:18,979 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32)))) (or (= (bvadd (_ bv4294967295 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_~kobj#1.base| (let ((.cse10 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv14 32))) (.cse8 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv13 32))) (.cse5 (select |c_#memory_int| |c_ldv_kobject_put_~kobj#1.base|)) (.cse6 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv12 32)))) (let ((.cse7 (bvadd (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6)) (_ bv4294967295 32)))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4)))) (_ bv0 32)) (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse17 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse16 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse15 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse12 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|)) (.cse13 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (let ((.cse14 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse12 .cse17) (select .cse12 .cse16)) (select .cse12 .cse15)) (select .cse12 .cse13))))) (store (store (store (store .cse12 .cse13 ((_ extract 7 0) .cse14)) .cse15 ((_ extract 15 8) .cse14)) .cse16 ((_ extract 23 16) .cse14)) .cse17 ((_ extract 31 24) .cse14))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4))))))))) is different from false [2021-12-28 05:57:21,017 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ BitVec 32))) (let ((.cse1 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv15 32))) (.cse2 (bvadd (_ bv14 32) |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6|)) (.cse3 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv13 32))) (.cse4 (bvadd |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv12 32))) (.cse10 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32))) (.cse9 (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|)) (.cse8 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32))) (.cse6 (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv12 32)))) (or (= (bvadd (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse5 (select |c_#memory_int| |c_ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse7 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse5 .cse10) (select .cse5 .cse9)) (select .cse5 .cse8)) (select .cse5 .cse6))))) (store (store (store (store .cse5 .cse6 ((_ extract 7 0) .cse7)) .cse8 ((_ extract 15 8) .cse7)) .cse9 ((_ extract 23 16) .cse7)) .cse10 ((_ extract 31 24) .cse7))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse0 .cse1) (select .cse0 .cse2)) (select .cse0 .cse3)) (select .cse0 .cse4))) (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv0 32) (bvadd (_ bv4294967295 32) (let ((.cse11 (select (store |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base| (let ((.cse12 (select |c_old(#memory_int)| |c_ldv_kobject_put_#in~kobj#1.base|))) (let ((.cse13 (bvadd (_ bv4294967295 32) (concat (concat (concat (select .cse12 .cse10) (select .cse12 .cse9)) (select .cse12 .cse8)) (select .cse12 .cse6))))) (store (store (store (store .cse12 .cse6 ((_ extract 7 0) .cse13)) .cse8 ((_ extract 15 8) .cse13)) .cse9 ((_ extract 23 16) .cse13)) .cse10 ((_ extract 31 24) .cse13))))) |v_ULTIMATE.start_entry_point_~kobj~2#1.base_BEFORE_CALL_12|))) (concat (concat (concat (select .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4))))))))) is different from false [2021-12-28 05:57:23,360 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:57:23,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067998393] [2021-12-28 05:57:23,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067998393] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:57:23,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2119606488] [2021-12-28 05:57:23,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:23,361 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-28 05:57:23,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-28 05:57:23,363 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-28 05:57:23,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2021-12-28 05:57:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:24,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 139 conjunts are in the unsatisfiable core [2021-12-28 05:57:24,857 INFO L286 TraceCheckSpWp]: Computing forward predicates...