./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e19ca921 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-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 aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 00:09:34,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 00:09:34,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 00:09:34,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 00:09:34,280 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 00:09:34,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 00:09:34,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 00:09:34,288 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 00:09:34,290 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 00:09:34,291 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 00:09:34,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 00:09:34,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 00:09:34,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 00:09:34,300 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 00:09:34,301 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 00:09:34,302 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 00:09:34,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 00:09:34,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 00:09:34,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 00:09:34,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 00:09:34,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 00:09:34,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 00:09:34,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 00:09:34,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 00:09:34,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 00:09:34,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 00:09:34,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 00:09:34,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 00:09:34,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 00:09:34,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 00:09:34,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 00:09:34,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 00:09:34,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 00:09:34,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 00:09:34,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 00:09:34,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 00:09:34,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 00:09:34,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 00:09:34,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 00:09:34,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 00:09:34,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 00:09:34,328 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-22 00:09:34,356 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 00:09:34,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 00:09:34,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 00:09:34,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 00:09:34,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 00:09:34,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 00:09:34,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 00:09:34,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 00:09:34,358 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 00:09:34,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 00:09:34,359 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 00:09:34,359 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 00:09:34,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 00:09:34,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 00:09:34,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 00:09:34,360 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 00:09:34,360 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 00:09:34,360 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 00:09:34,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 00:09:34,361 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 00:09:34,361 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 00:09:34,361 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 00:09:34,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 00:09:34,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 00:09:34,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 00:09:34,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:09:34,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 00:09:34,364 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 00:09:34,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 00:09:34,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 00:09:34,365 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 00:09:34,365 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 -> aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd [2021-12-22 00:09:34,566 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 00:09:34,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 00:09:34,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 00:09:34,595 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 00:09:34,596 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 00:09:34,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2021-12-22 00:09:34,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0285e77/47848307009043e99187e1a3a7375a1f/FLAG85fe8de62 [2021-12-22 00:09:35,112 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 00:09:35,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2021-12-22 00:09:35,139 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0285e77/47848307009043e99187e1a3a7375a1f/FLAG85fe8de62 [2021-12-22 00:09:35,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c0285e77/47848307009043e99187e1a3a7375a1f [2021-12-22 00:09:35,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 00:09:35,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 00:09:35,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 00:09:35,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 00:09:35,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 00:09:35,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:09:35" (1/1) ... [2021-12-22 00:09:35,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a92c96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:35, skipping insertion in model container [2021-12-22 00:09:35,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:09:35" (1/1) ... [2021-12-22 00:09:35,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 00:09:35,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 00:09:35,577 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:09:35,596 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-22 00:09:35,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@281f6ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:35, skipping insertion in model container [2021-12-22 00:09:35,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 00:09:35,598 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-22 00:09:35,600 INFO L158 Benchmark]: Toolchain (without parser) took 442.99ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 58.3MB in the beginning and 67.6MB in the end (delta: -9.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-22 00:09:35,602 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 00:09:35,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.09ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 58.1MB in the beginning and 67.6MB in the end (delta: -9.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-22 00:09:35,605 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 77.6MB. Free memory is still 59.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 441.09ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 58.1MB in the beginning and 67.6MB in the end (delta: -9.6MB). Peak memory consumption was 6.3MB. 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_1-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 aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 00:09:37,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 00:09:37,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 00:09:37,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 00:09:37,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 00:09:37,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 00:09:37,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 00:09:37,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 00:09:37,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 00:09:37,417 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 00:09:37,418 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 00:09:37,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 00:09:37,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 00:09:37,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 00:09:37,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 00:09:37,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 00:09:37,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 00:09:37,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 00:09:37,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 00:09:37,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 00:09:37,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 00:09:37,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 00:09:37,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 00:09:37,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 00:09:37,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 00:09:37,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 00:09:37,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 00:09:37,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 00:09:37,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 00:09:37,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 00:09:37,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 00:09:37,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 00:09:37,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 00:09:37,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 00:09:37,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 00:09:37,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 00:09:37,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 00:09:37,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 00:09:37,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 00:09:37,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 00:09:37,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 00:09:37,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-22 00:09:37,500 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 00:09:37,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 00:09:37,501 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 00:09:37,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 00:09:37,502 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 00:09:37,503 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 00:09:37,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 00:09:37,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 00:09:37,504 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 00:09:37,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 00:09:37,505 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 00:09:37,505 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 00:09:37,506 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 00:09:37,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 00:09:37,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 00:09:37,506 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-22 00:09:37,506 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-22 00:09:37,506 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-22 00:09:37,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 00:09:37,507 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-22 00:09:37,507 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-22 00:09:37,507 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-22 00:09:37,507 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 00:09:37,507 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 00:09:37,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 00:09:37,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 00:09:37,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 00:09:37,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:09:37,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 00:09:37,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 00:09:37,509 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-22 00:09:37,509 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-22 00:09:37,509 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 00:09:37,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-22 00:09:37,510 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 -> aa61daf361995635005a262e43d385a4b2c55dcce46079a14f1db13e5b0af9cd [2021-12-22 00:09:37,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 00:09:37,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 00:09:37,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 00:09:37,851 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 00:09:37,852 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 00:09:37,853 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2021-12-22 00:09:37,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171ceec7c/de1819ba14a34567a60a5ccd6a25f77e/FLAGbc95e976b [2021-12-22 00:09:38,467 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 00:09:38,468 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2021-12-22 00:09:38,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171ceec7c/de1819ba14a34567a60a5ccd6a25f77e/FLAGbc95e976b [2021-12-22 00:09:38,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/171ceec7c/de1819ba14a34567a60a5ccd6a25f77e [2021-12-22 00:09:38,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 00:09:38,773 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 00:09:38,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 00:09:38,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 00:09:38,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 00:09:38,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:09:38" (1/1) ... [2021-12-22 00:09:38,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cd6773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:38, skipping insertion in model container [2021-12-22 00:09:38,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 12:09:38" (1/1) ... [2021-12-22 00:09:38,789 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 00:09:38,831 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 00:09:39,220 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:09:39,242 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-22 00:09:39,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 00:09:39,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:09:39,314 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 00:09:39,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 00:09:39,409 INFO L208 MainTranslator]: Completed translation [2021-12-22 00:09:39,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:39 WrapperNode [2021-12-22 00:09:39,410 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 00:09:39,411 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 00:09:39,411 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 00:09:39,411 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 00:09:39,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:39" (1/1) ... [2021-12-22 00:09:39,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:39" (1/1) ... [2021-12-22 00:09:39,464 INFO L137 Inliner]: procedures = 165, calls = 70, calls flagged for inlining = 24, calls inlined = 18, statements flattened = 119 [2021-12-22 00:09:39,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 00:09:39,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 00:09:39,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 00:09:39,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 00:09:39,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:39" (1/1) ... [2021-12-22 00:09:39,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:39" (1/1) ... [2021-12-22 00:09:39,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:39" (1/1) ... [2021-12-22 00:09:39,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:39" (1/1) ... [2021-12-22 00:09:39,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:39" (1/1) ... [2021-12-22 00:09:39,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:39" (1/1) ... [2021-12-22 00:09:39,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:39" (1/1) ... [2021-12-22 00:09:39,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 00:09:39,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 00:09:39,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 00:09:39,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 00:09:39,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:39" (1/1) ... [2021-12-22 00:09:39,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 00:09:39,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 00:09:39,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 00:09:39,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 00:09:39,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-22 00:09:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2021-12-22 00:09:39,565 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2021-12-22 00:09:39,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-22 00:09:39,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-22 00:09:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-22 00:09:39,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 00:09:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-22 00:09:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-22 00:09:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-22 00:09:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 00:09:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-22 00:09:39,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 00:09:39,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 00:09:39,772 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 00:09:39,774 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 00:09:40,173 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 00:09:40,179 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 00:09:40,179 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-22 00:09:40,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:09:40 BoogieIcfgContainer [2021-12-22 00:09:40,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 00:09:40,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 00:09:40,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 00:09:40,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 00:09:40,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 12:09:38" (1/3) ... [2021-12-22 00:09:40,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b085a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:09:40, skipping insertion in model container [2021-12-22 00:09:40,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 12:09:39" (2/3) ... [2021-12-22 00:09:40,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b085a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 12:09:40, skipping insertion in model container [2021-12-22 00:09:40,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:09:40" (3/3) ... [2021-12-22 00:09:40,191 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-1.i [2021-12-22 00:09:40,196 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 00:09:40,197 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-12-22 00:09:40,245 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 00:09:40,260 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 00:09:40,261 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-12-22 00:09:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 82 states have internal predecessors, (90), 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-22 00:09:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 00:09:40,289 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:40,290 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:09:40,290 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-22 00:09:40,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:40,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1571354969, now seen corresponding path program 1 times [2021-12-22 00:09:40,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:40,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483608816] [2021-12-22 00:09:40,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:40,308 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:40,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:40,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:09:40,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-22 00:09:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:40,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 00:09:40,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:40,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:09:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:09:40,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:40,569 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:40,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483608816] [2021-12-22 00:09:40,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483608816] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:40,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:40,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:09:40,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748407277] [2021-12-22 00:09:40,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:40,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:09:40,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:40,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:09:40,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:09:40,610 INFO L87 Difference]: Start difference. First operand has 86 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 82 states have internal predecessors, (90), 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) 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-22 00:09:41,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:41,060 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2021-12-22 00:09:41,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:09:41,062 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-22 00:09:41,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:41,070 INFO L225 Difference]: With dead ends: 233 [2021-12-22 00:09:41,070 INFO L226 Difference]: Without dead ends: 225 [2021-12-22 00:09:41,076 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-22 00:09:41,082 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 181 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:41,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 410 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:09:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-22 00:09:41,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 89. [2021-12-22 00:09:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.576271186440678) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:09:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2021-12-22 00:09:41,123 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 10 [2021-12-22 00:09:41,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:41,123 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2021-12-22 00:09:41,123 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-22 00:09:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2021-12-22 00:09:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 00:09:41,124 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:41,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:09:41,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:41,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:09:41,341 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-22 00:09:41,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:41,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1599984120, now seen corresponding path program 1 times [2021-12-22 00:09:41,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:41,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186880031] [2021-12-22 00:09:41,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:41,343 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:41,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:41,347 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:09:41,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-22 00:09:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:41,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 00:09:41,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:09:41,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:41,485 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:41,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186880031] [2021-12-22 00:09:41,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186880031] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:41,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:41,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:09:41,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556706896] [2021-12-22 00:09:41,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:41,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:09:41,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:41,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:09:41,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:09:41,488 INFO L87 Difference]: Start difference. First operand 89 states and 98 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-22 00:09:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:41,508 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2021-12-22 00:09:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:09:41,509 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-22 00:09:41,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:41,510 INFO L225 Difference]: With dead ends: 138 [2021-12-22 00:09:41,510 INFO L226 Difference]: Without dead ends: 138 [2021-12-22 00:09:41,510 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-22 00:09:41,511 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 54 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 360 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-22 00:09:41,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 360 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:09:41,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-22 00:09:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 87. [2021-12-22 00:09:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.5517241379310345) internal successors, (90), 82 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:09:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-12-22 00:09:41,519 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 10 [2021-12-22 00:09:41,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:41,519 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-12-22 00:09:41,519 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-22 00:09:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-12-22 00:09:41,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 00:09:41,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:41,520 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:09:41,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:41,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:09:41,729 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-22 00:09:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:41,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1467363832, now seen corresponding path program 1 times [2021-12-22 00:09:41,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:41,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716295350] [2021-12-22 00:09:41,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:41,731 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:41,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:41,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:09:41,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-22 00:09:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:41,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-22 00:09:41,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:41,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:09:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:09:41,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:41,933 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:41,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716295350] [2021-12-22 00:09:41,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716295350] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:41,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:41,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 00:09:41,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110506394] [2021-12-22 00:09:41,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:41,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 00:09:41,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:41,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 00:09:41,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:09:41,936 INFO L87 Difference]: Start difference. First operand 87 states and 95 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-22 00:09:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:42,345 INFO L93 Difference]: Finished difference Result 188 states and 202 transitions. [2021-12-22 00:09:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:09:42,346 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-22 00:09:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:42,348 INFO L225 Difference]: With dead ends: 188 [2021-12-22 00:09:42,348 INFO L226 Difference]: Without dead ends: 188 [2021-12-22 00:09:42,348 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-22 00:09:42,349 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 143 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:42,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 527 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:09:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-22 00:09:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 86. [2021-12-22 00:09:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 81 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:09:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2021-12-22 00:09:42,358 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 11 [2021-12-22 00:09:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:42,358 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2021-12-22 00:09:42,358 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-22 00:09:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2021-12-22 00:09:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 00:09:42,359 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:42,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:09:42,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:42,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:09:42,569 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-22 00:09:42,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:42,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1756388193, now seen corresponding path program 1 times [2021-12-22 00:09:42,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:42,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790364340] [2021-12-22 00:09:42,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:42,570 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:42,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:42,571 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:09:42,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-22 00:09:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:42,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 00:09:42,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:09:42,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:42,665 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:42,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790364340] [2021-12-22 00:09:42,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790364340] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:42,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:42,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:09:42,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704550649] [2021-12-22 00:09:42,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:42,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:09:42,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:09:42,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:09:42,667 INFO L87 Difference]: Start difference. First operand 86 states and 94 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-22 00:09:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:42,684 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2021-12-22 00:09:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:09:42,685 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-22 00:09:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:42,686 INFO L225 Difference]: With dead ends: 137 [2021-12-22 00:09:42,686 INFO L226 Difference]: Without dead ends: 137 [2021-12-22 00:09:42,686 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-22 00:09:42,687 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 70 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 487 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-22 00:09:42,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 487 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:09:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-12-22 00:09:42,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 86. [2021-12-22 00:09:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:09:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2021-12-22 00:09:42,694 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 12 [2021-12-22 00:09:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:42,694 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2021-12-22 00:09:42,694 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-22 00:09:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2021-12-22 00:09:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-22 00:09:42,695 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:42,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:09:42,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:42,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:09:42,904 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-22 00:09:42,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:42,905 INFO L85 PathProgramCache]: Analyzing trace with hash -13577858, now seen corresponding path program 1 times [2021-12-22 00:09:42,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:42,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958892024] [2021-12-22 00:09:42,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:42,905 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:42,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:42,907 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:09:42,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-22 00:09:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:42,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 00:09:42,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:43,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:09:43,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:43,015 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:43,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958892024] [2021-12-22 00:09:43,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958892024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:43,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:43,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:09:43,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802111294] [2021-12-22 00:09:43,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:43,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:09:43,017 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:43,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:09:43,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:09:43,017 INFO L87 Difference]: Start difference. First operand 86 states and 93 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-22 00:09:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:43,052 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2021-12-22 00:09:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 00:09:43,053 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-22 00:09:43,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:43,054 INFO L225 Difference]: With dead ends: 166 [2021-12-22 00:09:43,054 INFO L226 Difference]: Without dead ends: 166 [2021-12-22 00:09:43,054 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-22 00:09:43,058 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 126 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:43,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:09:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-22 00:09:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 88. [2021-12-22 00:09:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.5) internal successors, (90), 83 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:09:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2021-12-22 00:09:43,082 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 12 [2021-12-22 00:09:43,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:43,082 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2021-12-22 00:09:43,083 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-22 00:09:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2021-12-22 00:09:43,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-22 00:09:43,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:43,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:09:43,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:43,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:09:43,289 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:43,289 INFO L85 PathProgramCache]: Analyzing trace with hash -757624885, now seen corresponding path program 1 times [2021-12-22 00:09:43,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:43,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827920018] [2021-12-22 00:09:43,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:43,290 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:43,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:43,291 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:09:43,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-22 00:09:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:43,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-22 00:09:43,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:09:43,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:43,433 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:43,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827920018] [2021-12-22 00:09:43,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827920018] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:43,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:43,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 00:09:43,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363865309] [2021-12-22 00:09:43,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:43,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 00:09:43,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:43,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 00:09:43,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 00:09:43,435 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-22 00:09:43,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:43,472 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2021-12-22 00:09:43,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:09:43,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 15 [2021-12-22 00:09:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:43,473 INFO L225 Difference]: With dead ends: 99 [2021-12-22 00:09:43,474 INFO L226 Difference]: Without dead ends: 99 [2021-12-22 00:09:43,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:09:43,474 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 20 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:43,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 346 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:09:43,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-22 00:09:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2021-12-22 00:09:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 63 states have (on average 1.4761904761904763) internal successors, (93), 86 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:09:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2021-12-22 00:09:43,479 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 15 [2021-12-22 00:09:43,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:43,479 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2021-12-22 00:09:43,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-22 00:09:43,479 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2021-12-22 00:09:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-22 00:09:43,480 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:43,480 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:09:43,490 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-22 00:09:43,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:09:43,688 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-22 00:09:43,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:43,689 INFO L85 PathProgramCache]: Analyzing trace with hash 705966087, now seen corresponding path program 1 times [2021-12-22 00:09:43,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:43,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608985926] [2021-12-22 00:09:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:43,689 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:43,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:43,691 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:09:43,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-22 00:09:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:43,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-22 00:09:43,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:09:43,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:43,786 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:43,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608985926] [2021-12-22 00:09:43,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608985926] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:43,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:43,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-22 00:09:43,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308069396] [2021-12-22 00:09:43,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:43,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:09:43,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:43,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:09:43,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:09:43,794 INFO L87 Difference]: Start difference. First operand 91 states and 98 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-22 00:09:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:43,809 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2021-12-22 00:09:43,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:09:43,810 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-22 00:09:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:43,810 INFO L225 Difference]: With dead ends: 96 [2021-12-22 00:09:43,811 INFO L226 Difference]: Without dead ends: 96 [2021-12-22 00:09:43,811 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-22 00:09:43,812 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 68 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:43,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 188 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:09:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-22 00:09:43,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2021-12-22 00:09:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.46875) internal successors, (94), 87 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:09:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2021-12-22 00:09:43,816 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 16 [2021-12-22 00:09:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:43,816 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2021-12-22 00:09:43,817 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-22 00:09:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2021-12-22 00:09:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-22 00:09:43,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:43,817 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:09:43,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:44,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:09:44,028 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:44,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:44,029 INFO L85 PathProgramCache]: Analyzing trace with hash 350853090, now seen corresponding path program 1 times [2021-12-22 00:09:44,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:44,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531386672] [2021-12-22 00:09:44,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:44,029 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:44,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:44,030 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:09:44,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-22 00:09:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:44,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 00:09:44,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:44,163 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-22 00:09:44,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:09:44,223 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-22 00:09:44,223 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:44,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531386672] [2021-12-22 00:09:44,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531386672] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:09:44,223 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:09:44,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-22 00:09:44,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572559656] [2021-12-22 00:09:44,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:09:44,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:09:44,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:44,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:09:44,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:09:44,225 INFO L87 Difference]: Start difference. First operand 92 states and 99 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-22 00:09:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:44,278 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2021-12-22 00:09:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:09:44,279 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-22 00:09:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:44,280 INFO L225 Difference]: With dead ends: 99 [2021-12-22 00:09:44,280 INFO L226 Difference]: Without dead ends: 99 [2021-12-22 00:09:44,280 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-22 00:09:44,281 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 136 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:44,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 401 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:09:44,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-12-22 00:09:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2021-12-22 00:09:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 90 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-22 00:09:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2021-12-22 00:09:44,285 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 17 [2021-12-22 00:09:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:44,285 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2021-12-22 00:09:44,285 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-22 00:09:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2021-12-22 00:09:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-22 00:09:44,286 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:44,286 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:09:44,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:44,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:09:44,496 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:44,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:44,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2068405965, now seen corresponding path program 1 times [2021-12-22 00:09:44,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:44,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128495249] [2021-12-22 00:09:44,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:44,496 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:44,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:44,497 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:09:44,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-22 00:09:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:44,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 00:09:44,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 00:09:44,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:44,591 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:44,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128495249] [2021-12-22 00:09:44,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128495249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:44,591 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:44,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 00:09:44,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430627722] [2021-12-22 00:09:44,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:44,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-22 00:09:44,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:44,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-22 00:09:44,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-22 00:09:44,593 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-22 00:09:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:44,687 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-12-22 00:09:44,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-22 00:09:44,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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 17 [2021-12-22 00:09:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:44,688 INFO L225 Difference]: With dead ends: 98 [2021-12-22 00:09:44,688 INFO L226 Difference]: Without dead ends: 86 [2021-12-22 00:09:44,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-22 00:09:44,689 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 8 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:44,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 200 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:09:44,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-22 00:09:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2021-12-22 00:09:44,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.4915254237288136) internal successors, (88), 82 states have internal predecessors, (88), 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-22 00:09:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2021-12-22 00:09:44,693 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 17 [2021-12-22 00:09:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:44,693 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2021-12-22 00:09:44,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 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-22 00:09:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2021-12-22 00:09:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 00:09:44,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:44,694 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:09:44,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:44,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:09:44,902 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:44,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash -400765241, now seen corresponding path program 2 times [2021-12-22 00:09:44,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:44,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582618365] [2021-12-22 00:09:44,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:09:44,903 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:44,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:44,905 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-22 00:09:44,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-22 00:09:44,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-22 00:09:44,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:09:44,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 00:09:44,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:44,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:09:45,059 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-22 00:09:45,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:45,060 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:45,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582618365] [2021-12-22 00:09:45,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582618365] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:45,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:45,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 00:09:45,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938396218] [2021-12-22 00:09:45,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:45,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:09:45,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:45,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:09:45,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:09:45,062 INFO L87 Difference]: Start difference. First operand 86 states and 92 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-22 00:09:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:45,423 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2021-12-22 00:09:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 00:09:45,424 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-22 00:09:45,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:45,425 INFO L225 Difference]: With dead ends: 176 [2021-12-22 00:09:45,425 INFO L226 Difference]: Without dead ends: 176 [2021-12-22 00:09:45,425 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-22 00:09:45,426 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 199 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:45,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 513 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 00:09:45,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-22 00:09:45,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 85. [2021-12-22 00:09:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 81 states have internal predecessors, (87), 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-22 00:09:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2021-12-22 00:09:45,429 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 20 [2021-12-22 00:09:45,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:45,430 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2021-12-22 00:09:45,430 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-22 00:09:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2021-12-22 00:09:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-22 00:09:45,431 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:45,431 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:09:45,438 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-22 00:09:45,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-22 00:09:45,636 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:45,636 INFO L85 PathProgramCache]: Analyzing trace with hash -400765240, now seen corresponding path program 1 times [2021-12-22 00:09:45,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:45,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786908365] [2021-12-22 00:09:45,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:45,637 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:45,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:45,637 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-22 00:09:45,638 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-22 00:09:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:45,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 00:09:45,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:45,818 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-22 00:09:45,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:09:45,986 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-22 00:09:45,986 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:45,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786908365] [2021-12-22 00:09:45,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786908365] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:09:45,986 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:09:45,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-22 00:09:45,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994397676] [2021-12-22 00:09:45,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:09:45,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 00:09:45,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:45,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 00:09:45,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-22 00:09:45,987 INFO L87 Difference]: Start difference. First operand 85 states and 91 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-22 00:09:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:46,206 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2021-12-22 00:09:46,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 00:09:46,207 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-22 00:09:46,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:46,208 INFO L225 Difference]: With dead ends: 91 [2021-12-22 00:09:46,208 INFO L226 Difference]: Without dead ends: 91 [2021-12-22 00:09:46,208 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-22 00:09:46,208 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 67 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:46,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 528 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 00:09:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-22 00:09:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-22 00:09:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 87 states have internal predecessors, (93), 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-22 00:09:46,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2021-12-22 00:09:46,211 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 20 [2021-12-22 00:09:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:46,211 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2021-12-22 00:09:46,211 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-22 00:09:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2021-12-22 00:09:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-22 00:09:46,212 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:46,212 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 00:09:46,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:46,421 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-22 00:09:46,421 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-22 00:09:46,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:46,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1067210520, now seen corresponding path program 2 times [2021-12-22 00:09:46,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:46,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117959573] [2021-12-22 00:09:46,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:09:46,422 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:46,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:46,423 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-22 00:09:46,424 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-22 00:09:46,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-22 00:09:46,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:09:46,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-22 00:09:46,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:46,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:09:46,702 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-22 00:09:46,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:46,702 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:46,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117959573] [2021-12-22 00:09:46,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117959573] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:46,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:46,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 00:09:46,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328308334] [2021-12-22 00:09:46,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:46,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 00:09:46,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:46,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 00:09:46,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:09:46,704 INFO L87 Difference]: Start difference. First operand 91 states and 97 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-22 00:09:47,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:47,175 INFO L93 Difference]: Finished difference Result 195 states and 207 transitions. [2021-12-22 00:09:47,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:09:47,176 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-22 00:09:47,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:47,177 INFO L225 Difference]: With dead ends: 195 [2021-12-22 00:09:47,177 INFO L226 Difference]: Without dead ends: 195 [2021-12-22 00:09:47,177 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-22 00:09:47,178 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 245 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:47,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 764 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-22 00:09:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-12-22 00:09:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 90. [2021-12-22 00:09:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 86 states have internal predecessors, (92), 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-22 00:09:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2021-12-22 00:09:47,181 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 26 [2021-12-22 00:09:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:47,181 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2021-12-22 00:09:47,181 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-22 00:09:47,181 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2021-12-22 00:09:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-22 00:09:47,182 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:47,182 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-22 00:09:47,193 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-22 00:09:47,391 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-22 00:09:47,391 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-22 00:09:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:47,391 INFO L85 PathProgramCache]: Analyzing trace with hash 906365991, now seen corresponding path program 1 times [2021-12-22 00:09:47,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:47,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945465789] [2021-12-22 00:09:47,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:47,392 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:47,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:47,393 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-22 00:09:47,394 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-22 00:09:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:47,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-22 00:09:47,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:47,735 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-22 00:09:47,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 00:09:48,188 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-22 00:09:48,189 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:48,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945465789] [2021-12-22 00:09:48,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945465789] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 00:09:48,189 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 00:09:48,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-22 00:09:48,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622555287] [2021-12-22 00:09:48,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 00:09:48,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-22 00:09:48,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:48,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-22 00:09:48,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2021-12-22 00:09:48,191 INFO L87 Difference]: Start difference. First operand 90 states and 96 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-22 00:09:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:48,563 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2021-12-22 00:09:48,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-22 00:09:48,564 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-22 00:09:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:48,570 INFO L225 Difference]: With dead ends: 96 [2021-12-22 00:09:48,570 INFO L226 Difference]: Without dead ends: 96 [2021-12-22 00:09:48,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2021-12-22 00:09:48,571 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 132 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:48,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 1055 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:09:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-22 00:09:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-12-22 00:09:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.380281690140845) internal successors, (98), 92 states have internal predecessors, (98), 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-22 00:09:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2021-12-22 00:09:48,574 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 28 [2021-12-22 00:09:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:48,575 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2021-12-22 00:09:48,575 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-22 00:09:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2021-12-22 00:09:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-22 00:09:48,575 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:48,576 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-22 00:09:48,590 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-22 00:09:48,787 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-22 00:09:48,788 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-22 00:09:48,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:48,788 INFO L85 PathProgramCache]: Analyzing trace with hash 929089095, now seen corresponding path program 2 times [2021-12-22 00:09:48,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:48,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267451962] [2021-12-22 00:09:48,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 00:09:48,789 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:48,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:48,790 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-22 00:09:48,791 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-22 00:09:48,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-22 00:09:48,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 00:09:48,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 00:09:48,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:48,963 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-22 00:09:48,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:48,963 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:48,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267451962] [2021-12-22 00:09:48,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267451962] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:48,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:48,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 00:09:48,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301811502] [2021-12-22 00:09:48,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:48,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 00:09:48,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:48,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 00:09:48,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 00:09:48,966 INFO L87 Difference]: Start difference. First operand 96 states and 102 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-22 00:09:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:49,000 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2021-12-22 00:09:49,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 00:09:49,001 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-22 00:09:49,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:49,001 INFO L225 Difference]: With dead ends: 96 [2021-12-22 00:09:49,002 INFO L226 Difference]: Without dead ends: 96 [2021-12-22 00:09:49,002 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-22 00:09:49,003 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 123 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:49,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 271 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:09:49,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-22 00:09:49,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-12-22 00:09:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 92 states have internal predecessors, (97), 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-22 00:09:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2021-12-22 00:09:49,007 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 34 [2021-12-22 00:09:49,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:49,008 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2021-12-22 00:09:49,008 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-22 00:09:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2021-12-22 00:09:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 00:09:49,013 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:49,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] [2021-12-22 00:09:49,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-22 00:09:49,225 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-22 00:09:49,226 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-22 00:09:49,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:49,226 INFO L85 PathProgramCache]: Analyzing trace with hash 950186315, now seen corresponding path program 1 times [2021-12-22 00:09:49,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:49,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347141462] [2021-12-22 00:09:49,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:49,227 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:49,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:49,229 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-22 00:09:49,231 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-22 00:09:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:49,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 00:09:49,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:49,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:09:49,538 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-22 00:09:49,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:49,538 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:49,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347141462] [2021-12-22 00:09:49,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347141462] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:49,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:49,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 00:09:49,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145842560] [2021-12-22 00:09:49,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:49,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 00:09:49,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 00:09:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:09:49,541 INFO L87 Difference]: Start difference. First operand 96 states and 101 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-22 00:09:49,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:49,756 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2021-12-22 00:09:49,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:09:49,757 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-22 00:09:49,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:49,758 INFO L225 Difference]: With dead ends: 100 [2021-12-22 00:09:49,758 INFO L226 Difference]: Without dead ends: 100 [2021-12-22 00:09:49,758 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-22 00:09:49,759 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 155 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:49,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 294 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:09:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-22 00:09:49,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-12-22 00:09:49,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 90 states have internal predecessors, (95), 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-22 00:09:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2021-12-22 00:09:49,762 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 36 [2021-12-22 00:09:49,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:49,762 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2021-12-22 00:09:49,762 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-22 00:09:49,763 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2021-12-22 00:09:49,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 00:09:49,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:49,763 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-22 00:09:49,773 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-22 00:09:49,971 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-22 00:09:49,972 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-22 00:09:49,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash 950186316, now seen corresponding path program 1 times [2021-12-22 00:09:49,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:49,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576010214] [2021-12-22 00:09:49,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:49,972 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:49,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:49,973 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-22 00:09:49,974 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-22 00:09:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:50,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-22 00:09:50,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:50,172 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:09:50,423 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-22 00:09:50,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:50,423 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:50,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576010214] [2021-12-22 00:09:50,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576010214] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:50,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:50,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:09:50,423 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372609645] [2021-12-22 00:09:50,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:50,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:09:50,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:50,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:09:50,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:09:50,426 INFO L87 Difference]: Start difference. First operand 94 states and 99 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-22 00:09:50,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:50,742 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2021-12-22 00:09:50,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:09:50,743 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-22 00:09:50,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:50,744 INFO L225 Difference]: With dead ends: 92 [2021-12-22 00:09:50,744 INFO L226 Difference]: Without dead ends: 92 [2021-12-22 00:09:50,744 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-22 00:09:50,745 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 189 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:50,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 339 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 00:09:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-22 00:09:50,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-22 00:09:50,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 88 states have internal predecessors, (93), 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-22 00:09:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2021-12-22 00:09:50,747 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 36 [2021-12-22 00:09:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:50,747 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2021-12-22 00:09:50,748 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-22 00:09:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2021-12-22 00:09:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-22 00:09:50,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:50,748 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-22 00:09:50,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:50,959 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-22 00:09:50,959 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-22 00:09:50,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:50,960 INFO L85 PathProgramCache]: Analyzing trace with hash 899481459, now seen corresponding path program 1 times [2021-12-22 00:09:50,960 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:50,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032260167] [2021-12-22 00:09:50,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:50,961 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:50,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:50,962 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-22 00:09:50,963 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-22 00:09:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:51,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 00:09:51,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:51,201 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-22 00:09:51,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:51,201 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:51,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032260167] [2021-12-22 00:09:51,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032260167] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:51,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:51,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 00:09:51,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019403023] [2021-12-22 00:09:51,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:51,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 00:09:51,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:51,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 00:09:51,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:09:51,204 INFO L87 Difference]: Start difference. First operand 92 states and 97 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-22 00:09:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:51,241 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2021-12-22 00:09:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:09:51,242 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-22 00:09:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:51,243 INFO L225 Difference]: With dead ends: 92 [2021-12-22 00:09:51,243 INFO L226 Difference]: Without dead ends: 92 [2021-12-22 00:09:51,243 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-22 00:09:51,243 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 180 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:51,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 261 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:09:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-22 00:09:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2021-12-22 00:09:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.295774647887324) internal successors, (92), 87 states have internal predecessors, (92), 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-22 00:09:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2021-12-22 00:09:51,246 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 36 [2021-12-22 00:09:51,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:51,246 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2021-12-22 00:09:51,246 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-22 00:09:51,246 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2021-12-22 00:09:51,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-22 00:09:51,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:51,247 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-22 00:09:51,260 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-22 00:09:51,457 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-22 00:09:51,458 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-22 00:09:51,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:51,458 INFO L85 PathProgramCache]: Analyzing trace with hash -471515152, now seen corresponding path program 1 times [2021-12-22 00:09:51,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:51,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115858108] [2021-12-22 00:09:51,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:51,459 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:51,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:51,460 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-22 00:09:51,460 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-22 00:09:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:51,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-22 00:09:51,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:51,660 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:09:51,810 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-22 00:09:51,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:51,810 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:51,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115858108] [2021-12-22 00:09:51,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115858108] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:51,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:51,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 00:09:51,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717845556] [2021-12-22 00:09:51,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:51,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 00:09:51,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:51,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 00:09:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-22 00:09:51,814 INFO L87 Difference]: Start difference. First operand 92 states and 96 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-22 00:09:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:52,039 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2021-12-22 00:09:52,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 00:09:52,039 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-22 00:09:52,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:52,040 INFO L225 Difference]: With dead ends: 125 [2021-12-22 00:09:52,040 INFO L226 Difference]: Without dead ends: 125 [2021-12-22 00:09:52,041 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-22 00:09:52,041 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 169 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:52,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 297 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 13 Unchecked, 0.2s Time] [2021-12-22 00:09:52,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-22 00:09:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 90. [2021-12-22 00:09:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.267605633802817) internal successors, (90), 85 states have internal predecessors, (90), 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-22 00:09:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2021-12-22 00:09:52,044 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 44 [2021-12-22 00:09:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:52,044 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2021-12-22 00:09:52,045 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-22 00:09:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2021-12-22 00:09:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-22 00:09:52,045 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:52,045 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-22 00:09:52,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2021-12-22 00:09:52,251 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-22 00:09:52,251 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-22 00:09:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -471515151, now seen corresponding path program 1 times [2021-12-22 00:09:52,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:52,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690341082] [2021-12-22 00:09:52,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:52,253 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:52,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:52,254 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-22 00:09:52,255 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-22 00:09:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:52,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-22 00:09:52,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:52,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:09:52,749 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-22 00:09:52,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:52,749 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:52,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690341082] [2021-12-22 00:09:52,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690341082] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:52,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:52,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:09:52,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680440466] [2021-12-22 00:09:52,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:52,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:09:52,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:52,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:09:52,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:09:52,751 INFO L87 Difference]: Start difference. First operand 90 states and 94 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-22 00:09:53,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:53,052 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2021-12-22 00:09:53,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:09:53,053 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-22 00:09:53,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:53,054 INFO L225 Difference]: With dead ends: 127 [2021-12-22 00:09:53,054 INFO L226 Difference]: Without dead ends: 127 [2021-12-22 00:09:53,054 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-22 00:09:53,055 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 261 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:53,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 404 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 7 Unchecked, 0.2s Time] [2021-12-22 00:09:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-22 00:09:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 88. [2021-12-22 00:09:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 83 states have internal predecessors, (88), 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-22 00:09:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2021-12-22 00:09:53,057 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 44 [2021-12-22 00:09:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:53,058 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2021-12-22 00:09:53,058 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-22 00:09:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2021-12-22 00:09:53,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-22 00:09:53,058 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:53,058 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] [2021-12-22 00:09:53,070 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-22 00:09:53,267 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-22 00:09:53,267 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1943548953, now seen corresponding path program 1 times [2021-12-22 00:09:53,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:53,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163590588] [2021-12-22 00:09:53,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:53,268 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:53,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:53,269 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-22 00:09:53,271 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-22 00:09:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:53,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 00:09:53,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:53,559 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-22 00:09:53,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:53,559 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:53,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163590588] [2021-12-22 00:09:53,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163590588] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:53,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:53,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 00:09:53,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992276502] [2021-12-22 00:09:53,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:53,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 00:09:53,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:53,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 00:09:53,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 00:09:53,561 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 1 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-22 00:09:53,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:53,601 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2021-12-22 00:09:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 00:09:53,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 1 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 47 [2021-12-22 00:09:53,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:53,602 INFO L225 Difference]: With dead ends: 88 [2021-12-22 00:09:53,602 INFO L226 Difference]: Without dead ends: 88 [2021-12-22 00:09:53,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 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-22 00:09:53,603 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 147 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:53,603 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 254 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:09:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-22 00:09:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-12-22 00:09:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 83 states have internal predecessors, (87), 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-22 00:09:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2021-12-22 00:09:53,605 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 47 [2021-12-22 00:09:53,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:53,606 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2021-12-22 00:09:53,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 2 states have call successors, (2), 1 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-22 00:09:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2021-12-22 00:09:53,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-22 00:09:53,606 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:53,606 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] [2021-12-22 00:09:53,620 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-22 00:09:53,807 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-22 00:09:53,807 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:53,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:53,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1735718259, now seen corresponding path program 1 times [2021-12-22 00:09:53,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:53,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485089794] [2021-12-22 00:09:53,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:53,808 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:53,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:53,809 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-22 00:09:53,810 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-22 00:09:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:54,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-22 00:09:54,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:54,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:09:54,223 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-22 00:09:54,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:54,224 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:54,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485089794] [2021-12-22 00:09:54,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485089794] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:54,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:54,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 00:09:54,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215123964] [2021-12-22 00:09:54,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:54,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 00:09:54,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:54,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 00:09:54,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-22 00:09:54,226 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-22 00:09:54,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:54,432 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2021-12-22 00:09:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 00:09:54,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 53 [2021-12-22 00:09:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:54,433 INFO L225 Difference]: With dead ends: 96 [2021-12-22 00:09:54,433 INFO L226 Difference]: Without dead ends: 96 [2021-12-22 00:09:54,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2021-12-22 00:09:54,434 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 157 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:54,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 211 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 12 Unchecked, 0.2s Time] [2021-12-22 00:09:54,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-22 00:09:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2021-12-22 00:09:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 81 states have internal predecessors, (85), 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-22 00:09:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2021-12-22 00:09:54,436 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 53 [2021-12-22 00:09:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:54,437 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2021-12-22 00:09:54,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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-22 00:09:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2021-12-22 00:09:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-12-22 00:09:54,438 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:54,438 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] [2021-12-22 00:09:54,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:54,647 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-22 00:09:54,647 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:54,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:54,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1735718260, now seen corresponding path program 1 times [2021-12-22 00:09:54,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:54,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737786705] [2021-12-22 00:09:54,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:54,648 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:54,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:54,649 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-22 00:09:54,650 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-22 00:09:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:54,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-22 00:09:54,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:54,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:09:55,222 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-22 00:09:55,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:55,223 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:55,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737786705] [2021-12-22 00:09:55,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737786705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:55,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:55,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 00:09:55,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865647362] [2021-12-22 00:09:55,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:55,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 00:09:55,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:55,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 00:09:55,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:09:55,226 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-22 00:09:55,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:55,474 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2021-12-22 00:09:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 00:09:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 53 [2021-12-22 00:09:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:55,480 INFO L225 Difference]: With dead ends: 88 [2021-12-22 00:09:55,480 INFO L226 Difference]: Without dead ends: 88 [2021-12-22 00:09:55,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-12-22 00:09:55,481 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 208 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:55,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 264 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 7 Unchecked, 0.2s Time] [2021-12-22 00:09:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-22 00:09:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2021-12-22 00:09:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 79 states have internal predecessors, (83), 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-22 00:09:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-12-22 00:09:55,484 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 53 [2021-12-22 00:09:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:55,484 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-12-22 00:09:55,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-22 00:09:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-12-22 00:09:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-22 00:09:55,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:55,485 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] [2021-12-22 00:09:55,498 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-22 00:09:55,697 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-22 00:09:55,698 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:55,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:55,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1579416181, now seen corresponding path program 1 times [2021-12-22 00:09:55,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:55,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68113154] [2021-12-22 00:09:55,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:55,699 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:55,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:55,700 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-22 00:09:55,701 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-22 00:09:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:55,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 00:09:55,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:55,998 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-22 00:09:55,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:55,998 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:55,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68113154] [2021-12-22 00:09:55,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68113154] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:55,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:55,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 00:09:55,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415141015] [2021-12-22 00:09:55,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:55,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 00:09:55,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:55,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 00:09:55,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-22 00:09:55,999 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (2), 1 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-22 00:09:56,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:56,051 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2021-12-22 00:09:56,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 00:09:56,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (2), 1 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 55 [2021-12-22 00:09:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:56,052 INFO L225 Difference]: With dead ends: 84 [2021-12-22 00:09:56,052 INFO L226 Difference]: Without dead ends: 84 [2021-12-22 00:09:56,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:09:56,053 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 158 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:56,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 268 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 00:09:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-12-22 00:09:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-22 00:09:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.1549295774647887) internal successors, (82), 79 states have internal predecessors, (82), 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-22 00:09:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2021-12-22 00:09:56,055 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 55 [2021-12-22 00:09:56,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:56,056 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2021-12-22 00:09:56,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 2 states have call successors, (2), 1 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-22 00:09:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2021-12-22 00:09:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 00:09:56,056 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:56,056 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] [2021-12-22 00:09:56,071 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-22 00:09:56,257 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-22 00:09:56,257 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:56,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:56,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1867081175, now seen corresponding path program 1 times [2021-12-22 00:09:56,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:56,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080491765] [2021-12-22 00:09:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:56,258 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:56,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:56,259 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-22 00:09:56,260 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-22 00:09:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:56,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-22 00:09:56,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:56,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:09:56,697 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-22 00:09:56,697 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:56,697 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:56,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080491765] [2021-12-22 00:09:56,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080491765] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:56,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:56,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 00:09:56,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263662642] [2021-12-22 00:09:56,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:56,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 00:09:56,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:56,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 00:09:56,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-22 00:09:56,699 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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-22 00:09:56,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:56,901 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2021-12-22 00:09:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 00:09:56,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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 59 [2021-12-22 00:09:56,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:56,903 INFO L225 Difference]: With dead ends: 88 [2021-12-22 00:09:56,903 INFO L226 Difference]: Without dead ends: 88 [2021-12-22 00:09:56,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-12-22 00:09:56,904 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 136 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:56,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 214 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2021-12-22 00:09:56,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-12-22 00:09:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2021-12-22 00:09:56,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.1267605633802817) internal successors, (80), 77 states have internal predecessors, (80), 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-22 00:09:56,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2021-12-22 00:09:56,911 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 59 [2021-12-22 00:09:56,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:56,911 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2021-12-22 00:09:56,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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-22 00:09:56,911 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2021-12-22 00:09:56,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-22 00:09:56,912 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:56,912 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] [2021-12-22 00:09:56,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-22 00:09:57,119 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-22 00:09:57,119 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1867081176, now seen corresponding path program 1 times [2021-12-22 00:09:57,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:57,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576938330] [2021-12-22 00:09:57,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:57,121 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:57,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:57,121 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-22 00:09:57,122 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-22 00:09:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:57,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-22 00:09:57,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:57,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-22 00:09:57,848 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-22 00:09:57,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:57,849 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:57,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576938330] [2021-12-22 00:09:57,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576938330] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:57,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:57,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 00:09:57,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817769409] [2021-12-22 00:09:57,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:57,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 00:09:57,850 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:57,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 00:09:57,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:09:57,851 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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-22 00:09:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:58,226 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2021-12-22 00:09:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 00:09:58,227 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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 59 [2021-12-22 00:09:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:58,228 INFO L225 Difference]: With dead ends: 86 [2021-12-22 00:09:58,228 INFO L226 Difference]: Without dead ends: 86 [2021-12-22 00:09:58,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2021-12-22 00:09:58,229 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 201 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:58,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 273 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 7 Unchecked, 0.2s Time] [2021-12-22 00:09:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-22 00:09:58,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2021-12-22 00:09:58,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 75 states have internal predecessors, (78), 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-22 00:09:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2021-12-22 00:09:58,231 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 59 [2021-12-22 00:09:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:58,231 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2021-12-22 00:09:58,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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-22 00:09:58,232 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2021-12-22 00:09:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-22 00:09:58,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:58,232 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-22 00:09:58,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:58,444 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-22 00:09:58,445 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1906105434, now seen corresponding path program 1 times [2021-12-22 00:09:58,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:58,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109805591] [2021-12-22 00:09:58,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:58,446 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:58,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:58,447 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-22 00:09:58,449 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-22 00:09:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 00:09:58,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-22 00:09:58,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 00:09:59,181 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-22 00:09:59,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 00:09:59,182 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-22 00:09:59,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109805591] [2021-12-22 00:09:59,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109805591] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 00:09:59,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 00:09:59,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 00:09:59,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547252350] [2021-12-22 00:09:59,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 00:09:59,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 00:09:59,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-22 00:09:59,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 00:09:59,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-12-22 00:09:59,183 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 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-22 00:09:59,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 00:09:59,451 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2021-12-22 00:09:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 00:09:59,462 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 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 62 [2021-12-22 00:09:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 00:09:59,463 INFO L225 Difference]: With dead ends: 85 [2021-12-22 00:09:59,463 INFO L226 Difference]: Without dead ends: 85 [2021-12-22 00:09:59,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2021-12-22 00:09:59,464 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 195 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 00:09:59,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 267 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2021-12-22 00:09:59,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-22 00:09:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2021-12-22 00:09:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 71 states have (on average 1.0845070422535212) internal successors, (77), 74 states have internal predecessors, (77), 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-22 00:09:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2021-12-22 00:09:59,468 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 62 [2021-12-22 00:09:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 00:09:59,469 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2021-12-22 00:09:59,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 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-22 00:09:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2021-12-22 00:09:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-12-22 00:09:59,469 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 00:09:59,470 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] [2021-12-22 00:09:59,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-22 00:09:59,683 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-22 00:09:59,683 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-22 00:09:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 00:09:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1899119549, now seen corresponding path program 1 times [2021-12-22 00:09:59,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-22 00:09:59,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386993113] [2021-12-22 00:09:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 00:09:59,684 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-22 00:09:59,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-22 00:09:59,685 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-22 00:09:59,690 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-22 00:10:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 00:10:00,127 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 00:10:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 00:10:00,458 INFO L133 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2021-12-22 00:10:00,459 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 00:10:00,460 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (24 of 25 remaining) [2021-12-22 00:10:00,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2021-12-22 00:10:00,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2021-12-22 00:10:00,461 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (21 of 25 remaining) [2021-12-22 00:10:00,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (20 of 25 remaining) [2021-12-22 00:10:00,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (19 of 25 remaining) [2021-12-22 00:10:00,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (18 of 25 remaining) [2021-12-22 00:10:00,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (17 of 25 remaining) [2021-12-22 00:10:00,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (16 of 25 remaining) [2021-12-22 00:10:00,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (15 of 25 remaining) [2021-12-22 00:10:00,462 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (14 of 25 remaining) [2021-12-22 00:10:00,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (13 of 25 remaining) [2021-12-22 00:10:00,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (12 of 25 remaining) [2021-12-22 00:10:00,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (11 of 25 remaining) [2021-12-22 00:10:00,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (10 of 25 remaining) [2021-12-22 00:10:00,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE (9 of 25 remaining) [2021-12-22 00:10:00,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE (8 of 25 remaining) [2021-12-22 00:10:00,463 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (7 of 25 remaining) [2021-12-22 00:10:00,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (6 of 25 remaining) [2021-12-22 00:10:00,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (5 of 25 remaining) [2021-12-22 00:10:00,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE (4 of 25 remaining) [2021-12-22 00:10:00,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (3 of 25 remaining) [2021-12-22 00:10:00,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION (2 of 25 remaining) [2021-12-22 00:10:00,464 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION (1 of 25 remaining) [2021-12-22 00:10:00,465 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION (0 of 25 remaining) [2021-12-22 00:10:00,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-12-22 00:10:00,684 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-22 00:10:00,687 INFO L732 BasicCegarLoop]: Path program 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-22 00:10:00,689 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 00:10:00,698 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,699 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,700 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,700 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,700 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,700 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,700 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,701 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,702 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,703 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,703 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,703 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,703 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,703 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,704 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,704 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,704 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,704 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,704 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,705 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,706 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,706 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,706 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,706 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,706 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,706 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,707 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,708 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,708 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,708 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,708 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,708 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,709 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,709 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,709 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,709 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,709 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,710 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,710 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,710 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,711 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,712 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,712 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,712 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,712 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,712 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,713 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,714 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,715 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,716 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,717 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,717 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,717 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,717 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,718 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,718 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,718 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,718 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,719 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,719 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,719 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,719 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,719 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,720 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,720 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,720 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,720 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,720 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,721 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,721 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,721 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,721 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,722 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,722 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,722 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,722 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,723 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,723 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,723 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,723 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,724 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,724 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,724 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,724 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,724 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,725 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,725 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,725 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,725 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,726 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,726 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,726 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,726 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,726 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,727 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,727 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,727 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,727 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,728 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,728 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,728 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,728 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,728 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,729 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,729 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,729 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,729 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,729 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,730 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,730 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,730 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,730 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,730 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,731 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,731 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,731 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,731 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,731 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,732 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,732 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,732 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2021-12-22 00:10:00,732 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2021-12-22 00:10:00,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 12:10:00 BoogieIcfgContainer [2021-12-22 00:10:00,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 00:10:00,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 00:10:00,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 00:10:00,766 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 00:10:00,767 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 12:09:40" (3/4) ... [2021-12-22 00:10:00,770 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-22 00:10:00,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 00:10:00,772 INFO L158 Benchmark]: Toolchain (without parser) took 21999.45ms. Allocated memory was 56.6MB in the beginning and 90.2MB in the end (delta: 33.6MB). Free memory was 34.3MB in the beginning and 30.3MB in the end (delta: 4.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2021-12-22 00:10:00,773 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 56.6MB. Free memory was 39.3MB in the beginning and 39.3MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 00:10:00,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 635.01ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 34.1MB in the beginning and 52.6MB in the end (delta: -18.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2021-12-22 00:10:00,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.07ms. Allocated memory is still 71.3MB. Free memory was 52.6MB in the beginning and 49.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 00:10:00,774 INFO L158 Benchmark]: Boogie Preprocessor took 30.68ms. Allocated memory is still 71.3MB. Free memory was 49.8MB in the beginning and 47.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 00:10:00,774 INFO L158 Benchmark]: RCFGBuilder took 684.34ms. Allocated memory is still 71.3MB. Free memory was 47.5MB in the beginning and 46.2MB in the end (delta: 1.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2021-12-22 00:10:00,774 INFO L158 Benchmark]: TraceAbstraction took 20582.95ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 45.9MB in the beginning and 31.2MB in the end (delta: 14.8MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2021-12-22 00:10:00,774 INFO L158 Benchmark]: Witness Printer took 5.80ms. Allocated memory is still 90.2MB. Free memory was 31.2MB in the beginning and 30.3MB in the end (delta: 878.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 00:10:00,776 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.27ms. Allocated memory is still 56.6MB. Free memory was 39.3MB in the beginning and 39.3MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 635.01ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 34.1MB in the beginning and 52.6MB in the end (delta: -18.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.07ms. Allocated memory is still 71.3MB. Free memory was 52.6MB in the beginning and 49.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.68ms. Allocated memory is still 71.3MB. Free memory was 49.8MB in the beginning and 47.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 684.34ms. Allocated memory is still 71.3MB. Free memory was 47.5MB in the beginning and 46.2MB in the end (delta: 1.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 20582.95ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 45.9MB in the beginning and 31.2MB in the end (delta: 14.8MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * Witness Printer took 5.80ms. Allocated memory is still 90.2MB. Free memory was 31.2MB in the beginning and 30.3MB in the end (delta: 878.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 763]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 763. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={1:0}] [L764] CALL entry_point() [L758] struct ldv_kobject *kobj; [L759] CALL, EXPR ldv_kobject_create() [L740] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={1:0}] [L741] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L741] RET, EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_global_msg_list={1:0}, ldv_malloc(sizeof(*kobj))={2:0}] [L741] kobj = ldv_malloc(sizeof(*kobj)) [L742] COND FALSE !(!kobj) [L744] FCALL memset(kobj, 0, sizeof(*kobj)) [L745] CALL ldv_kobject_init(kobj) [L730] COND FALSE !(!kobj) [L733] CALL ldv_kobject_init_internal(kobj) [L723] COND FALSE !(!kobj) [L725] CALL ldv_kref_init(&kobj->kref) [L682] ((&kref->refcount)->counter) = (1) VAL [kref={2:12}, kref={2:12}, ldv_global_msg_list={1:0}] [L725] RET ldv_kref_init(&kobj->kref) [L726] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [ldv_global_msg_list={1:0}, list={2:4}] [L540] list->next = list VAL [ldv_global_msg_list={1:0}, list={2:4}, list={2:4}] [L541] list->prev = list VAL [ldv_global_msg_list={1:0}, list={2:4}, list={2:4}] [L726] RET LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L733] RET ldv_kobject_init_internal(kobj) [L745] RET ldv_kobject_init(kobj) [L746] return kobj; VAL [\result={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L759] RET, EXPR ldv_kobject_create() [L759] kobj = ldv_kobject_create() [L760] CALL ldv_kobject_get(kobj) [L717] COND TRUE \read(*kobj) [L718] CALL ldv_kref_get(&kobj->kref) [L686] CALL ldv_atomic_add_return(1, (&kref->refcount)) [L657] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L658] EXPR v->counter VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}, v->counter=1] [L658] temp = v->counter [L659] temp += i VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=2, v={2:12}, v={2:12}] [L660] v->counter = temp VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=2, v={2:12}, v={2:12}] [L661] return temp; VAL [\old(i)=1, \result=2, i=1, ldv_global_msg_list={1:0}, temp=2, v={2:12}, v={2:12}] [L686] RET ldv_atomic_add_return(1, (&kref->refcount)) [L718] RET ldv_kref_get(&kobj->kref) [L719] return kobj; VAL [\result={2:0}, kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L760] RET ldv_kobject_get(kobj) [L761] CALL ldv_kobject_put(kobj) [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL, EXPR ldv_kref_sub(kref, 1, release) [L674] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L666] EXPR v->counter VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}, v->counter=2] [L666] temp = v->counter [L667] temp -= i VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=1, v={2:12}, v={2:12}] [L668] v->counter = temp VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=1, v={2:12}, v={2:12}] [L669] return temp; VAL [\old(i)=1, \result=1, i=1, ldv_global_msg_list={1:0}, temp=1, v={2:12}, v={2:12}] [L674] RET, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L674] COND FALSE !((ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0)) [L678] return 0; VAL [\old(count)=1, \result=0, count=1, kref={2:12}, kref={2:12}, ldv_global_msg_list={1:0}, release={-1:0}, release={-1:0}] [L690] RET, EXPR ldv_kref_sub(kref, 1, release) [L690] return ldv_kref_sub(kref, 1, release); [L712] RET ldv_kref_put(&kobj->kref, ldv_kobject_release) [L761] RET ldv_kobject_put(kobj) [L764] RET entry_point() - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 682]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 682]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 660]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 660]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 666]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 666]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 668]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 668]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 86 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 20.4s, OverallIterations: 27, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3734 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3728 mSDsluCounter, 9654 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 64 IncrementalHoareTripleChecker+Unchecked, 7513 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2741 IncrementalHoareTripleChecker+Invalid, 2922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 2141 mSDtfsCounter, 2741 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 940 GetRequests, 681 SyntacticMatches, 12 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=13, InterpolantAutomatonStates: 221, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 742 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 895 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 868 ConstructedInterpolants, 35 QuantifiedInterpolants, 4344 SizeOfPredicates, 204 NumberOfNonLiveVariables, 5233 ConjunctsInSsa, 354 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 1833/1965 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-22 00:10:00,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample