./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version e19ca921
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-e19ca92
[2021-12-22 16:32:57,568 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-12-22 16:32:57,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-12-22 16:32:57,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-12-22 16:32:57,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-12-22 16:32:57,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-12-22 16:32:57,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-12-22 16:32:57,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-12-22 16:32:57,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-12-22 16:32:57,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-12-22 16:32:57,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-12-22 16:32:57,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-12-22 16:32:57,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-12-22 16:32:57,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-12-22 16:32:57,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-12-22 16:32:57,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-12-22 16:32:57,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-12-22 16:32:57,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-12-22 16:32:57,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-12-22 16:32:57,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-12-22 16:32:57,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-12-22 16:32:57,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-12-22 16:32:57,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-12-22 16:32:57,666 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-12-22 16:32:57,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-12-22 16:32:57,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-12-22 16:32:57,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-12-22 16:32:57,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-12-22 16:32:57,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-12-22 16:32:57,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-12-22 16:32:57,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-12-22 16:32:57,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-12-22 16:32:57,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-12-22 16:32:57,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-12-22 16:32:57,676 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-12-22 16:32:57,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-12-22 16:32:57,677 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-12-22 16:32:57,677 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-12-22 16:32:57,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-12-22 16:32:57,678 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-12-22 16:32:57,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-12-22 16:32:57,680 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2021-12-22 16:32:57,701 INFO L113 SettingsManager]: Loading preferences was successful
[2021-12-22 16:32:57,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-12-22 16:32:57,701 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-12-22 16:32:57,702 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-12-22 16:32:57,702 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2021-12-22 16:32:57,702 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2021-12-22 16:32:57,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-12-22 16:32:57,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-12-22 16:32:57,703 INFO L138 SettingsManager]: * Use SBE=true
[2021-12-22 16:32:57,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-12-22 16:32:57,703 INFO L138 SettingsManager]: * sizeof long=4
[2021-12-22 16:32:57,703 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2021-12-22 16:32:57,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-12-22 16:32:57,704 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-12-22 16:32:57,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-12-22 16:32:57,704 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2021-12-22 16:32:57,704 INFO L138 SettingsManager]: * Bitprecise bitfields=true
[2021-12-22 16:32:57,704 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2021-12-22 16:32:57,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-12-22 16:32:57,705 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2021-12-22 16:32:57,705 INFO L138 SettingsManager]: * sizeof long double=12
[2021-12-22 16:32:57,705 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-12-22 16:32:57,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-12-22 16:32:57,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-12-22 16:32:57,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-12-22 16:32:57,706 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-22 16:32:57,706 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-12-22 16:32:57,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-12-22 16:32:57,706 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-12-22 16:32:57,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-12-22 16:32:57,707 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-12-22 16:32:57,707 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 -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f
[2021-12-22 16:32:57,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-12-22 16:32:57,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-12-22 16:32:57,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-12-22 16:32:57,909 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-12-22 16:32:57,909 INFO L275 PluginConnector]: CDTParser initialized
[2021-12-22 16:32:57,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i
[2021-12-22 16:32:57,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728ad86dc/27385c9a8a094ddc886a1e94b356c184/FLAG7fae8485f
[2021-12-22 16:32:58,313 INFO L306 CDTParser]: Found 1 translation units.
[2021-12-22 16:32:58,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i
[2021-12-22 16:32:58,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728ad86dc/27385c9a8a094ddc886a1e94b356c184/FLAG7fae8485f
[2021-12-22 16:32:58,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/728ad86dc/27385c9a8a094ddc886a1e94b356c184
[2021-12-22 16:32:58,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-12-22 16:32:58,732 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2021-12-22 16:32:58,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-12-22 16:32:58,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-12-22 16:32:58,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-12-22 16:32:58,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:32:58" (1/1) ...
[2021-12-22 16:32:58,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a5197cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:58, skipping insertion in model container
[2021-12-22 16:32:58,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:32:58" (1/1) ...
[2021-12-22 16:32:58,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-12-22 16:32:58,776 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-12-22 16:32:58,954 INFO L209 PostProcessor]: Analyzing one entry point: main
[2021-12-22 16:32:58,962 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation)
[2021-12-22 16:32:58,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@9bdcf68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:32:58, skipping insertion in model container
[2021-12-22 16:32:58,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-12-22 16:32:58,964 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner
[2021-12-22 16:32:58,966 INFO L158 Benchmark]: Toolchain (without parser) took 232.53ms. Allocated memory is still 104.9MB. Free memory was 78.9MB in the beginning and 80.4MB in the end (delta: -1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2021-12-22 16:32:58,966 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory was 62.9MB in the beginning and 62.8MB in the end (delta: 51.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2021-12-22 16:32:58,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.54ms. Allocated memory is still 104.9MB. Free memory was 78.9MB in the beginning and 80.4MB in the end (delta: -1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2021-12-22 16:32:58,967 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.16ms. Allocated memory is still 104.9MB. Free memory was 62.9MB in the beginning and 62.8MB in the end (delta: 51.1kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 229.54ms. Allocated memory is still 104.9MB. Free memory was 78.9MB in the beginning and 80.4MB in the end (delta: -1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- UnsupportedSyntaxResult [Line: 556]: 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/memsafety-ext2/complex_data_creation_test01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) )
CHECK( init(main()), LTL(G valid-deref) )
CHECK( init(main()), LTL(G valid-memtrack) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-e19ca92
[2021-12-22 16:33:00,464 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-12-22 16:33:00,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-12-22 16:33:00,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-12-22 16:33:00,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-12-22 16:33:00,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-12-22 16:33:00,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-12-22 16:33:00,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-12-22 16:33:00,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-12-22 16:33:00,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-12-22 16:33:00,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-12-22 16:33:00,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-12-22 16:33:00,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-12-22 16:33:00,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-12-22 16:33:00,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-12-22 16:33:00,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-12-22 16:33:00,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-12-22 16:33:00,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-12-22 16:33:00,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-12-22 16:33:00,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-12-22 16:33:00,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-12-22 16:33:00,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-12-22 16:33:00,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-12-22 16:33:00,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-12-22 16:33:00,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-12-22 16:33:00,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-12-22 16:33:00,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-12-22 16:33:00,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-12-22 16:33:00,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-12-22 16:33:00,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-12-22 16:33:00,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-12-22 16:33:00,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-12-22 16:33:00,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-12-22 16:33:00,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-12-22 16:33:00,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-12-22 16:33:00,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-12-22 16:33:00,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-12-22 16:33:00,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-12-22 16:33:00,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-12-22 16:33:00,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-12-22 16:33:00,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-12-22 16:33:00,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2021-12-22 16:33:00,554 INFO L113 SettingsManager]: Loading preferences was successful
[2021-12-22 16:33:00,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-12-22 16:33:00,555 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-12-22 16:33:00,555 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-12-22 16:33:00,556 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2021-12-22 16:33:00,556 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2021-12-22 16:33:00,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-12-22 16:33:00,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-12-22 16:33:00,557 INFO L138 SettingsManager]: * Use SBE=true
[2021-12-22 16:33:00,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-12-22 16:33:00,557 INFO L138 SettingsManager]: * sizeof long=4
[2021-12-22 16:33:00,557 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2021-12-22 16:33:00,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-12-22 16:33:00,557 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-12-22 16:33:00,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-12-22 16:33:00,558 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2021-12-22 16:33:00,558 INFO L138 SettingsManager]: * Bitprecise bitfields=true
[2021-12-22 16:33:00,558 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2021-12-22 16:33:00,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-12-22 16:33:00,559 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2021-12-22 16:33:00,559 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true
[2021-12-22 16:33:00,559 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2021-12-22 16:33:00,559 INFO L138 SettingsManager]: * sizeof long double=12
[2021-12-22 16:33:00,559 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-12-22 16:33:00,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-12-22 16:33:00,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-12-22 16:33:00,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-12-22 16:33:00,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-22 16:33:00,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-12-22 16:33:00,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-12-22 16:33:00,561 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF
[2021-12-22 16:33:00,561 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2021-12-22 16:33:00,561 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-12-22 16:33:00,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2021-12-22 16:33:00,561 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 -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f
[2021-12-22 16:33:00,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-12-22 16:33:00,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-12-22 16:33:00,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-12-22 16:33:00,828 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-12-22 16:33:00,829 INFO L275 PluginConnector]: CDTParser initialized
[2021-12-22 16:33:00,831 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i
[2021-12-22 16:33:00,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559e0f4c1/7befde31778a432ab6acf1b7fb7f79b4/FLAG95721fd1e
[2021-12-22 16:33:01,295 INFO L306 CDTParser]: Found 1 translation units.
[2021-12-22 16:33:01,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i
[2021-12-22 16:33:01,309 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559e0f4c1/7befde31778a432ab6acf1b7fb7f79b4/FLAG95721fd1e
[2021-12-22 16:33:01,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/559e0f4c1/7befde31778a432ab6acf1b7fb7f79b4
[2021-12-22 16:33:01,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-12-22 16:33:01,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2021-12-22 16:33:01,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-12-22 16:33:01,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-12-22 16:33:01,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-12-22 16:33:01,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:33:01" (1/1) ...
[2021-12-22 16:33:01,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5780541a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01, skipping insertion in model container
[2021-12-22 16:33:01,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 04:33:01" (1/1) ...
[2021-12-22 16:33:01,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-12-22 16:33:01,375 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-12-22 16:33:01,646 INFO L209 PostProcessor]: Analyzing one entry point: main
[2021-12-22 16:33:01,657 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution]
[2021-12-22 16:33:01,663 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-12-22 16:33:01,698 INFO L209 PostProcessor]: Analyzing one entry point: main
[2021-12-22 16:33:01,708 INFO L203 MainTranslator]: Completed pre-run
[2021-12-22 16:33:01,740 INFO L209 PostProcessor]: Analyzing one entry point: main
[2021-12-22 16:33:01,765 INFO L208 MainTranslator]: Completed translation
[2021-12-22 16:33:01,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01 WrapperNode
[2021-12-22 16:33:01,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-12-22 16:33:01,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-12-22 16:33:01,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-12-22 16:33:01,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-12-22 16:33:01,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01" (1/1) ...
[2021-12-22 16:33:01,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01" (1/1) ...
[2021-12-22 16:33:01,810 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98
[2021-12-22 16:33:01,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-12-22 16:33:01,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-12-22 16:33:01,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-12-22 16:33:01,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-12-22 16:33:01,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01" (1/1) ...
[2021-12-22 16:33:01,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01" (1/1) ...
[2021-12-22 16:33:01,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01" (1/1) ...
[2021-12-22 16:33:01,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01" (1/1) ...
[2021-12-22 16:33:01,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01" (1/1) ...
[2021-12-22 16:33:01,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01" (1/1) ...
[2021-12-22 16:33:01,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01" (1/1) ...
[2021-12-22 16:33:01,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-12-22 16:33:01,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-12-22 16:33:01,841 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-12-22 16:33:01,841 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-12-22 16:33:01,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01" (1/1) ...
[2021-12-22 16:33:01,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-12-22 16:33:01,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2021-12-22 16:33:01,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:01,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2021-12-22 16:33:01,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4
[2021-12-22 16:33:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2021-12-22 16:33:01,923 INFO L130 BoogieDeclarations]: Found specification of procedure create_data
[2021-12-22 16:33:01,924 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data
[2021-12-22 16:33:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2021-12-22 16:33:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-12-22 16:33:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2021-12-22 16:33:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2021-12-22 16:33:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-12-22 16:33:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2021-12-22 16:33:01,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2021-12-22 16:33:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2021-12-22 16:33:01,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-12-22 16:33:01,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-12-22 16:33:02,018 INFO L234 CfgBuilder]: Building ICFG
[2021-12-22 16:33:02,019 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2021-12-22 16:33:02,605 INFO L275 CfgBuilder]: Performing block encoding
[2021-12-22 16:33:02,610 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-12-22 16:33:02,610 INFO L299 CfgBuilder]: Removed 4 assume(true) statements.
[2021-12-22 16:33:02,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:33:02 BoogieIcfgContainer
[2021-12-22 16:33:02,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-12-22 16:33:02,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-12-22 16:33:02,613 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-12-22 16:33:02,614 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-12-22 16:33:02,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 04:33:01" (1/3) ...
[2021-12-22 16:33:02,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfaad7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:33:02, skipping insertion in model container
[2021-12-22 16:33:02,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 04:33:01" (2/3) ...
[2021-12-22 16:33:02,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfaad7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 04:33:02, skipping insertion in model container
[2021-12-22 16:33:02,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 04:33:02" (3/3) ...
[2021-12-22 16:33:02,616 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i
[2021-12-22 16:33:02,620 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-12-22 16:33:02,620 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations.
[2021-12-22 16:33:02,653 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2021-12-22 16:33:02,659 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR
[2021-12-22 16:33:02,660 INFO L340 AbstractCegarLoop]: Starting to check reachability of 92 error locations.
[2021-12-22 16:33:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2021-12-22 16:33:02,682 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:02,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2021-12-22 16:33:02,682 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:02,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:02,686 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times
[2021-12-22 16:33:02,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:02,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789330709]
[2021-12-22 16:33:02,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 16:33:02,695 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:02,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:02,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:02,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2021-12-22 16:33:02,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 16:33:02,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core
[2021-12-22 16:33:02,776 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:02,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2021-12-22 16:33:02,864 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size
[2021-12-22 16:33:02,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17
[2021-12-22 16:33:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:02,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-12-22 16:33:02,881 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:02,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789330709]
[2021-12-22 16:33:02,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789330709] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 16:33:02,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 16:33:02,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-12-22 16:33:02,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526016392]
[2021-12-22 16:33:02,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 16:33:02,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2021-12-22 16:33:02,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:02,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-12-22 16:33:02,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-12-22 16:33:02,911 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:03,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:03,290 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions.
[2021-12-22 16:33:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-12-22 16:33:03,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4
[2021-12-22 16:33:03,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:03,300 INFO L225 Difference]: With dead ends: 208
[2021-12-22 16:33:03,301 INFO L226 Difference]: Without dead ends: 206
[2021-12-22 16:33:03,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-12-22 16:33:03,305 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:03,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 288 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2021-12-22 16:33:03,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states.
[2021-12-22 16:33:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180.
[2021-12-22 16:33:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions.
[2021-12-22 16:33:03,338 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 4
[2021-12-22 16:33:03,338 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:03,338 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions.
[2021-12-22 16:33:03,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:03,338 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions.
[2021-12-22 16:33:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2021-12-22 16:33:03,339 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:03,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1]
[2021-12-22 16:33:03,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2021-12-22 16:33:03,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:03,552 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:03,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:03,552 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times
[2021-12-22 16:33:03,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:03,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114125981]
[2021-12-22 16:33:03,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 16:33:03,553 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:03,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:03,555 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:03,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2021-12-22 16:33:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 16:33:03,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core
[2021-12-22 16:33:03,600 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:03,609 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2021-12-22 16:33:03,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2021-12-22 16:33:03,642 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-12-22 16:33:03,643 INFO L387 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-22 16:33:03,657 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2021-12-22 16:33:03,657 INFO L387 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 12 treesize of output 12
[2021-12-22 16:33:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:03,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-12-22 16:33:03,672 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:03,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114125981]
[2021-12-22 16:33:03,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114125981] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 16:33:03,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 16:33:03,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-12-22 16:33:03,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131130910]
[2021-12-22 16:33:03,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 16:33:03,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2021-12-22 16:33:03,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:03,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-12-22 16:33:03,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-12-22 16:33:03,674 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:04,114 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions.
[2021-12-22 16:33:04,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-12-22 16:33:04,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 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 4
[2021-12-22 16:33:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:04,116 INFO L225 Difference]: With dead ends: 196
[2021-12-22 16:33:04,116 INFO L226 Difference]: Without dead ends: 196
[2021-12-22 16:33:04,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-12-22 16:33:04,117 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:04,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 341 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2021-12-22 16:33:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2021-12-22 16:33:04,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185.
[2021-12-22 16:33:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions.
[2021-12-22 16:33:04,125 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 4
[2021-12-22 16:33:04,125 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:04,126 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions.
[2021-12-22 16:33:04,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:04,126 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions.
[2021-12-22 16:33:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2021-12-22 16:33:04,126 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:04,126 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2021-12-22 16:33:04,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0
[2021-12-22 16:33:04,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:04,327 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:04,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:04,327 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times
[2021-12-22 16:33:04,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:04,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389689706]
[2021-12-22 16:33:04,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 16:33:04,328 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:04,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:04,329 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:04,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2021-12-22 16:33:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 16:33:04,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core
[2021-12-22 16:33:04,373 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:04,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2021-12-22 16:33:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:04,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-12-22 16:33:04,385 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:04,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389689706]
[2021-12-22 16:33:04,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389689706] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 16:33:04,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 16:33:04,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-12-22 16:33:04,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932971538]
[2021-12-22 16:33:04,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 16:33:04,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-12-22 16:33:04,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:04,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-12-22 16:33:04,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-22 16:33:04,387 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:04,583 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions.
[2021-12-22 16:33:04,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-12-22 16:33:04,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5
[2021-12-22 16:33:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:04,585 INFO L225 Difference]: With dead ends: 208
[2021-12-22 16:33:04,585 INFO L226 Difference]: Without dead ends: 208
[2021-12-22 16:33:04,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-22 16:33:04,586 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:04,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 230 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2021-12-22 16:33:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2021-12-22 16:33:04,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183.
[2021-12-22 16:33:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions.
[2021-12-22 16:33:04,592 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5
[2021-12-22 16:33:04,592 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:04,593 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions.
[2021-12-22 16:33:04,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions.
[2021-12-22 16:33:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2021-12-22 16:33:04,593 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:04,593 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2021-12-22 16:33:04,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0
[2021-12-22 16:33:04,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:04,794 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:04,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times
[2021-12-22 16:33:04,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:04,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656232240]
[2021-12-22 16:33:04,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 16:33:04,798 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:04,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:04,803 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:04,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2021-12-22 16:33:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 16:33:04,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core
[2021-12-22 16:33:04,868 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:04,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2021-12-22 16:33:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:04,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-12-22 16:33:04,900 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:04,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656232240]
[2021-12-22 16:33:04,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656232240] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 16:33:04,901 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 16:33:04,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-12-22 16:33:04,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271995036]
[2021-12-22 16:33:04,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 16:33:04,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-12-22 16:33:04,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:04,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-12-22 16:33:04,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-22 16:33:04,903 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:05,145 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions.
[2021-12-22 16:33:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-12-22 16:33:05,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5
[2021-12-22 16:33:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:05,146 INFO L225 Difference]: With dead ends: 181
[2021-12-22 16:33:05,146 INFO L226 Difference]: Without dead ends: 181
[2021-12-22 16:33:05,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-22 16:33:05,147 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:05,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2021-12-22 16:33:05,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2021-12-22 16:33:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181.
[2021-12-22 16:33:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions.
[2021-12-22 16:33:05,152 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 5
[2021-12-22 16:33:05,152 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:05,153 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions.
[2021-12-22 16:33:05,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:05,153 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions.
[2021-12-22 16:33:05,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2021-12-22 16:33:05,153 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:05,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 16:33:05,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0
[2021-12-22 16:33:05,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:05,360 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:05,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times
[2021-12-22 16:33:05,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:05,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590270909]
[2021-12-22 16:33:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 16:33:05,361 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:05,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:05,362 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:05,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2021-12-22 16:33:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 16:33:05,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core
[2021-12-22 16:33:05,429 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:05,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2021-12-22 16:33:05,492 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2021-12-22 16:33:05,492 INFO L387 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 12 treesize of output 12
[2021-12-22 16:33:05,541 INFO L387 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 14 treesize of output 16
[2021-12-22 16:33:05,557 INFO L387 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 14 treesize of output 16
[2021-12-22 16:33:05,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2021-12-22 16:33:05,586 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2021-12-22 16:33:05,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:05,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-12-22 16:33:05,606 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:05,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590270909]
[2021-12-22 16:33:05,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590270909] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 16:33:05,607 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 16:33:05,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-12-22 16:33:05,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777691648]
[2021-12-22 16:33:05,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 16:33:05,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-22 16:33:05,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:05,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-22 16:33:05,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2021-12-22 16:33:05,608 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:05,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:05,950 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions.
[2021-12-22 16:33:05,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-12-22 16:33:05,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10
[2021-12-22 16:33:05,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:05,951 INFO L225 Difference]: With dead ends: 183
[2021-12-22 16:33:05,951 INFO L226 Difference]: Without dead ends: 183
[2021-12-22 16:33:05,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2021-12-22 16:33:05,952 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 5 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:05,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 602 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2021-12-22 16:33:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2021-12-22 16:33:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182.
[2021-12-22 16:33:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:05,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions.
[2021-12-22 16:33:05,958 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10
[2021-12-22 16:33:05,958 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:05,959 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions.
[2021-12-22 16:33:05,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:05,959 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions.
[2021-12-22 16:33:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2021-12-22 16:33:05,959 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:05,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 16:33:05,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0
[2021-12-22 16:33:06,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:06,170 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:06,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:06,171 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times
[2021-12-22 16:33:06,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:06,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508088984]
[2021-12-22 16:33:06,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 16:33:06,171 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:06,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:06,174 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:06,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2021-12-22 16:33:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 16:33:06,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core
[2021-12-22 16:33:06,232 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:06,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-12-22 16:33:06,266 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:06,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1508088984]
[2021-12-22 16:33:06,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1508088984] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 16:33:06,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 16:33:06,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-12-22 16:33:06,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897568678]
[2021-12-22 16:33:06,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 16:33:06,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2021-12-22 16:33:06,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:06,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-12-22 16:33:06,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-12-22 16:33:06,267 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:06,292 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions.
[2021-12-22 16:33:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-12-22 16:33:06,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12
[2021-12-22 16:33:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:06,293 INFO L225 Difference]: With dead ends: 258
[2021-12-22 16:33:06,293 INFO L226 Difference]: Without dead ends: 258
[2021-12-22 16:33:06,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-12-22 16:33:06,296 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 79 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:06,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 545 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2021-12-22 16:33:06,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states.
[2021-12-22 16:33:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222.
[2021-12-22 16:33:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:06,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions.
[2021-12-22 16:33:06,310 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12
[2021-12-22 16:33:06,310 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:06,310 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions.
[2021-12-22 16:33:06,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions.
[2021-12-22 16:33:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2021-12-22 16:33:06,310 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:06,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 16:33:06,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0
[2021-12-22 16:33:06,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:06,517 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:06,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:06,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times
[2021-12-22 16:33:06,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:06,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768761451]
[2021-12-22 16:33:06,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 16:33:06,518 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:06,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:06,519 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:06,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2021-12-22 16:33:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 16:33:06,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core
[2021-12-22 16:33:06,573 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:06,598 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size
[2021-12-22 16:33:06,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14
[2021-12-22 16:33:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:06,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-12-22 16:33:06,608 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:06,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768761451]
[2021-12-22 16:33:06,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768761451] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 16:33:06,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 16:33:06,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-12-22 16:33:06,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420447734]
[2021-12-22 16:33:06,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 16:33:06,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-12-22 16:33:06,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:06,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-12-22 16:33:06,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-22 16:33:06,610 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:06,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:06,843 INFO L93 Difference]: Finished difference Result 211 states and 249 transitions.
[2021-12-22 16:33:06,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-12-22 16:33:06,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2021-12-22 16:33:06,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:06,844 INFO L225 Difference]: With dead ends: 211
[2021-12-22 16:33:06,844 INFO L226 Difference]: Without dead ends: 211
[2021-12-22 16:33:06,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-22 16:33:06,845 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 62 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:06,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 198 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2021-12-22 16:33:06,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2021-12-22 16:33:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209.
[2021-12-22 16:33:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 136 states have (on average 1.786764705882353) internal successors, (243), 204 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 247 transitions.
[2021-12-22 16:33:06,849 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 247 transitions. Word has length 13
[2021-12-22 16:33:06,849 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:06,849 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 247 transitions.
[2021-12-22 16:33:06,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 247 transitions.
[2021-12-22 16:33:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2021-12-22 16:33:06,849 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:06,849 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 16:33:06,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0
[2021-12-22 16:33:07,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:07,050 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:07,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:07,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times
[2021-12-22 16:33:07,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:07,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564692666]
[2021-12-22 16:33:07,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 16:33:07,051 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:07,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:07,052 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:07,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2021-12-22 16:33:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 16:33:07,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core
[2021-12-22 16:33:07,127 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:07,151 INFO L190 IndexEqualityManager]: detected not equals via solver
[2021-12-22 16:33:07,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11
[2021-12-22 16:33:07,158 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9
[2021-12-22 16:33:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:07,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-12-22 16:33:07,167 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:07,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564692666]
[2021-12-22 16:33:07,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564692666] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 16:33:07,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 16:33:07,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-12-22 16:33:07,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063604104]
[2021-12-22 16:33:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 16:33:07,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2021-12-22 16:33:07,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:07,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-12-22 16:33:07,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-22 16:33:07,176 INFO L87 Difference]: Start difference. First operand 209 states and 247 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:07,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:07,379 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions.
[2021-12-22 16:33:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-12-22 16:33:07,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13
[2021-12-22 16:33:07,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:07,381 INFO L225 Difference]: With dead ends: 198
[2021-12-22 16:33:07,381 INFO L226 Difference]: Without dead ends: 198
[2021-12-22 16:33:07,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-12-22 16:33:07,381 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 49 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:07,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 200 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2021-12-22 16:33:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2021-12-22 16:33:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196.
[2021-12-22 16:33:07,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 191 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:07,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions.
[2021-12-22 16:33:07,385 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 13
[2021-12-22 16:33:07,385 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:07,385 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions.
[2021-12-22 16:33:07,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions.
[2021-12-22 16:33:07,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-12-22 16:33:07,385 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:07,385 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 16:33:07,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0
[2021-12-22 16:33:07,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:07,594 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:07,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:07,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times
[2021-12-22 16:33:07,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:07,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113629231]
[2021-12-22 16:33:07,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 16:33:07,595 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:07,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:07,596 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:07,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2021-12-22 16:33:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 16:33:07,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core
[2021-12-22 16:33:07,665 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:07,691 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size
[2021-12-22 16:33:07,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18
[2021-12-22 16:33:07,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2021-12-22 16:33:07,736 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2021-12-22 16:33:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:07,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-12-22 16:33:07,744 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:07,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113629231]
[2021-12-22 16:33:07,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113629231] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 16:33:07,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 16:33:07,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-12-22 16:33:07,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429154073]
[2021-12-22 16:33:07,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 16:33:07,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2021-12-22 16:33:07,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-12-22 16:33:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-12-22 16:33:07,746 INFO L87 Difference]: Start difference. First operand 196 states and 221 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:08,151 INFO L93 Difference]: Finished difference Result 247 states and 285 transitions.
[2021-12-22 16:33:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-12-22 16:33:08,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17
[2021-12-22 16:33:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:08,153 INFO L225 Difference]: With dead ends: 247
[2021-12-22 16:33:08,153 INFO L226 Difference]: Without dead ends: 247
[2021-12-22 16:33:08,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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-22 16:33:08,153 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 25 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:08,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 397 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2021-12-22 16:33:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states.
[2021-12-22 16:33:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 202.
[2021-12-22 16:33:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 197 states have internal predecessors, (227), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 231 transitions.
[2021-12-22 16:33:08,158 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 231 transitions. Word has length 17
[2021-12-22 16:33:08,158 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:08,158 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 231 transitions.
[2021-12-22 16:33:08,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 231 transitions.
[2021-12-22 16:33:08,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-12-22 16:33:08,159 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:08,159 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 16:33:08,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0
[2021-12-22 16:33:08,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:08,363 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:08,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:08,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times
[2021-12-22 16:33:08,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:08,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34228141]
[2021-12-22 16:33:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 16:33:08,364 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:08,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:08,365 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:08,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2021-12-22 16:33:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 16:33:08,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core
[2021-12-22 16:33:08,432 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:08,462 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2021-12-22 16:33:08,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15
[2021-12-22 16:33:08,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2021-12-22 16:33:08,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2021-12-22 16:33:08,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9
[2021-12-22 16:33:08,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7
[2021-12-22 16:33:08,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:08,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2021-12-22 16:33:08,548 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:08,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34228141]
[2021-12-22 16:33:08,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34228141] provided 1 perfect and 0 imperfect interpolant sequences
[2021-12-22 16:33:08,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2021-12-22 16:33:08,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-12-22 16:33:08,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468188227]
[2021-12-22 16:33:08,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2021-12-22 16:33:08,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2021-12-22 16:33:08,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:08,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-12-22 16:33:08,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2021-12-22 16:33:08,549 INFO L87 Difference]: Start difference. First operand 202 states and 231 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:09,010 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions.
[2021-12-22 16:33:09,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-12-22 16:33:09,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17
[2021-12-22 16:33:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:09,012 INFO L225 Difference]: With dead ends: 204
[2021-12-22 16:33:09,012 INFO L226 Difference]: Without dead ends: 204
[2021-12-22 16:33:09,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2021-12-22 16:33:09,012 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 5 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:09,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 414 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2021-12-22 16:33:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2021-12-22 16:33:09,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202.
[2021-12-22 16:33:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 197 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 227 transitions.
[2021-12-22 16:33:09,017 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 227 transitions. Word has length 17
[2021-12-22 16:33:09,017 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:09,017 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 227 transitions.
[2021-12-22 16:33:09,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 227 transitions.
[2021-12-22 16:33:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2021-12-22 16:33:09,017 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:09,018 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 16:33:09,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0
[2021-12-22 16:33:09,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:09,224 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:09,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times
[2021-12-22 16:33:09,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:09,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917003228]
[2021-12-22 16:33:09,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 16:33:09,225 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:09,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:09,226 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:09,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2021-12-22 16:33:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 16:33:09,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core
[2021-12-22 16:33:09,328 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:09,353 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size
[2021-12-22 16:33:09,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22
[2021-12-22 16:33:09,372 INFO L387 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-22 16:33:09,453 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2021-12-22 16:33:09,454 INFO L387 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 34 treesize of output 35
[2021-12-22 16:33:09,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13
[2021-12-22 16:33:09,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2021-12-22 16:33:09,511 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2021-12-22 16:33:09,594 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_176) c_create_data_~data~0.base) .cse0))) (_ bv1 1))) is different from false
[2021-12-22 16:33:09,651 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:09,651 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25
[2021-12-22 16:33:09,653 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28
[2021-12-22 16:33:09,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 9
[2021-12-22 16:33:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2021-12-22 16:33:09,745 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:09,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917003228]
[2021-12-22 16:33:09,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917003228] provided 0 perfect and 2 imperfect interpolant sequences
[2021-12-22 16:33:09,745 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2021-12-22 16:33:09,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10
[2021-12-22 16:33:09,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575329739]
[2021-12-22 16:33:09,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2021-12-22 16:33:09,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2021-12-22 16:33:09,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:09,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-12-22 16:33:09,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=64, Unknown=3, NotChecked=16, Total=110
[2021-12-22 16:33:09,746 INFO L87 Difference]: Start difference. First operand 202 states and 227 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:09,982 INFO L93 Difference]: Finished difference Result 201 states and 225 transitions.
[2021-12-22 16:33:09,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-12-22 16:33:09,982 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22
[2021-12-22 16:33:09,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:09,983 INFO L225 Difference]: With dead ends: 201
[2021-12-22 16:33:09,983 INFO L226 Difference]: Without dead ends: 201
[2021-12-22 16:33:09,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=78, Unknown=3, NotChecked=18, Total=132
[2021-12-22 16:33:09,984 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 6 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:09,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 731 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 225 Unchecked, 0.2s Time]
[2021-12-22 16:33:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2021-12-22 16:33:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201.
[2021-12-22 16:33:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 142 states have (on average 1.556338028169014) internal successors, (221), 196 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 225 transitions.
[2021-12-22 16:33:09,993 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 225 transitions. Word has length 22
[2021-12-22 16:33:09,993 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:09,994 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 225 transitions.
[2021-12-22 16:33:09,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 225 transitions.
[2021-12-22 16:33:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2021-12-22 16:33:09,994 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:09,994 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 16:33:10,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0
[2021-12-22 16:33:10,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:10,202 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:10,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times
[2021-12-22 16:33:10,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:10,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128376194]
[2021-12-22 16:33:10,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-12-22 16:33:10,203 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:10,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:10,204 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:10,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2021-12-22 16:33:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-12-22 16:33:10,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core
[2021-12-22 16:33:10,323 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:10,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9
[2021-12-22 16:33:10,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11
[2021-12-22 16:33:10,362 INFO L387 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-22 16:33:10,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2021-12-22 16:33:10,474 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2021-12-22 16:33:10,474 INFO L387 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-22 16:33:10,478 INFO L387 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-22 16:33:10,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13
[2021-12-22 16:33:10,553 INFO L387 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-22 16:33:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:10,570 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2021-12-22 16:33:10,909 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset)))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false
[2021-12-22 16:33:10,948 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_222) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_222) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_221) c_create_data_~data~0.base) .cse4))))))) is different from false
[2021-12-22 16:33:11,008 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1) v_ArrVal_222) c_create_data_~data~0.base) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_222) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_221) c_create_data_~data~0.base) .cse3))))))) is different from false
[2021-12-22 16:33:11,022 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:11,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46
[2021-12-22 16:33:11,029 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:11,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36
[2021-12-22 16:33:11,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50
[2021-12-22 16:33:11,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 78
[2021-12-22 16:33:11,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 32
[2021-12-22 16:33:11,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 66 treesize of output 58
[2021-12-22 16:33:11,146 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:11,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36
[2021-12-22 16:33:11,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 36
[2021-12-22 16:33:11,153 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11
[2021-12-22 16:33:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2021-12-22 16:33:11,248 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:11,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128376194]
[2021-12-22 16:33:11,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128376194] provided 0 perfect and 2 imperfect interpolant sequences
[2021-12-22 16:33:11,248 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2021-12-22 16:33:11,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14
[2021-12-22 16:33:11,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305930968]
[2021-12-22 16:33:11,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2021-12-22 16:33:11,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2021-12-22 16:33:11,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:11,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-12-22 16:33:11,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210
[2021-12-22 16:33:11,249 INFO L87 Difference]: Start difference. First operand 201 states and 225 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:13,162 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions.
[2021-12-22 16:33:13,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-12-22 16:33:13,163 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22
[2021-12-22 16:33:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:13,163 INFO L225 Difference]: With dead ends: 213
[2021-12-22 16:33:13,164 INFO L226 Difference]: Without dead ends: 213
[2021-12-22 16:33:13,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306
[2021-12-22 16:33:13,164 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 13 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 323 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:13,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 1075 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 550 Invalid, 0 Unknown, 323 Unchecked, 1.7s Time]
[2021-12-22 16:33:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states.
[2021-12-22 16:33:13,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211.
[2021-12-22 16:33:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 152 states have (on average 1.519736842105263) internal successors, (231), 206 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 235 transitions.
[2021-12-22 16:33:13,168 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 235 transitions. Word has length 22
[2021-12-22 16:33:13,168 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:13,168 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 235 transitions.
[2021-12-22 16:33:13,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 235 transitions.
[2021-12-22 16:33:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2021-12-22 16:33:13,169 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:13,169 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 16:33:13,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0
[2021-12-22 16:33:13,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:13,379 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:13,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:13,379 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times
[2021-12-22 16:33:13,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:13,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298092293]
[2021-12-22 16:33:13,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2021-12-22 16:33:13,380 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:13,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:13,381 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:13,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process
[2021-12-22 16:33:13,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2021-12-22 16:33:13,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2021-12-22 16:33:13,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core
[2021-12-22 16:33:13,541 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:13,571 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2021-12-22 16:33:13,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15
[2021-12-22 16:33:13,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9
[2021-12-22 16:33:13,601 INFO L387 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-22 16:33:13,608 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2021-12-22 16:33:13,701 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2021-12-22 16:33:13,702 INFO L387 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-22 16:33:13,705 INFO L387 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-22 16:33:13,819 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2021-12-22 16:33:13,819 INFO L387 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-22 16:33:13,824 INFO L387 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-22 16:33:13,911 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13
[2021-12-22 16:33:13,915 INFO L387 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-22 16:33:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:13,935 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2021-12-22 16:33:14,265 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse2)))))) is different from false
[2021-12-22 16:33:14,296 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_284) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_284) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_285) c_create_data_~data~0.base) .cse4))))))) is different from false
[2021-12-22 16:33:14,341 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_284) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false
[2021-12-22 16:33:14,391 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283)) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283) c_create_data_~data~0.base) .cse5) v_ArrVal_284) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false
[2021-12-22 16:33:14,427 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3) v_ArrVal_284)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_283))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_282) .cse5 v_ArrVal_284) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_285) c_create_data_~data~0.base) .cse6))))))))) is different from false
[2021-12-22 16:33:14,490 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2) v_ArrVal_284)) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_283))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_282) .cse4 v_ArrVal_284) c_create_data_~data~0.base) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_285) c_create_data_~data~0.base) .cse5))))))))) is different from false
[2021-12-22 16:33:14,510 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:14,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80
[2021-12-22 16:33:14,517 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:14,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60
[2021-12-22 16:33:14,521 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84
[2021-12-22 16:33:14,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 144
[2021-12-22 16:33:14,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 102 treesize of output 86
[2021-12-22 16:33:14,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 86 treesize of output 78
[2021-12-22 16:33:14,551 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 116 treesize of output 92
[2021-12-22 16:33:14,598 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:14,598 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90
[2021-12-22 16:33:14,609 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:14,610 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60
[2021-12-22 16:33:14,613 INFO L173 IndexEqualityManager]: detected equality via solver
[2021-12-22 16:33:14,616 INFO L387 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 92 treesize of output 56
[2021-12-22 16:33:14,619 INFO L173 IndexEqualityManager]: detected equality via solver
[2021-12-22 16:33:14,622 INFO L387 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 50 treesize of output 32
[2021-12-22 16:33:14,628 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2021-12-22 16:33:14,716 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked.
[2021-12-22 16:33:14,716 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:14,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298092293]
[2021-12-22 16:33:14,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298092293] provided 0 perfect and 2 imperfect interpolant sequences
[2021-12-22 16:33:14,717 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2021-12-22 16:33:14,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19
[2021-12-22 16:33:14,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634611801]
[2021-12-22 16:33:14,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2021-12-22 16:33:14,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2021-12-22 16:33:14,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:14,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2021-12-22 16:33:14,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380
[2021-12-22 16:33:14,718 INFO L87 Difference]: Start difference. First operand 211 states and 235 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:17,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:17,018 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions.
[2021-12-22 16:33:17,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-12-22 16:33:17,019 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27
[2021-12-22 16:33:17,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:17,020 INFO L225 Difference]: With dead ends: 223
[2021-12-22 16:33:17,020 INFO L226 Difference]: Without dead ends: 223
[2021-12-22 16:33:17,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552
[2021-12-22 16:33:17,021 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 21 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 519 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:17,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 1323 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 665 Invalid, 0 Unknown, 519 Unchecked, 1.9s Time]
[2021-12-22 16:33:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states.
[2021-12-22 16:33:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221.
[2021-12-22 16:33:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 216 states have internal predecessors, (241), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 245 transitions.
[2021-12-22 16:33:17,024 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 245 transitions. Word has length 27
[2021-12-22 16:33:17,024 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:17,025 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 245 transitions.
[2021-12-22 16:33:17,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 245 transitions.
[2021-12-22 16:33:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2021-12-22 16:33:17,025 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:17,025 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 16:33:17,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0
[2021-12-22 16:33:17,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:17,234 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash 201129006, now seen corresponding path program 3 times
[2021-12-22 16:33:17,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:17,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158818827]
[2021-12-22 16:33:17,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2021-12-22 16:33:17,235 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:17,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:17,236 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:17,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process
[2021-12-22 16:33:17,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2021-12-22 16:33:17,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2021-12-22 16:33:17,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 28 conjunts are in the unsatisfiable core
[2021-12-22 16:33:17,503 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:17,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9
[2021-12-22 16:33:17,536 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 11
[2021-12-22 16:33:17,556 INFO L387 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-22 16:33:17,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2021-12-22 16:33:17,657 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2021-12-22 16:33:17,658 INFO L387 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-22 16:33:17,663 INFO L387 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-22 16:33:17,773 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2021-12-22 16:33:17,773 INFO L387 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-22 16:33:17,777 INFO L387 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-22 16:33:17,889 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2021-12-22 16:33:17,890 INFO L387 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-22 16:33:17,898 INFO L387 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-22 16:33:17,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13
[2021-12-22 16:33:17,992 INFO L387 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-22 16:33:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:18,012 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2021-12-22 16:33:18,334 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_364) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_365) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_364) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false
[2021-12-22 16:33:18,367 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_364) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_364) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_365) c_create_data_~data~0.base) .cse4))))))) is different from false
[2021-12-22 16:33:18,431 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_364) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_365) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_364) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false
[2021-12-22 16:33:18,552 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_363) c_create_data_~data~0.base) .cse2) v_ArrVal_364) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_363)) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_362) .cse3 v_ArrVal_364) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_365) c_create_data_~data~0.base) .cse4))))))) is different from false
[2021-12-22 16:33:18,684 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse3) v_ArrVal_364)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_363))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_362) .cse5 v_ArrVal_364) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_365) c_create_data_~data~0.base) .cse6))))))))) is different from false
[2021-12-22 16:33:18,748 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse3) v_ArrVal_364)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_363))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_362) .cse5 v_ArrVal_364) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_365) c_create_data_~data~0.base) .cse6))))))))) is different from false
[2021-12-22 16:33:19,248 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_360)) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_363))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_361) .cse0 v_ArrVal_362) .cse1 v_ArrVal_364) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_365) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_360))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_361) .cse7 v_ArrVal_362) (select (select (store .cse8 .cse7 v_ArrVal_363) c_create_data_~data~0.base) .cse9) v_ArrVal_364))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse5 .cse6))))) is different from false
[2021-12-22 16:33:19,833 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_360))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_363))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_361) .cse1 v_ArrVal_362) .cse2 v_ArrVal_364) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_365) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse11 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_360))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_361) .cse9 v_ArrVal_362) (select (select (store .cse10 .cse9 v_ArrVal_363) c_create_data_~data~0.base) .cse11) v_ArrVal_364)))) c_create_data_~data~0.base) .cse11))) (.cse7 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse6 .cse7 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse7))))) is different from false
[2021-12-22 16:33:19,933 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_360))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_361) .cse2 v_ArrVal_362) (select (select (store .cse3 .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse4) v_ArrVal_364)))) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd .cse0 (_ bv12 32)) (bvadd (_ bv16 32) .cse0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_360))) (let ((.cse6 (select (select .cse10 c_create_data_~data~0.base) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_363))) (let ((.cse7 (select (select .cse9 c_create_data_~data~0.base) .cse8))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_361) .cse6 v_ArrVal_362) .cse7 v_ArrVal_364) c_create_data_~data~0.base) .cse8)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_365) c_create_data_~data~0.base) .cse8))))))))))) is different from false
[2021-12-22 16:33:19,962 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:19,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168
[2021-12-22 16:33:19,977 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:19,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108
[2021-12-22 16:33:19,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 588 treesize of output 498
[2021-12-22 16:33:20,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6342 treesize of output 5964
[2021-12-22 16:33:20,058 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5960 treesize of output 5544
[2021-12-22 16:33:20,085 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5544 treesize of output 5000
[2021-12-22 16:33:20,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5000 treesize of output 4128
[2021-12-22 16:33:20,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4128 treesize of output 3920
[2021-12-22 16:33:20,159 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3920 treesize of output 3712
[2021-12-22 16:33:21,208 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:21,208 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178
[2021-12-22 16:33:21,224 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:21,225 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108
[2021-12-22 16:33:21,229 INFO L173 IndexEqualityManager]: detected equality via solver
[2021-12-22 16:33:21,234 INFO L387 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 460 treesize of output 310
[2021-12-22 16:33:21,239 INFO L173 IndexEqualityManager]: detected equality via solver
[2021-12-22 16:33:21,243 INFO L387 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 368 treesize of output 314
[2021-12-22 16:33:21,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 310 treesize of output 286
[2021-12-22 16:33:21,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 286 treesize of output 226
[2021-12-22 16:33:21,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 226 treesize of output 210
[2021-12-22 16:33:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked.
[2021-12-22 16:33:21,474 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2021-12-22 16:33:21,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158818827]
[2021-12-22 16:33:21,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158818827] provided 0 perfect and 2 imperfect interpolant sequences
[2021-12-22 16:33:21,474 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2021-12-22 16:33:21,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24
[2021-12-22 16:33:21,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708603786]
[2021-12-22 16:33:21,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2021-12-22 16:33:21,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2021-12-22 16:33:21,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2021-12-22 16:33:21,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2021-12-22 16:33:21,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=194, Unknown=9, NotChecked=324, Total=600
[2021-12-22 16:33:21,475 INFO L87 Difference]: Start difference. First operand 221 states and 245 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-12-22 16:33:25,501 INFO L93 Difference]: Finished difference Result 233 states and 257 transitions.
[2021-12-22 16:33:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2021-12-22 16:33:25,504 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32
[2021-12-22 16:33:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-12-22 16:33:25,505 INFO L225 Difference]: With dead ends: 233
[2021-12-22 16:33:25,505 INFO L226 Difference]: Without dead ends: 233
[2021-12-22 16:33:25,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=110, Invalid=337, Unknown=9, NotChecked=414, Total=870
[2021-12-22 16:33:25,506 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 28 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 825 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time
[2021-12-22 16:33:25,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 1415 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 567 Invalid, 0 Unknown, 825 Unchecked, 3.0s Time]
[2021-12-22 16:33:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states.
[2021-12-22 16:33:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231.
[2021-12-22 16:33:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 172 states have (on average 1.4593023255813953) internal successors, (251), 226 states have internal predecessors, (251), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2021-12-22 16:33:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 255 transitions.
[2021-12-22 16:33:25,509 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 255 transitions. Word has length 32
[2021-12-22 16:33:25,509 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-12-22 16:33:25,510 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 255 transitions.
[2021-12-22 16:33:25,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-12-22 16:33:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 255 transitions.
[2021-12-22 16:33:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2021-12-22 16:33:25,510 INFO L506 BasicCegarLoop]: Found error trace
[2021-12-22 16:33:25,511 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-12-22 16:33:25,522 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-22 16:33:25,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3
[2021-12-22 16:33:25,719 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] ===
[2021-12-22 16:33:25,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-12-22 16:33:25,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1676760053, now seen corresponding path program 4 times
[2021-12-22 16:33:25,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF
[2021-12-22 16:33:25,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62677546]
[2021-12-22 16:33:25,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2021-12-22 16:33:25,720 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3
[2021-12-22 16:33:25,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2021-12-22 16:33:25,722 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2021-12-22 16:33:25,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process
[2021-12-22 16:33:25,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2021-12-22 16:33:25,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2021-12-22 16:33:25,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjunts are in the unsatisfiable core
[2021-12-22 16:33:25,940 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2021-12-22 16:33:25,995 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size
[2021-12-22 16:33:25,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15
[2021-12-22 16:33:26,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9
[2021-12-22 16:33:26,043 INFO L387 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-22 16:33:26,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2021-12-22 16:33:26,258 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2021-12-22 16:33:26,258 INFO L387 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-22 16:33:26,265 INFO L387 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-22 16:33:26,530 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2021-12-22 16:33:26,531 INFO L387 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-22 16:33:26,540 INFO L387 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-22 16:33:26,798 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2021-12-22 16:33:26,798 INFO L387 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-22 16:33:26,805 INFO L387 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-22 16:33:27,040 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2021-12-22 16:33:27,040 INFO L387 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-22 16:33:27,050 INFO L387 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-22 16:33:27,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13
[2021-12-22 16:33:27,213 INFO L387 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-22 16:33:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-12-22 16:33:27,266 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2021-12-22 16:33:27,709 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_460) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_460) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_461) c_create_data_~data~0.base) .cse2)))))) is different from false
[2021-12-22 16:33:27,758 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_460) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_461) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_460) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse2 .cse3) (bvadd (_ bv8 32) .cse2 .cse3))))) is different from false
[2021-12-22 16:33:27,829 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_460) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_460) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_461) c_create_data_~data~0.base) .cse4))))))) is different from false
[2021-12-22 16:33:27,905 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_458)) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_459) .cse0 v_ArrVal_460) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_461) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_459) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_458) c_create_data_~data~0.base) .cse5) v_ArrVal_460) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false
[2021-12-22 16:33:27,987 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_459) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3) v_ArrVal_460)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_458))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_459) .cse5 v_ArrVal_460) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_461) c_create_data_~data~0.base) .cse6))))))))) is different from false
[2021-12-22 16:33:28,094 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_459) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_458) c_create_data_~data~0.base) .cse3) v_ArrVal_460)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_458))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_459) .cse5 v_ArrVal_460) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_461) c_create_data_~data~0.base) .cse6))))))))) is different from false
[2021-12-22 16:33:29,404 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_457)) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_458))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_456) .cse0 v_ArrVal_459) .cse1 v_ArrVal_460) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_461) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_457))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_456) .cse7 v_ArrVal_459) (select (select (store .cse8 .cse7 v_ArrVal_458) c_create_data_~data~0.base) .cse9) v_ArrVal_460))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse5 .cse6))))) is different from false
[2021-12-22 16:33:31,594 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_457))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_458))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_456) .cse1 v_ArrVal_459) .cse2 v_ArrVal_460) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_461) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse11 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_457))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_456) .cse9 v_ArrVal_459) (select (select (store .cse10 .cse9 v_ArrVal_458) c_create_data_~data~0.base) .cse11) v_ArrVal_460)))) c_create_data_~data~0.base) .cse11))) (.cse7 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse6 .cse7 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse7))))) is different from false
[2021-12-22 16:33:31,858 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_457))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_456) .cse3 v_ArrVal_459) (select (select (store .cse4 .cse3 v_ArrVal_458) c_create_data_~data~0.base) .cse5) v_ArrVal_460)))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_457))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_458))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse9))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_456) .cse7 v_ArrVal_459) .cse8 v_ArrVal_460) c_create_data_~data~0.base) .cse9) (_ bv20 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_461) c_create_data_~data~0.base) .cse9))))))))))) is different from false
[2021-12-22 16:33:34,527 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_455))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_457))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_454) .cse2 v_ArrVal_456) .cse3 v_ArrVal_459) (select (select (store .cse4 .cse3 v_ArrVal_458) c_create_data_~data~0.base) .cse5) v_ArrVal_460))))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_455)) (.cse10 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse7 (select (select .cse13 c_create_data_~data~0.base) .cse10))) (let ((.cse12 (store .cse13 .cse7 v_ArrVal_457))) (let ((.cse8 (select (select .cse12 c_create_data_~data~0.base) .cse10))) (let ((.cse11 (store .cse12 .cse8 v_ArrVal_458))) (let ((.cse9 (select (select .cse11 c_create_data_~data~0.base) .cse10))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_454) .cse7 v_ArrVal_456) .cse8 v_ArrVal_459) .cse9 v_ArrVal_460) c_create_data_~data~0.base) .cse10) (_ bv20 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse11 .cse9 v_ArrVal_461) c_create_data_~data~0.base) .cse10))))))))))) is different from false
[2021-12-22 16:33:37,936 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_455))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_457))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_454) .cse3 v_ArrVal_456) .cse4 v_ArrVal_459) (select (select (store .cse5 .cse4 v_ArrVal_458) c_create_data_~data~0.base) .cse6) v_ArrVal_460)))))) c_create_data_~data~0.base) .cse6))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 (_ bv20 32) .cse1)))) (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse12))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_455))) (let ((.cse9 (select (select .cse15 c_create_data_~data~0.base) .cse12))) (let ((.cse14 (store .cse15 .cse9 v_ArrVal_457))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse12))) (let ((.cse13 (store .cse14 .cse10 v_ArrVal_458))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse12))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_454) .cse9 v_ArrVal_456) .cse10 v_ArrVal_459) .cse11 v_ArrVal_460) c_create_data_~data~0.base) .cse12) (_ bv20 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse13 .cse11 v_ArrVal_461) c_create_data_~data~0.base) .cse12))))))))))))) is different from false
[2021-12-22 16:33:39,055 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_455))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_457))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_458))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_454) .cse1 v_ArrVal_456) .cse2 v_ArrVal_459) .cse3 v_ArrVal_460) c_create_data_~data~0.base) .cse4) (_ bv20 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_461) c_create_data_~data~0.base) .cse4)))))))))))) (forall ((v_ArrVal_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_455 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_456 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_457 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_458 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_459 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (let ((.cse13 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse9 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse13))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_455))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse13))) (let ((.cse12 (store .cse14 .cse10 v_ArrVal_457))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse13))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_454) .cse10 v_ArrVal_456) .cse11 v_ArrVal_459) (select (select (store .cse12 .cse11 v_ArrVal_458) c_create_data_~data~0.base) .cse13) v_ArrVal_460)))))) c_create_data_~data~0.base) .cse13)))) (bvule (bvadd (_ bv16 32) .cse8) (bvadd .cse8 (_ bv20 32)))))) is different from false
[2021-12-22 16:33:39,244 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:39,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 353 treesize of output 354
[2021-12-22 16:33:39,382 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2021-12-22 16:33:39,382 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 343 treesize of output 204
[2021-12-22 16:33:39,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177384 treesize of output 149466
[2021-12-22 16:33:41,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4628326 treesize of output 4549600
[2021-12-22 16:33:50,911 WARN L227 SmtUtils]: Spent 9.17s on a formula simplification that was a NOOP. DAG size: 4913 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2021-12-22 16:34:00,137 WARN L227 SmtUtils]: Spent 9.20s on a formula simplification that was a NOOP. DAG size: 4910 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2021-12-22 16:34:00,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4549596 treesize of output 4221532
[2021-12-22 16:34:09,420 WARN L227 SmtUtils]: Spent 9.10s on a formula simplification that was a NOOP. DAG size: 4909 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)
[2021-12-22 16:34:09,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4221532 treesize of output 3893468