./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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/uthash-2.0.2/uthash_JEN_test3-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 f1f34940ecf685c2c1201858b264ccb53eb3034d3cb9952a1b49bb437c42dde1 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 08:49:56,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 08:49:56,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 08:49:57,029 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 08:49:57,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 08:49:57,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 08:49:57,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 08:49:57,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 08:49:57,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 08:49:57,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 08:49:57,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 08:49:57,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 08:49:57,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 08:49:57,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 08:49:57,049 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 08:49:57,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 08:49:57,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 08:49:57,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 08:49:57,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 08:49:57,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 08:49:57,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 08:49:57,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 08:49:57,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 08:49:57,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 08:49:57,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 08:49:57,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 08:49:57,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 08:49:57,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 08:49:57,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 08:49:57,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 08:49:57,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 08:49:57,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 08:49:57,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 08:49:57,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 08:49:57,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 08:49:57,082 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 08:49:57,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 08:49:57,083 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 08:49:57,083 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 08:49:57,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 08:49:57,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 08:49:57,085 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-16 08:49:57,109 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 08:49:57,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 08:49:57,110 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 08:49:57,110 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 08:49:57,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 08:49:57,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 08:49:57,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 08:49:57,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 08:49:57,112 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 08:49:57,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 08:49:57,113 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 08:49:57,113 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 08:49:57,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 08:49:57,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 08:49:57,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 08:49:57,114 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 08:49:57,114 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 08:49:57,114 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 08:49:57,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 08:49:57,115 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 08:49:57,115 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 08:49:57,115 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 08:49:57,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 08:49:57,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 08:49:57,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 08:49:57,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 08:49:57,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 08:49:57,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 08:49:57,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 08:49:57,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-16 08:49:57,116 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 08:49:57,117 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 -> f1f34940ecf685c2c1201858b264ccb53eb3034d3cb9952a1b49bb437c42dde1 [2021-12-16 08:49:57,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 08:49:57,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 08:49:57,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 08:49:57,316 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 08:49:57,317 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 08:49:57,319 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i [2021-12-16 08:49:57,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75e5245ef/63314f02c62449c3868a4de0fa4a8568/FLAG47d4df17d [2021-12-16 08:49:57,803 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 08:49:57,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i [2021-12-16 08:49:57,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75e5245ef/63314f02c62449c3868a4de0fa4a8568/FLAG47d4df17d [2021-12-16 08:49:58,169 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75e5245ef/63314f02c62449c3868a4de0fa4a8568 [2021-12-16 08:49:58,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 08:49:58,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 08:49:58,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 08:49:58,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 08:49:58,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 08:49:58,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:49:58" (1/1) ... [2021-12-16 08:49:58,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c80d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:49:58, skipping insertion in model container [2021-12-16 08:49:58,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:49:58" (1/1) ... [2021-12-16 08:49:58,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 08:49:58,247 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 08:49:58,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i[33021,33034] [2021-12-16 08:49:58,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i[44590,44603] [2021-12-16 08:49:58,633 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:49:58,640 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-16 08:49:58,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4729abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:49:58, skipping insertion in model container [2021-12-16 08:49:58,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 08:49:58,641 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-16 08:49:58,642 INFO L158 Benchmark]: Toolchain (without parser) took 468.71ms. Allocated memory is still 113.2MB. Free memory was 82.9MB in the beginning and 77.4MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-16 08:49:58,643 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 08:49:58,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.04ms. Allocated memory is still 113.2MB. Free memory was 82.6MB in the beginning and 77.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-16 08:49:58,644 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 113.2MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.04ms. Allocated memory is still 113.2MB. Free memory was 82.6MB in the beginning and 77.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 736]: 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/uthash-2.0.2/uthash_JEN_test3-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 f1f34940ecf685c2c1201858b264ccb53eb3034d3cb9952a1b49bb437c42dde1 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 08:50:00,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 08:50:00,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 08:50:00,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 08:50:00,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 08:50:00,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 08:50:00,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 08:50:00,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 08:50:00,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 08:50:00,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 08:50:00,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 08:50:00,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 08:50:00,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 08:50:00,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 08:50:00,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 08:50:00,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 08:50:00,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 08:50:00,174 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 08:50:00,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 08:50:00,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 08:50:00,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 08:50:00,178 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 08:50:00,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 08:50:00,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 08:50:00,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 08:50:00,182 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 08:50:00,182 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 08:50:00,182 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 08:50:00,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 08:50:00,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 08:50:00,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 08:50:00,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 08:50:00,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 08:50:00,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 08:50:00,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 08:50:00,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 08:50:00,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 08:50:00,187 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 08:50:00,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 08:50:00,188 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 08:50:00,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 08:50:00,189 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-16 08:50:00,207 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 08:50:00,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 08:50:00,209 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 08:50:00,209 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 08:50:00,211 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-16 08:50:00,211 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-16 08:50:00,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 08:50:00,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 08:50:00,213 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 08:50:00,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 08:50:00,213 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-16 08:50:00,214 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 08:50:00,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 08:50:00,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-16 08:50:00,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 08:50:00,214 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-16 08:50:00,214 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-16 08:50:00,214 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-16 08:50:00,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-16 08:50:00,215 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-16 08:50:00,215 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-16 08:50:00,215 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-16 08:50:00,215 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-16 08:50:00,215 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 08:50:00,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 08:50:00,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 08:50:00,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-16 08:50:00,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 08:50:00,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 08:50:00,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-16 08:50:00,216 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-16 08:50:00,216 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-16 08:50:00,217 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 08:50:00,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-16 08:50:00,217 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 -> f1f34940ecf685c2c1201858b264ccb53eb3034d3cb9952a1b49bb437c42dde1 [2021-12-16 08:50:00,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 08:50:00,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 08:50:00,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 08:50:00,522 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 08:50:00,526 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 08:50:00,527 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i [2021-12-16 08:50:00,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003e74987/0efe4e5b74564d4e8009cb24ecf9f6b1/FLAG8e6828eaa [2021-12-16 08:50:01,031 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 08:50:01,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i [2021-12-16 08:50:01,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003e74987/0efe4e5b74564d4e8009cb24ecf9f6b1/FLAG8e6828eaa [2021-12-16 08:50:01,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003e74987/0efe4e5b74564d4e8009cb24ecf9f6b1 [2021-12-16 08:50:01,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 08:50:01,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 08:50:01,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 08:50:01,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 08:50:01,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 08:50:01,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:50:01" (1/1) ... [2021-12-16 08:50:01,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f55408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:01, skipping insertion in model container [2021-12-16 08:50:01,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 08:50:01" (1/1) ... [2021-12-16 08:50:01,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 08:50:01,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 08:50:01,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i[33021,33034] [2021-12-16 08:50:01,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i[44590,44603] [2021-12-16 08:50:01,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:50:01,905 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-16 08:50:01,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 08:50:01,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i[33021,33034] [2021-12-16 08:50:02,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i[44590,44603] [2021-12-16 08:50:02,041 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:50:02,047 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 08:50:02,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i[33021,33034] [2021-12-16 08:50:02,107 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test3-1.i[44590,44603] [2021-12-16 08:50:02,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 08:50:02,139 INFO L208 MainTranslator]: Completed translation [2021-12-16 08:50:02,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:02 WrapperNode [2021-12-16 08:50:02,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 08:50:02,141 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 08:50:02,141 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 08:50:02,141 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 08:50:02,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:02" (1/1) ... [2021-12-16 08:50:02,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:02" (1/1) ... [2021-12-16 08:50:02,237 INFO L137 Inliner]: procedures = 180, calls = 285, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1041 [2021-12-16 08:50:02,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 08:50:02,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 08:50:02,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 08:50:02,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 08:50:02,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:02" (1/1) ... [2021-12-16 08:50:02,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:02" (1/1) ... [2021-12-16 08:50:02,270 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:02" (1/1) ... [2021-12-16 08:50:02,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:02" (1/1) ... [2021-12-16 08:50:02,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:02" (1/1) ... [2021-12-16 08:50:02,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:02" (1/1) ... [2021-12-16 08:50:02,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:02" (1/1) ... [2021-12-16 08:50:02,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 08:50:02,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 08:50:02,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 08:50:02,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 08:50:02,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:02" (1/1) ... [2021-12-16 08:50:02,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-16 08:50:02,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 08:50:02,363 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-16 08:50:02,416 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-16 08:50:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-16 08:50:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-16 08:50:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-16 08:50:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-16 08:50:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-16 08:50:02,426 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-16 08:50:02,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-16 08:50:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-16 08:50:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-16 08:50:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-16 08:50:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-16 08:50:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-16 08:50:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-16 08:50:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-16 08:50:02,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-16 08:50:02,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 08:50:02,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 08:50:02,580 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 08:50:02,581 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 08:50:02,583 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-16 08:50:05,567 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 08:50:05,582 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 08:50:05,584 INFO L301 CfgBuilder]: Removed 63 assume(true) statements. [2021-12-16 08:50:05,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:50:05 BoogieIcfgContainer [2021-12-16 08:50:05,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 08:50:05,588 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-16 08:50:05,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-16 08:50:05,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-16 08:50:05,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 08:50:01" (1/3) ... [2021-12-16 08:50:05,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70127cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:50:05, skipping insertion in model container [2021-12-16 08:50:05,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 08:50:02" (2/3) ... [2021-12-16 08:50:05,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70127cff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 08:50:05, skipping insertion in model container [2021-12-16 08:50:05,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 08:50:05" (3/3) ... [2021-12-16 08:50:05,594 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test3-1.i [2021-12-16 08:50:05,598 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-16 08:50:05,599 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 534 error locations. [2021-12-16 08:50:05,635 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-16 08:50:05,643 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-16 08:50:05,643 INFO L340 AbstractCegarLoop]: Starting to check reachability of 534 error locations. [2021-12-16 08:50:05,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 1072 states, 530 states have (on average 2.2452830188679247) internal successors, (1190), 1066 states have internal predecessors, (1190), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 08:50:05,678 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:05,678 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 08:50:05,678 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:05,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash 38794, now seen corresponding path program 1 times [2021-12-16 08:50:05,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:05,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574210478] [2021-12-16 08:50:05,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:05,691 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:05,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:05,693 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-16 08:50:05,735 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-16 08:50:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:05,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:50:05,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:05,927 INFO L388 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-16 08:50:05,934 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-16 08:50:05,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:05,935 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:05,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574210478] [2021-12-16 08:50:05,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574210478] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:05,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:05,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:50:05,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103877507] [2021-12-16 08:50:05,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:05,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:50:05,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:05,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:50:05,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:50:05,969 INFO L87 Difference]: Start difference. First operand has 1072 states, 530 states have (on average 2.2452830188679247) internal successors, (1190), 1066 states have internal predecessors, (1190), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:07,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:07,058 INFO L93 Difference]: Finished difference Result 1067 states and 1132 transitions. [2021-12-16 08:50:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:50:07,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-16 08:50:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:07,080 INFO L225 Difference]: With dead ends: 1067 [2021-12-16 08:50:07,080 INFO L226 Difference]: Without dead ends: 1065 [2021-12-16 08:50:07,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:50:07,089 INFO L933 BasicCegarLoop]: 648 mSDtfsCounter, 990 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:07,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [998 Valid, 705 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-16 08:50:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2021-12-16 08:50:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1057. [2021-12-16 08:50:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 530 states have (on average 2.0886792452830187) internal successors, (1107), 1051 states have internal predecessors, (1107), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1123 transitions. [2021-12-16 08:50:07,206 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1123 transitions. Word has length 3 [2021-12-16 08:50:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:07,207 INFO L470 AbstractCegarLoop]: Abstraction has 1057 states and 1123 transitions. [2021-12-16 08:50:07,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1123 transitions. [2021-12-16 08:50:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-16 08:50:07,208 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:07,208 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-16 08:50:07,217 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-16 08:50:07,414 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-16 08:50:07,415 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:07,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:07,416 INFO L85 PathProgramCache]: Analyzing trace with hash 38795, now seen corresponding path program 1 times [2021-12-16 08:50:07,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:07,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448451348] [2021-12-16 08:50:07,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:07,416 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:07,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:07,417 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-16 08:50:07,419 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-16 08:50:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:07,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:50:07,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:07,541 INFO L388 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-16 08:50:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:50:07,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:07,552 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:07,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448451348] [2021-12-16 08:50:07,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448451348] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:07,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:07,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:50:07,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717539042] [2021-12-16 08:50:07,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:07,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:50:07,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:07,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:50:07,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:50:07,560 INFO L87 Difference]: Start difference. First operand 1057 states and 1123 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:09,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:09,532 INFO L93 Difference]: Finished difference Result 1467 states and 1573 transitions. [2021-12-16 08:50:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:50:09,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-16 08:50:09,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:09,537 INFO L225 Difference]: With dead ends: 1467 [2021-12-16 08:50:09,537 INFO L226 Difference]: Without dead ends: 1467 [2021-12-16 08:50:09,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:50:09,538 INFO L933 BasicCegarLoop]: 933 mSDtfsCounter, 440 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:09,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 1522 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-16 08:50:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2021-12-16 08:50:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1257. [2021-12-16 08:50:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 731 states have (on average 2.0779753761969904) internal successors, (1519), 1251 states have internal predecessors, (1519), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1535 transitions. [2021-12-16 08:50:09,561 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1535 transitions. Word has length 3 [2021-12-16 08:50:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:09,562 INFO L470 AbstractCegarLoop]: Abstraction has 1257 states and 1535 transitions. [2021-12-16 08:50:09,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1535 transitions. [2021-12-16 08:50:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-16 08:50:09,562 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:09,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:09,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-16 08:50:09,769 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-16 08:50:09,769 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:09,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:09,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1466973012, now seen corresponding path program 1 times [2021-12-16 08:50:09,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:09,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861446780] [2021-12-16 08:50:09,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:09,771 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:09,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:09,772 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-16 08:50:09,773 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-16 08:50:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:09,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 08:50:09,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:09,904 INFO L388 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-16 08:50:09,908 INFO L388 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-16 08:50:09,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 08:50:09,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 08:50:09,959 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 08:50:09,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 08:50:09,981 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-16 08:50:09,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:09,981 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:09,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861446780] [2021-12-16 08:50:09,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861446780] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:09,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:09,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:50:09,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506641832] [2021-12-16 08:50:09,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:09,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:50:09,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:09,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:50:09,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:50:09,984 INFO L87 Difference]: Start difference. First operand 1257 states and 1535 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:11,532 INFO L93 Difference]: Finished difference Result 1258 states and 1538 transitions. [2021-12-16 08:50:11,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:50:11,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-16 08:50:11,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:11,537 INFO L225 Difference]: With dead ends: 1258 [2021-12-16 08:50:11,537 INFO L226 Difference]: Without dead ends: 1258 [2021-12-16 08:50:11,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-16 08:50:11,538 INFO L933 BasicCegarLoop]: 374 mSDtfsCounter, 2051 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2059 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:11,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2059 Valid, 409 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-16 08:50:11,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2021-12-16 08:50:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1046. [2021-12-16 08:50:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 530 states have (on average 2.0660377358490565) internal successors, (1095), 1040 states have internal predecessors, (1095), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1111 transitions. [2021-12-16 08:50:11,556 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1111 transitions. Word has length 7 [2021-12-16 08:50:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:11,556 INFO L470 AbstractCegarLoop]: Abstraction has 1046 states and 1111 transitions. [2021-12-16 08:50:11,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1111 transitions. [2021-12-16 08:50:11,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 08:50:11,557 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:11,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:11,568 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-16 08:50:11,768 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-16 08:50:11,769 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:11,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:11,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476910, now seen corresponding path program 1 times [2021-12-16 08:50:11,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:11,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740877911] [2021-12-16 08:50:11,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:11,771 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:11,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:11,772 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-16 08:50:11,774 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-16 08:50:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:11,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:50:11,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:11,893 INFO L388 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-16 08:50:11,906 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-16 08:50:11,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:11,907 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:11,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740877911] [2021-12-16 08:50:11,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740877911] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:11,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:11,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:50:11,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565221502] [2021-12-16 08:50:11,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:11,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:50:11,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:11,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:50:11,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:50:11,908 INFO L87 Difference]: Start difference. First operand 1046 states and 1111 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:13,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:13,138 INFO L93 Difference]: Finished difference Result 1373 states and 1467 transitions. [2021-12-16 08:50:13,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:50:13,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-16 08:50:13,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:13,142 INFO L225 Difference]: With dead ends: 1373 [2021-12-16 08:50:13,142 INFO L226 Difference]: Without dead ends: 1373 [2021-12-16 08:50:13,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:50:13,143 INFO L933 BasicCegarLoop]: 953 mSDtfsCounter, 990 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:13,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [998 Valid, 1198 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-16 08:50:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2021-12-16 08:50:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 997. [2021-12-16 08:50:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 530 states have (on average 1.9735849056603774) internal successors, (1046), 991 states have internal predecessors, (1046), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1062 transitions. [2021-12-16 08:50:13,162 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1062 transitions. Word has length 8 [2021-12-16 08:50:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:13,162 INFO L470 AbstractCegarLoop]: Abstraction has 997 states and 1062 transitions. [2021-12-16 08:50:13,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1062 transitions. [2021-12-16 08:50:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-16 08:50:13,163 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:13,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:13,183 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-16 08:50:13,370 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-16 08:50:13,370 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:13,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:13,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1768476909, now seen corresponding path program 1 times [2021-12-16 08:50:13,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:13,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905374082] [2021-12-16 08:50:13,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:13,372 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:13,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:13,373 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-16 08:50:13,392 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-16 08:50:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:13,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:50:13,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:13,506 INFO L388 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-16 08:50:13,526 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-16 08:50:13,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:13,527 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:13,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905374082] [2021-12-16 08:50:13,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905374082] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:13,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:13,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 08:50:13,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018573020] [2021-12-16 08:50:13,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:13,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:50:13,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:13,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:50:13,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:50:13,528 INFO L87 Difference]: Start difference. First operand 997 states and 1062 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:15,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:15,233 INFO L93 Difference]: Finished difference Result 1451 states and 1548 transitions. [2021-12-16 08:50:15,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:50:15,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-16 08:50:15,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:15,237 INFO L225 Difference]: With dead ends: 1451 [2021-12-16 08:50:15,237 INFO L226 Difference]: Without dead ends: 1451 [2021-12-16 08:50:15,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:50:15,237 INFO L933 BasicCegarLoop]: 1162 mSDtfsCounter, 673 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:15,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [673 Valid, 1601 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-16 08:50:15,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2021-12-16 08:50:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1019. [2021-12-16 08:50:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 562 states have (on average 1.9608540925266904) internal successors, (1102), 1013 states have internal predecessors, (1102), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1118 transitions. [2021-12-16 08:50:15,252 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1118 transitions. Word has length 8 [2021-12-16 08:50:15,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:15,253 INFO L470 AbstractCegarLoop]: Abstraction has 1019 states and 1118 transitions. [2021-12-16 08:50:15,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1118 transitions. [2021-12-16 08:50:15,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-16 08:50:15,254 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:15,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:15,273 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-16 08:50:15,460 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-16 08:50:15,461 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:15,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:15,462 INFO L85 PathProgramCache]: Analyzing trace with hash 871377621, now seen corresponding path program 1 times [2021-12-16 08:50:15,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:15,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418696265] [2021-12-16 08:50:15,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:15,462 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:15,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:15,463 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-16 08:50:15,465 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-16 08:50:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:15,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 08:50:15,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:15,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:50:15,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:15,641 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:15,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418696265] [2021-12-16 08:50:15,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418696265] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:15,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:15,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:50:15,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526278922] [2021-12-16 08:50:15,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:15,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:50:15,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:15,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:50:15,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:50:15,643 INFO L87 Difference]: Start difference. First operand 1019 states and 1118 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:16,065 INFO L93 Difference]: Finished difference Result 1469 states and 1601 transitions. [2021-12-16 08:50:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 08:50:16,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-16 08:50:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:16,069 INFO L225 Difference]: With dead ends: 1469 [2021-12-16 08:50:16,069 INFO L226 Difference]: Without dead ends: 1469 [2021-12-16 08:50:16,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-16 08:50:16,070 INFO L933 BasicCegarLoop]: 1114 mSDtfsCounter, 547 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:16,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 3019 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-16 08:50:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2021-12-16 08:50:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1259. [2021-12-16 08:50:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 802 states have (on average 1.9413965087281795) internal successors, (1557), 1253 states have internal predecessors, (1557), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:16,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 1573 transitions. [2021-12-16 08:50:16,107 INFO L78 Accepts]: Start accepts. Automaton has 1259 states and 1573 transitions. Word has length 11 [2021-12-16 08:50:16,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:16,107 INFO L470 AbstractCegarLoop]: Abstraction has 1259 states and 1573 transitions. [2021-12-16 08:50:16,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1259 states and 1573 transitions. [2021-12-16 08:50:16,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-16 08:50:16,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:16,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:16,117 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-16 08:50:16,315 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-16 08:50:16,315 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr532ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:16,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1242903717, now seen corresponding path program 1 times [2021-12-16 08:50:16,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:16,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377380500] [2021-12-16 08:50:16,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:16,318 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:16,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:16,319 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-16 08:50:16,339 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-16 08:50:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:16,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 08:50:16,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:16,465 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 08:50:16,467 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 08:50:16,468 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-16 08:50:16,507 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-12-16 08:50:16,507 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 36 [2021-12-16 08:50:16,560 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-16 08:50:16,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 23 [2021-12-16 08:50:16,579 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-16 08:50:16,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:16,580 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:16,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377380500] [2021-12-16 08:50:16,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377380500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:16,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:16,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:50:16,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511717300] [2021-12-16 08:50:16,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:16,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:50:16,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:16,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:50:16,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:50:16,582 INFO L87 Difference]: Start difference. First operand 1259 states and 1573 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:17,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:17,449 INFO L93 Difference]: Finished difference Result 1633 states and 2017 transitions. [2021-12-16 08:50:17,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:50:17,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-16 08:50:17,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:17,454 INFO L225 Difference]: With dead ends: 1633 [2021-12-16 08:50:17,454 INFO L226 Difference]: Without dead ends: 1633 [2021-12-16 08:50:17,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:50:17,456 INFO L933 BasicCegarLoop]: 1002 mSDtfsCounter, 373 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:17,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 2889 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-16 08:50:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2021-12-16 08:50:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1258. [2021-12-16 08:50:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 801 states have (on average 1.941323345817728) internal successors, (1555), 1252 states have internal predecessors, (1555), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1571 transitions. [2021-12-16 08:50:17,488 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1571 transitions. Word has length 12 [2021-12-16 08:50:17,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:17,488 INFO L470 AbstractCegarLoop]: Abstraction has 1258 states and 1571 transitions. [2021-12-16 08:50:17,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1571 transitions. [2021-12-16 08:50:17,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-16 08:50:17,489 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:17,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:17,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-16 08:50:17,696 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-16 08:50:17,697 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:17,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:17,697 INFO L85 PathProgramCache]: Analyzing trace with hash -344619170, now seen corresponding path program 1 times [2021-12-16 08:50:17,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:17,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445823916] [2021-12-16 08:50:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:17,698 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:17,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:17,703 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-16 08:50:17,747 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-16 08:50:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:17,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 08:50:17,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:17,876 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-16 08:50:17,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:17,877 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:17,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445823916] [2021-12-16 08:50:17,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1445823916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:17,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:17,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:50:17,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564345251] [2021-12-16 08:50:17,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:17,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-16 08:50:17,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:17,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 08:50:17,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:50:17,879 INFO L87 Difference]: Start difference. First operand 1258 states and 1571 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:17,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:17,906 INFO L93 Difference]: Finished difference Result 1198 states and 1485 transitions. [2021-12-16 08:50:17,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 08:50:17,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-16 08:50:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:17,909 INFO L225 Difference]: With dead ends: 1198 [2021-12-16 08:50:17,910 INFO L226 Difference]: Without dead ends: 1198 [2021-12-16 08:50:17,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 08:50:17,910 INFO L933 BasicCegarLoop]: 1005 mSDtfsCounter, 974 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:17,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [982 Valid, 1037 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:50:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2021-12-16 08:50:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1198. [2021-12-16 08:50:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1198 states, 765 states have (on average 1.9202614379084968) internal successors, (1469), 1192 states have internal predecessors, (1469), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1485 transitions. [2021-12-16 08:50:17,927 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1485 transitions. Word has length 18 [2021-12-16 08:50:17,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:17,927 INFO L470 AbstractCegarLoop]: Abstraction has 1198 states and 1485 transitions. [2021-12-16 08:50:17,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:17,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1485 transitions. [2021-12-16 08:50:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-16 08:50:17,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:17,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:17,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-16 08:50:18,135 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-16 08:50:18,138 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:18,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:18,139 INFO L85 PathProgramCache]: Analyzing trace with hash -466544200, now seen corresponding path program 1 times [2021-12-16 08:50:18,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:18,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [587486994] [2021-12-16 08:50:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:18,139 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:18,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:18,140 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-16 08:50:18,141 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-16 08:50:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:18,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:50:18,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:18,296 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-16 08:50:18,297 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:18,297 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:18,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [587486994] [2021-12-16 08:50:18,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [587486994] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:18,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:18,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:50:18,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956113304] [2021-12-16 08:50:18,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:18,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:50:18,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:18,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:50:18,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:50:18,299 INFO L87 Difference]: Start difference. First operand 1198 states and 1485 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:18,345 INFO L93 Difference]: Finished difference Result 1170 states and 1429 transitions. [2021-12-16 08:50:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:50:18,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-16 08:50:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:18,349 INFO L225 Difference]: With dead ends: 1170 [2021-12-16 08:50:18,349 INFO L226 Difference]: Without dead ends: 1170 [2021-12-16 08:50:18,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-16 08:50:18,349 INFO L933 BasicCegarLoop]: 960 mSDtfsCounter, 945 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:18,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 1945 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:50:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2021-12-16 08:50:18,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1168. [2021-12-16 08:50:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 749 states have (on average 1.883845126835781) internal successors, (1411), 1162 states have internal predecessors, (1411), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1427 transitions. [2021-12-16 08:50:18,364 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1427 transitions. Word has length 20 [2021-12-16 08:50:18,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:18,364 INFO L470 AbstractCegarLoop]: Abstraction has 1168 states and 1427 transitions. [2021-12-16 08:50:18,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1427 transitions. [2021-12-16 08:50:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 08:50:18,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:18,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:18,391 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-16 08:50:18,573 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-16 08:50:18,573 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:18,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:18,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531686, now seen corresponding path program 1 times [2021-12-16 08:50:18,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:18,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414023434] [2021-12-16 08:50:18,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:18,574 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:18,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:18,592 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-16 08:50:18,595 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-16 08:50:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:18,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:50:18,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:18,745 INFO L388 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-16 08:50:18,830 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-16 08:50:18,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:18,830 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:18,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414023434] [2021-12-16 08:50:18,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414023434] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:18,830 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:18,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:50:18,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272971388] [2021-12-16 08:50:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:18,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:50:18,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:18,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:50:18,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:50:18,831 INFO L87 Difference]: Start difference. First operand 1168 states and 1427 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:20,226 INFO L93 Difference]: Finished difference Result 1648 states and 2039 transitions. [2021-12-16 08:50:20,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 08:50:20,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-16 08:50:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:20,232 INFO L225 Difference]: With dead ends: 1648 [2021-12-16 08:50:20,232 INFO L226 Difference]: Without dead ends: 1648 [2021-12-16 08:50:20,232 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-16 08:50:20,232 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 1733 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:20,233 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1738 Valid, 1058 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-16 08:50:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2021-12-16 08:50:20,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1164. [2021-12-16 08:50:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 749 states have (on average 1.8731642189586115) internal successors, (1403), 1158 states have internal predecessors, (1403), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:20,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1419 transitions. [2021-12-16 08:50:20,246 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1419 transitions. Word has length 34 [2021-12-16 08:50:20,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:20,246 INFO L470 AbstractCegarLoop]: Abstraction has 1164 states and 1419 transitions. [2021-12-16 08:50:20,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:20,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1419 transitions. [2021-12-16 08:50:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-16 08:50:20,247 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:20,247 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:20,269 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-16 08:50:20,466 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-16 08:50:20,467 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:20,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:20,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2117531687, now seen corresponding path program 1 times [2021-12-16 08:50:20,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:20,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665271356] [2021-12-16 08:50:20,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:20,468 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:20,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:20,469 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-16 08:50:20,470 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-16 08:50:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:20,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 08:50:20,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:20,646 INFO L388 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-16 08:50:20,788 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-16 08:50:20,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:20,789 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:20,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665271356] [2021-12-16 08:50:20,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665271356] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:20,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:20,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:50:20,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091936510] [2021-12-16 08:50:20,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:20,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:50:20,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:20,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:50:20,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:50:20,791 INFO L87 Difference]: Start difference. First operand 1164 states and 1419 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:22,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:22,904 INFO L93 Difference]: Finished difference Result 1782 states and 2197 transitions. [2021-12-16 08:50:22,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-16 08:50:22,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-16 08:50:22,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:22,910 INFO L225 Difference]: With dead ends: 1782 [2021-12-16 08:50:22,910 INFO L226 Difference]: Without dead ends: 1782 [2021-12-16 08:50:22,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-16 08:50:22,910 INFO L933 BasicCegarLoop]: 1232 mSDtfsCounter, 1176 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 2136 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:22,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1181 Valid, 2136 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-16 08:50:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2021-12-16 08:50:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1160. [2021-12-16 08:50:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 749 states have (on average 1.8624833110814418) internal successors, (1395), 1154 states have internal predecessors, (1395), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1411 transitions. [2021-12-16 08:50:22,924 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1411 transitions. Word has length 34 [2021-12-16 08:50:22,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:22,924 INFO L470 AbstractCegarLoop]: Abstraction has 1160 states and 1411 transitions. [2021-12-16 08:50:22,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:22,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1411 transitions. [2021-12-16 08:50:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-16 08:50:22,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:22,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:22,933 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-16 08:50:23,133 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-16 08:50:23,134 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:23,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:23,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1509555205, now seen corresponding path program 1 times [2021-12-16 08:50:23,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:23,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223815731] [2021-12-16 08:50:23,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:23,135 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:23,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:23,136 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-16 08:50:23,138 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-16 08:50:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:23,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:50:23,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:23,396 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-16 08:50:23,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:23,396 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:23,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223815731] [2021-12-16 08:50:23,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223815731] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:23,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:23,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:50:23,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145347548] [2021-12-16 08:50:23,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:23,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:50:23,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:23,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:50:23,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:50:23,399 INFO L87 Difference]: Start difference. First operand 1160 states and 1411 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:23,435 INFO L93 Difference]: Finished difference Result 1148 states and 1391 transitions. [2021-12-16 08:50:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:50:23,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2021-12-16 08:50:23,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:23,438 INFO L225 Difference]: With dead ends: 1148 [2021-12-16 08:50:23,438 INFO L226 Difference]: Without dead ends: 1148 [2021-12-16 08:50:23,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-16 08:50:23,439 INFO L933 BasicCegarLoop]: 954 mSDtfsCounter, 921 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:23,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [929 Valid, 1923 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:50:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2021-12-16 08:50:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148. [2021-12-16 08:50:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 737 states have (on average 1.8656716417910448) internal successors, (1375), 1142 states have internal predecessors, (1375), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1391 transitions. [2021-12-16 08:50:23,454 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1391 transitions. Word has length 52 [2021-12-16 08:50:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:23,454 INFO L470 AbstractCegarLoop]: Abstraction has 1148 states and 1391 transitions. [2021-12-16 08:50:23,454 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1391 transitions. [2021-12-16 08:50:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-12-16 08:50:23,456 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:23,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:23,466 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-16 08:50:23,666 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-16 08:50:23,666 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:23,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:23,666 INFO L85 PathProgramCache]: Analyzing trace with hash -881686959, now seen corresponding path program 1 times [2021-12-16 08:50:23,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:23,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057660081] [2021-12-16 08:50:23,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:23,668 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:23,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:23,669 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-16 08:50:23,670 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-16 08:50:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:23,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 08:50:23,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:23,955 INFO L388 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-16 08:50:23,960 INFO L388 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-16 08:50:24,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-16 08:50:24,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-16 08:50:24,348 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 08:50:24,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 08:50:24,359 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-16 08:50:24,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:24,359 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:24,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057660081] [2021-12-16 08:50:24,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057660081] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:24,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:24,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 08:50:24,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215892940] [2021-12-16 08:50:24,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:24,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:50:24,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:24,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:50:24,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:50:24,361 INFO L87 Difference]: Start difference. First operand 1148 states and 1391 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:26,147 INFO L93 Difference]: Finished difference Result 1560 states and 1928 transitions. [2021-12-16 08:50:26,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:50:26,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-12-16 08:50:26,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:26,152 INFO L225 Difference]: With dead ends: 1560 [2021-12-16 08:50:26,152 INFO L226 Difference]: Without dead ends: 1560 [2021-12-16 08:50:26,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 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-16 08:50:26,153 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 2042 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2045 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:26,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2045 Valid, 522 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-16 08:50:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2021-12-16 08:50:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1078. [2021-12-16 08:50:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 705 states have (on average 1.8028368794326242) internal successors, (1271), 1072 states have internal predecessors, (1271), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1287 transitions. [2021-12-16 08:50:26,164 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1287 transitions. Word has length 60 [2021-12-16 08:50:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:26,164 INFO L470 AbstractCegarLoop]: Abstraction has 1078 states and 1287 transitions. [2021-12-16 08:50:26,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1287 transitions. [2021-12-16 08:50:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-16 08:50:26,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:26,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:26,175 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-16 08:50:26,374 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-16 08:50:26,375 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:26,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:26,376 INFO L85 PathProgramCache]: Analyzing trace with hash -855470841, now seen corresponding path program 1 times [2021-12-16 08:50:26,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:26,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517141345] [2021-12-16 08:50:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:26,376 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:26,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:26,377 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-16 08:50:26,379 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-16 08:50:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:26,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 08:50:26,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:26,671 INFO L388 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-16 08:50:26,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 08:50:26,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-16 08:50:26,708 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-16 08:50:26,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:26,708 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:26,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517141345] [2021-12-16 08:50:26,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517141345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:26,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:26,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:50:26,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327848646] [2021-12-16 08:50:26,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:26,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 08:50:26,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:26,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 08:50:26,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:50:26,710 INFO L87 Difference]: Start difference. First operand 1078 states and 1287 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:28,256 INFO L93 Difference]: Finished difference Result 1077 states and 1286 transitions. [2021-12-16 08:50:28,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 08:50:28,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-16 08:50:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:28,259 INFO L225 Difference]: With dead ends: 1077 [2021-12-16 08:50:28,259 INFO L226 Difference]: Without dead ends: 1077 [2021-12-16 08:50:28,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 08:50:28,260 INFO L933 BasicCegarLoop]: 914 mSDtfsCounter, 4 mSDsluCounter, 1443 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:28,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 2357 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-16 08:50:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2021-12-16 08:50:28,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1077. [2021-12-16 08:50:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 705 states have (on average 1.801418439716312) internal successors, (1270), 1071 states have internal predecessors, (1270), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1286 transitions. [2021-12-16 08:50:28,271 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1286 transitions. Word has length 65 [2021-12-16 08:50:28,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:28,272 INFO L470 AbstractCegarLoop]: Abstraction has 1077 states and 1286 transitions. [2021-12-16 08:50:28,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1286 transitions. [2021-12-16 08:50:28,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-16 08:50:28,273 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:28,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:28,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-16 08:50:28,483 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-16 08:50:28,483 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:28,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash -855470840, now seen corresponding path program 1 times [2021-12-16 08:50:28,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:28,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970293685] [2021-12-16 08:50:28,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:28,484 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:28,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:28,495 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-16 08:50:28,497 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-16 08:50:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:28,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-16 08:50:28,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:28,844 INFO L388 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-16 08:50:28,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 08:50:28,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 08:50:28,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-16 08:50:28,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-16 08:50:28,926 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-16 08:50:28,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:28,927 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:28,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970293685] [2021-12-16 08:50:28,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970293685] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:28,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:28,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:50:28,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040353366] [2021-12-16 08:50:28,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:28,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-16 08:50:28,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:28,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-16 08:50:28,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-16 08:50:28,929 INFO L87 Difference]: Start difference. First operand 1077 states and 1286 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:30,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:30,943 INFO L93 Difference]: Finished difference Result 1076 states and 1285 transitions. [2021-12-16 08:50:30,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 08:50:30,944 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-12-16 08:50:30,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:30,947 INFO L225 Difference]: With dead ends: 1076 [2021-12-16 08:50:30,947 INFO L226 Difference]: Without dead ends: 1076 [2021-12-16 08:50:30,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-16 08:50:30,947 INFO L933 BasicCegarLoop]: 914 mSDtfsCounter, 2 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:30,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2394 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-16 08:50:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2021-12-16 08:50:30,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1076. [2021-12-16 08:50:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 704 states have (on average 1.8025568181818181) internal successors, (1269), 1070 states have internal predecessors, (1269), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2021-12-16 08:50:30,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1285 transitions. [2021-12-16 08:50:30,957 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1285 transitions. Word has length 65 [2021-12-16 08:50:30,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:30,971 INFO L470 AbstractCegarLoop]: Abstraction has 1076 states and 1285 transitions. [2021-12-16 08:50:30,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 08:50:30,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1285 transitions. [2021-12-16 08:50:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-16 08:50:30,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:30,972 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:30,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-16 08:50:31,173 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-16 08:50:31,173 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:31,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:31,173 INFO L85 PathProgramCache]: Analyzing trace with hash 845908815, now seen corresponding path program 1 times [2021-12-16 08:50:31,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:31,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233802903] [2021-12-16 08:50:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:31,174 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:31,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:31,175 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-16 08:50:31,176 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-16 08:50:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:31,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 08:50:31,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:31,532 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-16 08:50:31,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 08:50:31,532 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:31,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233802903] [2021-12-16 08:50:31,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233802903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 08:50:31,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 08:50:31,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 08:50:31,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878413630] [2021-12-16 08:50:31,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 08:50:31,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-16 08:50:31,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:31,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 08:50:31,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 08:50:31,534 INFO L87 Difference]: Start difference. First operand 1076 states and 1285 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-16 08:50:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:31,581 INFO L93 Difference]: Finished difference Result 1079 states and 1289 transitions. [2021-12-16 08:50:31,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 08:50:31,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 73 [2021-12-16 08:50:31,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:31,589 INFO L225 Difference]: With dead ends: 1079 [2021-12-16 08:50:31,589 INFO L226 Difference]: Without dead ends: 1079 [2021-12-16 08:50:31,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 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-16 08:50:31,593 INFO L933 BasicCegarLoop]: 914 mSDtfsCounter, 2 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:31,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 2737 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-16 08:50:31,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2021-12-16 08:50:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2021-12-16 08:50:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 706 states have (on average 1.801699716713881) internal successors, (1272), 1073 states have internal predecessors, (1272), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-16 08:50:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1289 transitions. [2021-12-16 08:50:31,609 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1289 transitions. Word has length 73 [2021-12-16 08:50:31,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:31,610 INFO L470 AbstractCegarLoop]: Abstraction has 1079 states and 1289 transitions. [2021-12-16 08:50:31,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-16 08:50:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1289 transitions. [2021-12-16 08:50:31,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-16 08:50:31,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:31,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 08:50:31,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-16 08:50:31,821 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-16 08:50:31,821 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1432329570, now seen corresponding path program 1 times [2021-12-16 08:50:31,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:31,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559774593] [2021-12-16 08:50:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 08:50:31,822 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:31,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:31,836 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-16 08:50:31,837 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-16 08:50:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 08:50:32,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 08:50:32,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:32,179 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-16 08:50:32,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:50:32,296 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-16 08:50:32,296 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:32,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559774593] [2021-12-16 08:50:32,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559774593] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:50:32,296 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:50:32,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-16 08:50:32,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698541887] [2021-12-16 08:50:32,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:50:32,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-16 08:50:32,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:32,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 08:50:32,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-16 08:50:32,298 INFO L87 Difference]: Start difference. First operand 1079 states and 1289 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:50:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:32,416 INFO L93 Difference]: Finished difference Result 1091 states and 1306 transitions. [2021-12-16 08:50:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 08:50:32,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2021-12-16 08:50:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:32,419 INFO L225 Difference]: With dead ends: 1091 [2021-12-16 08:50:32,419 INFO L226 Difference]: Without dead ends: 1091 [2021-12-16 08:50:32,419 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2021-12-16 08:50:32,420 INFO L933 BasicCegarLoop]: 915 mSDtfsCounter, 12 mSDsluCounter, 5459 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6374 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:32,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 6374 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-16 08:50:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2021-12-16 08:50:32,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 1089. [2021-12-16 08:50:32,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 715 states have (on average 1.8) internal successors, (1287), 1082 states have internal predecessors, (1287), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-16 08:50:32,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1304 transitions. [2021-12-16 08:50:32,429 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1304 transitions. Word has length 74 [2021-12-16 08:50:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:32,429 INFO L470 AbstractCegarLoop]: Abstraction has 1089 states and 1304 transitions. [2021-12-16 08:50:32,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:50:32,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1304 transitions. [2021-12-16 08:50:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-16 08:50:32,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:32,430 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:50:32,439 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-16 08:50:32,630 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-16 08:50:32,631 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:32,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1474885647, now seen corresponding path program 2 times [2021-12-16 08:50:32,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:32,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370216697] [2021-12-16 08:50:32,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 08:50:32,632 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:32,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:32,633 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-16 08:50:32,634 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-16 08:50:33,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 08:50:33,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:50:33,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 08:50:33,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:33,169 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-16 08:50:33,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:50:33,365 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-16 08:50:33,365 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:33,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370216697] [2021-12-16 08:50:33,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370216697] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:50:33,365 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:50:33,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-16 08:50:33,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156786764] [2021-12-16 08:50:33,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:50:33,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-16 08:50:33,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:33,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 08:50:33,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-16 08:50:33,366 INFO L87 Difference]: Start difference. First operand 1089 states and 1304 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:50:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:33,817 INFO L93 Difference]: Finished difference Result 1110 states and 1332 transitions. [2021-12-16 08:50:33,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-16 08:50:33,818 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2021-12-16 08:50:33,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:33,821 INFO L225 Difference]: With dead ends: 1110 [2021-12-16 08:50:33,821 INFO L226 Difference]: Without dead ends: 1106 [2021-12-16 08:50:33,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2021-12-16 08:50:33,822 INFO L933 BasicCegarLoop]: 918 mSDtfsCounter, 59 mSDsluCounter, 4574 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 5492 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:33,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 5492 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-16 08:50:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2021-12-16 08:50:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1098. [2021-12-16 08:50:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 724 states have (on average 1.7941988950276244) internal successors, (1299), 1091 states have internal predecessors, (1299), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-16 08:50:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1316 transitions. [2021-12-16 08:50:33,832 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1316 transitions. Word has length 77 [2021-12-16 08:50:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:33,832 INFO L470 AbstractCegarLoop]: Abstraction has 1098 states and 1316 transitions. [2021-12-16 08:50:33,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:50:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1316 transitions. [2021-12-16 08:50:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-16 08:50:33,833 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:33,833 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:50:33,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-16 08:50:34,044 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-16 08:50:34,044 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:34,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:34,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1848370991, now seen corresponding path program 3 times [2021-12-16 08:50:34,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:34,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997635126] [2021-12-16 08:50:34,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 08:50:34,045 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:34,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:34,046 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-16 08:50:34,048 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-16 08:50:34,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-16 08:50:34,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:50:34,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 08:50:34,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:34,912 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-16 08:50:34,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:50:35,501 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-16 08:50:35,502 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:35,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997635126] [2021-12-16 08:50:35,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997635126] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:50:35,502 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:50:35,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-16 08:50:35,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246743881] [2021-12-16 08:50:35,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:50:35,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-16 08:50:35,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:35,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-16 08:50:35,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2021-12-16 08:50:35,503 INFO L87 Difference]: Start difference. First operand 1098 states and 1316 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:50:38,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:38,089 INFO L93 Difference]: Finished difference Result 1140 states and 1378 transitions. [2021-12-16 08:50:38,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-16 08:50:38,089 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2021-12-16 08:50:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:38,093 INFO L225 Difference]: With dead ends: 1140 [2021-12-16 08:50:38,093 INFO L226 Difference]: Without dead ends: 1134 [2021-12-16 08:50:38,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2021-12-16 08:50:38,094 INFO L933 BasicCegarLoop]: 923 mSDtfsCounter, 178 mSDsluCounter, 11018 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 11941 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:38,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 11941 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-16 08:50:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2021-12-16 08:50:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1116. [2021-12-16 08:50:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 742 states have (on average 1.7816711590296497) internal successors, (1322), 1109 states have internal predecessors, (1322), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-16 08:50:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1339 transitions. [2021-12-16 08:50:38,121 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1339 transitions. Word has length 83 [2021-12-16 08:50:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:38,122 INFO L470 AbstractCegarLoop]: Abstraction has 1116 states and 1339 transitions. [2021-12-16 08:50:38,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:50:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1339 transitions. [2021-12-16 08:50:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-16 08:50:38,122 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:38,122 INFO L514 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:50:38,149 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-16 08:50:38,334 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-16 08:50:38,334 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:38,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1078182545, now seen corresponding path program 4 times [2021-12-16 08:50:38,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:38,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840740166] [2021-12-16 08:50:38,336 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 08:50:38,336 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:38,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:38,352 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-16 08:50:38,353 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-16 08:50:38,661 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 08:50:38,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:50:38,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 08:50:38,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:50:39,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:50:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 08:50:40,522 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:40,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840740166] [2021-12-16 08:50:40,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840740166] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 08:50:40,522 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 08:50:40,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2021-12-16 08:50:40,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833848731] [2021-12-16 08:50:40,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 08:50:40,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-16 08:50:40,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-16 08:50:40,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-16 08:50:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2021-12-16 08:50:40,524 INFO L87 Difference]: Start difference. First operand 1116 states and 1339 transitions. Second operand has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:50:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 08:50:50,169 INFO L93 Difference]: Finished difference Result 1196 states and 1451 transitions. [2021-12-16 08:50:50,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-12-16 08:50:50,170 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2021-12-16 08:50:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-16 08:50:50,173 INFO L225 Difference]: With dead ends: 1196 [2021-12-16 08:50:50,173 INFO L226 Difference]: Without dead ends: 1192 [2021-12-16 08:50:50,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2021-12-16 08:50:50,175 INFO L933 BasicCegarLoop]: 935 mSDtfsCounter, 368 mSDsluCounter, 24143 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 25078 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-16 08:50:50,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 25078 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2021-12-16 08:50:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2021-12-16 08:50:50,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1150. [2021-12-16 08:50:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 776 states have (on average 1.7628865979381443) internal successors, (1368), 1143 states have internal predecessors, (1368), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-16 08:50:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1385 transitions. [2021-12-16 08:50:50,188 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1385 transitions. Word has length 95 [2021-12-16 08:50:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-16 08:50:50,188 INFO L470 AbstractCegarLoop]: Abstraction has 1150 states and 1385 transitions. [2021-12-16 08:50:50,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.36) internal successors, (118), 50 states have internal predecessors, (118), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-16 08:50:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1385 transitions. [2021-12-16 08:50:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2021-12-16 08:50:50,189 INFO L506 BasicCegarLoop]: Found error trace [2021-12-16 08:50:50,189 INFO L514 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:50:50,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-12-16 08:50:50,402 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-16 08:50:50,402 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 530 more)] === [2021-12-16 08:50:50,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 08:50:50,403 INFO L85 PathProgramCache]: Analyzing trace with hash 869177231, now seen corresponding path program 5 times [2021-12-16 08:50:50,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-16 08:50:50,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729296248] [2021-12-16 08:50:50,404 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 08:50:50,404 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-16 08:50:50,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-16 08:50:50,405 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-16 08:50:50,408 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-16 08:50:51,634 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-16 08:50:51,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 08:50:51,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 109 conjunts are in the unsatisfiable core [2021-12-16 08:50:51,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 08:50:51,688 INFO L388 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-16 08:50:51,810 INFO L388 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-16 08:50:51,818 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-16 08:50:51,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-16 08:50:51,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 08:50:51,844 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-16 08:50:51,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-16 08:50:51,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2021-12-16 08:50:52,031 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1881 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1881))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1880 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1880)))) is different from true [2021-12-16 08:50:52,043 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1882 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1882))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1883 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1883)))) is different from true [2021-12-16 08:50:52,055 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1885 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1885))) (exists ((v_ArrVal_1884 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1884)))) is different from true [2021-12-16 08:50:52,183 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1895 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1895))) (exists ((v_ArrVal_1894 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1894))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:50:52,195 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1896 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1896))) (exists ((v_ArrVal_1897 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1897)))) is different from true [2021-12-16 08:50:52,297 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1902 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1902))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1903 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1903)))) is different from true [2021-12-16 08:50:52,331 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1906 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1906))) (exists ((v_ArrVal_1907 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1907)))) is different from true [2021-12-16 08:50:52,341 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1908 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1908))) (exists ((v_ArrVal_1909 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1909)))) is different from true [2021-12-16 08:50:52,363 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1911 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1911))) (exists ((v_ArrVal_1910 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1910))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:50:52,398 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1915))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1914)))) is different from true [2021-12-16 08:50:52,409 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1916))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1917)))) is different from true [2021-12-16 08:50:52,420 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1919 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1919))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1918)))) is different from true [2021-12-16 08:50:52,431 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1920 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1920))) (exists ((v_ArrVal_1921 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1921))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:50:52,451 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1923 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1923))) (exists ((v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1922))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:50:52,482 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1927 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1927))) (exists ((v_ArrVal_1926 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1926)))) is different from true [2021-12-16 08:50:52,492 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1929 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1929))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1928 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1928)))) is different from true [2021-12-16 08:50:52,502 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1930 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1930))) (exists ((v_ArrVal_1931 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1931))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:50:52,513 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1933 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1933))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1932 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1932)))) is different from true [2021-12-16 08:50:52,523 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1935 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1935))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1934 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1934)))) is different from true [2021-12-16 08:50:52,575 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1941))) (exists ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1940)))) is different from true [2021-12-16 08:50:52,585 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1943 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1943))) (exists ((v_ArrVal_1942 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1942))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32)))) is different from true [2021-12-16 08:50:52,638 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1948 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1948))) (exists ((v_ArrVal_1949 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1949)))) is different from true [2021-12-16 08:50:52,669 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1953 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1953))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1952 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1952)))) is different from true [2021-12-16 08:50:52,744 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1960 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1960))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1961 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1961)))) is different from true [2021-12-16 08:50:52,754 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1963 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1963))) (exists ((v_arrayElimCell_16 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_16) (_ bv44 32))) (exists ((v_ArrVal_1962 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1962)))) is different from true [2021-12-16 08:50:52,811 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-16 08:50:52,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-16 08:50:52,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-16 08:50:52,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-16 08:50:52,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-16 08:50:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 171 trivial. 800 not checked. [2021-12-16 08:50:52,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 08:50:53,420 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2056 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2056) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_2057 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32)))))) is different from false [2021-12-16 08:50:53,426 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-16 08:50:53,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729296248] [2021-12-16 08:50:53,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729296248] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 08:50:53,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1455210499] [2021-12-16 08:50:53,426 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 08:50:53,427 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-16 08:50:53,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-16 08:50:53,429 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-16 08:50:53,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process