./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:57:42,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:57:42,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:57:42,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:57:42,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:57:42,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:57:42,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:57:42,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:57:42,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:57:42,655 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:57:42,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:57:42,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:57:42,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:57:42,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:57:42,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:57:42,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:57:42,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:57:42,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:57:42,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:57:42,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:57:42,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:57:42,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:57:42,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:57:42,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:57:42,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:57:42,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:57:42,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:57:42,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:57:42,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:57:42,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:57:42,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:57:42,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:57:42,685 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:57:42,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:57:42,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:57:42,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:57:42,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:57:42,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:57:42,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:57:42,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:57:42,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:57:42,691 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-28 05:57:42,718 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:57:42,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:57:42,719 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:57:42,719 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:57:42,720 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:57:42,720 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:57:42,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:57:42,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:57:42,722 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:57:42,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:57:42,723 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:57:42,723 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:57:42,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:57:42,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:57:42,724 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:57:42,724 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:57:42,724 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:57:42,724 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 05:57:42,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:57:42,724 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:57:42,725 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:57:42,725 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:57:42,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:57:42,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:57:42,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:57:42,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:57:42,726 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:57:42,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:57:42,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:57:42,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:57:42,726 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2021-12-28 05:57:43,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:57:43,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:57:43,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:57:43,042 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:57:43,043 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:57:43,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2021-12-28 05:57:43,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26505e2f1/0d72ffb2a5f84f52828c0e46ec91bdcb/FLAG8c54f4cea [2021-12-28 05:57:43,551 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:57:43,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2021-12-28 05:57:43,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26505e2f1/0d72ffb2a5f84f52828c0e46ec91bdcb/FLAG8c54f4cea [2021-12-28 05:57:44,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26505e2f1/0d72ffb2a5f84f52828c0e46ec91bdcb [2021-12-28 05:57:44,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:57:44,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:57:44,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:57:44,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:57:44,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:57:44,082 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:57:44" (1/1) ... [2021-12-28 05:57:44,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c2f9836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44, skipping insertion in model container [2021-12-28 05:57:44,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:57:44" (1/1) ... [2021-12-28 05:57:44,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:57:44,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:57:44,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2021-12-28 05:57:44,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2021-12-28 05:57:44,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2021-12-28 05:57:44,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2021-12-28 05:57:44,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2021-12-28 05:57:44,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2021-12-28 05:57:44,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2021-12-28 05:57:44,328 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:57:44,333 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:57:44,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2021-12-28 05:57:44,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2021-12-28 05:57:44,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2021-12-28 05:57:44,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2021-12-28 05:57:44,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2021-12-28 05:57:44,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2021-12-28 05:57:44,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2021-12-28 05:57:44,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:57:44,425 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:57:44,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44 WrapperNode [2021-12-28 05:57:44,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:57:44,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:57:44,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:57:44,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:57:44,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44" (1/1) ... [2021-12-28 05:57:44,460 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44" (1/1) ... [2021-12-28 05:57:44,484 INFO L137 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 159 [2021-12-28 05:57:44,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:57:44,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:57:44,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:57:44,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:57:44,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44" (1/1) ... [2021-12-28 05:57:44,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44" (1/1) ... [2021-12-28 05:57:44,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44" (1/1) ... [2021-12-28 05:57:44,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44" (1/1) ... [2021-12-28 05:57:44,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44" (1/1) ... [2021-12-28 05:57:44,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44" (1/1) ... [2021-12-28 05:57:44,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44" (1/1) ... [2021-12-28 05:57:44,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:57:44,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:57:44,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:57:44,542 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:57:44,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44" (1/1) ... [2021-12-28 05:57:44,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:57:44,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:57:44,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 05:57:44,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 05:57:44,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 05:57:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 05:57:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:57:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:57:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:57:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:57:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:57:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:57:44,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:57:44,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:57:44,754 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:57:44,755 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:57:45,107 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:57:45,112 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:57:45,112 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-12-28 05:57:45,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:57:45 BoogieIcfgContainer [2021-12-28 05:57:45,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:57:45,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:57:45,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:57:45,120 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:57:45,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:57:44" (1/3) ... [2021-12-28 05:57:45,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758c1913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:57:45, skipping insertion in model container [2021-12-28 05:57:45,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:57:44" (2/3) ... [2021-12-28 05:57:45,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758c1913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:57:45, skipping insertion in model container [2021-12-28 05:57:45,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:57:45" (3/3) ... [2021-12-28 05:57:45,124 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2021-12-28 05:57:45,128 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:57:45,128 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2021-12-28 05:57:45,161 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:57:45,167 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 05:57:45,167 INFO L340 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2021-12-28 05:57:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 84 states have (on average 2.2023809523809526) internal successors, (185), 155 states have internal predecessors, (185), 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-28 05:57:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:57:45,202 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:45,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:57:45,202 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:45,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:45,206 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-28 05:57:45,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:45,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081621912] [2021-12-28 05:57:45,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:45,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:45,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:45,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081621912] [2021-12-28 05:57:45,350 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081621912] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:45,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:45,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:57:45,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159931014] [2021-12-28 05:57:45,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:45,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:57:45,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:45,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:57:45,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:57:45,387 INFO L87 Difference]: Start difference. First operand has 156 states, 84 states have (on average 2.2023809523809526) internal successors, (185), 155 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:45,559 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2021-12-28 05:57:45,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:57:45,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-28 05:57:45,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:45,570 INFO L225 Difference]: With dead ends: 157 [2021-12-28 05:57:45,570 INFO L226 Difference]: Without dead ends: 153 [2021-12-28 05:57:45,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:57:45,574 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:45,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 95 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-28 05:57:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2021-12-28 05:57:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 85 states have (on average 1.8352941176470587) internal successors, (156), 148 states have internal predecessors, (156), 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-28 05:57:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2021-12-28 05:57:45,619 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 3 [2021-12-28 05:57:45,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:45,619 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2021-12-28 05:57:45,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:45,620 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2021-12-28 05:57:45,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:57:45,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:45,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:57:45,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:57:45,621 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:45,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:45,623 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-28 05:57:45,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:45,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329146726] [2021-12-28 05:57:45,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:45,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:45,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:45,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329146726] [2021-12-28 05:57:45,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329146726] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:45,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:45,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:57:45,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632513926] [2021-12-28 05:57:45,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:45,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:57:45,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:45,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:57:45,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:57:45,682 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:45,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:45,787 INFO L93 Difference]: Finished difference Result 166 states and 172 transitions. [2021-12-28 05:57:45,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:57:45,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-28 05:57:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:45,791 INFO L225 Difference]: With dead ends: 166 [2021-12-28 05:57:45,791 INFO L226 Difference]: Without dead ends: 166 [2021-12-28 05:57:45,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:57:45,795 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 131 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:45,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 100 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:45,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-12-28 05:57:45,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2021-12-28 05:57:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 92 states have (on average 1.7391304347826086) internal successors, (160), 152 states have internal predecessors, (160), 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-28 05:57:45,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2021-12-28 05:57:45,812 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 3 [2021-12-28 05:57:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:45,813 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2021-12-28 05:57:45,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2021-12-28 05:57:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 05:57:45,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:45,816 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:45,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:57:45,817 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:45,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2021-12-28 05:57:45,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:45,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890794162] [2021-12-28 05:57:45,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:45,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:45,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:45,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890794162] [2021-12-28 05:57:45,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890794162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:45,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:45,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:57:45,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885106457] [2021-12-28 05:57:45,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:45,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:57:45,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:57:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:57:45,897 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:46,048 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2021-12-28 05:57:46,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:57:46,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-28 05:57:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:46,050 INFO L225 Difference]: With dead ends: 154 [2021-12-28 05:57:46,050 INFO L226 Difference]: Without dead ends: 154 [2021-12-28 05:57:46,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:57:46,052 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 214 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:46,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 77 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:46,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-28 05:57:46,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2021-12-28 05:57:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 139 states have internal predecessors, (149), 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-28 05:57:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2021-12-28 05:57:46,064 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 9 [2021-12-28 05:57:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:46,064 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2021-12-28 05:57:46,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2021-12-28 05:57:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 05:57:46,065 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:46,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:46,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:57:46,066 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:46,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:46,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2021-12-28 05:57:46,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:46,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124454720] [2021-12-28 05:57:46,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:46,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:46,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:46,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124454720] [2021-12-28 05:57:46,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124454720] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:46,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:46,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:57:46,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434152425] [2021-12-28 05:57:46,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:46,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:57:46,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:46,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:57:46,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:57:46,165 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:46,398 INFO L93 Difference]: Finished difference Result 179 states and 189 transitions. [2021-12-28 05:57:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:57:46,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-28 05:57:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:46,399 INFO L225 Difference]: With dead ends: 179 [2021-12-28 05:57:46,399 INFO L226 Difference]: Without dead ends: 179 [2021-12-28 05:57:46,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:57:46,400 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 321 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:46,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 140 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:57:46,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-28 05:57:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2021-12-28 05:57:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.542857142857143) internal successors, (162), 149 states have internal predecessors, (162), 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-28 05:57:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2021-12-28 05:57:46,403 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 9 [2021-12-28 05:57:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:46,403 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2021-12-28 05:57:46,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2021-12-28 05:57:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:57:46,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:46,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:46,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:57:46,404 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:46,404 INFO L85 PathProgramCache]: Analyzing trace with hash 233166301, now seen corresponding path program 1 times [2021-12-28 05:57:46,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:46,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825219533] [2021-12-28 05:57:46,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:46,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:46,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:46,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825219533] [2021-12-28 05:57:46,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825219533] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:46,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:46,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:57:46,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034453042] [2021-12-28 05:57:46,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:46,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:57:46,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:46,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:57:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:57:46,473 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:46,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:46,567 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2021-12-28 05:57:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:57:46,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-28 05:57:46,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:46,571 INFO L225 Difference]: With dead ends: 164 [2021-12-28 05:57:46,572 INFO L226 Difference]: Without dead ends: 164 [2021-12-28 05:57:46,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:57:46,574 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 149 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:46,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 175 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-28 05:57:46,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2021-12-28 05:57:46,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 104 states have (on average 1.5192307692307692) internal successors, (158), 147 states have internal predecessors, (158), 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-28 05:57:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2021-12-28 05:57:46,579 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 11 [2021-12-28 05:57:46,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:46,579 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2021-12-28 05:57:46,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2021-12-28 05:57:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 05:57:46,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:46,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:46,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:57:46,581 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:46,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2021-12-28 05:57:46,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:46,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582515805] [2021-12-28 05:57:46,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:46,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:46,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:46,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582515805] [2021-12-28 05:57:46,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582515805] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:46,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:46,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:57:46,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152606367] [2021-12-28 05:57:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:46,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:57:46,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:46,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:57:46,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:57:46,645 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:46,762 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2021-12-28 05:57:46,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:57:46,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-28 05:57:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:46,763 INFO L225 Difference]: With dead ends: 147 [2021-12-28 05:57:46,763 INFO L226 Difference]: Without dead ends: 147 [2021-12-28 05:57:46,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-28 05:57:46,769 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:46,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 323 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-28 05:57:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-12-28 05:57:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 104 states have (on average 1.5) internal successors, (156), 146 states have internal predecessors, (156), 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-28 05:57:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2021-12-28 05:57:46,780 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 12 [2021-12-28 05:57:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:46,781 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2021-12-28 05:57:46,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2021-12-28 05:57:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 05:57:46,782 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:46,782 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:46,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:57:46,783 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:46,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:46,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2021-12-28 05:57:46,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:46,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270110858] [2021-12-28 05:57:46,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:46,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:46,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:46,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270110858] [2021-12-28 05:57:46,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270110858] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:46,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:46,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:57:46,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608212602] [2021-12-28 05:57:46,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:46,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:57:46,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:46,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:57:46,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:57:46,819 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:46,915 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2021-12-28 05:57:46,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:57:46,922 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-28 05:57:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:46,923 INFO L225 Difference]: With dead ends: 146 [2021-12-28 05:57:46,923 INFO L226 Difference]: Without dead ends: 146 [2021-12-28 05:57:46,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-28 05:57:46,924 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 7 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:46,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 338 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:46,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-28 05:57:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-12-28 05:57:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 104 states have (on average 1.4807692307692308) internal successors, (154), 145 states have internal predecessors, (154), 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-28 05:57:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 154 transitions. [2021-12-28 05:57:46,927 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 154 transitions. Word has length 12 [2021-12-28 05:57:46,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:46,927 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 154 transitions. [2021-12-28 05:57:46,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:57:46,927 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 154 transitions. [2021-12-28 05:57:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-28 05:57:46,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:46,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:46,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:57:46,928 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:46,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1299214142, now seen corresponding path program 1 times [2021-12-28 05:57:46,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:46,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460199266] [2021-12-28 05:57:46,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:46,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:46,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:46,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:46,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460199266] [2021-12-28 05:57:46,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460199266] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:46,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:46,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:57:46,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141932902] [2021-12-28 05:57:46,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:46,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:57:46,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:46,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:57:46,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:57:46,984 INFO L87 Difference]: Start difference. First operand 146 states and 154 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-28 05:57:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:47,131 INFO L93 Difference]: Finished difference Result 200 states and 212 transitions. [2021-12-28 05:57:47,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:57:47,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2021-12-28 05:57:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:47,132 INFO L225 Difference]: With dead ends: 200 [2021-12-28 05:57:47,132 INFO L226 Difference]: Without dead ends: 200 [2021-12-28 05:57:47,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:57:47,133 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 197 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:47,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 314 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:47,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-28 05:57:47,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 151. [2021-12-28 05:57:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 150 states have internal predecessors, (159), 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-28 05:57:47,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2021-12-28 05:57:47,137 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 14 [2021-12-28 05:57:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:47,138 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2021-12-28 05:57:47,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-28 05:57:47,138 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2021-12-28 05:57:47,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:57:47,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:47,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:47,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:57:47,139 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:47,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2021-12-28 05:57:47,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:47,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511542730] [2021-12-28 05:57:47,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:47,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:47,235 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:47,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511542730] [2021-12-28 05:57:47,235 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511542730] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:47,235 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:47,235 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:57:47,235 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976008055] [2021-12-28 05:57:47,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:47,236 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:57:47,236 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:47,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:57:47,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:57:47,237 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-28 05:57:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:47,469 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2021-12-28 05:57:47,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:57:47,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2021-12-28 05:57:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:47,471 INFO L225 Difference]: With dead ends: 150 [2021-12-28 05:57:47,471 INFO L226 Difference]: Without dead ends: 150 [2021-12-28 05:57:47,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:57:47,471 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 187 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:47,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 221 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:57:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-28 05:57:47,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-28 05:57:47,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 149 states have internal predecessors, (158), 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-28 05:57:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2021-12-28 05:57:47,474 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 16 [2021-12-28 05:57:47,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:47,474 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2021-12-28 05:57:47,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 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-28 05:57:47,475 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2021-12-28 05:57:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:57:47,475 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:47,475 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:47,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:57:47,475 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2021-12-28 05:57:47,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:47,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288645727] [2021-12-28 05:57:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:47,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:47,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:47,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288645727] [2021-12-28 05:57:47,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288645727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:47,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:47,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 05:57:47,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321156186] [2021-12-28 05:57:47,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:47,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 05:57:47,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:47,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 05:57:47,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:57:47,576 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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-28 05:57:48,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:48,034 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2021-12-28 05:57:48,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 05:57:48,034 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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 16 [2021-12-28 05:57:48,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:48,035 INFO L225 Difference]: With dead ends: 168 [2021-12-28 05:57:48,035 INFO L226 Difference]: Without dead ends: 168 [2021-12-28 05:57:48,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-28 05:57:48,035 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 233 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:48,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 355 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:57:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2021-12-28 05:57:48,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2021-12-28 05:57:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 153 states have internal predecessors, (166), 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-28 05:57:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2021-12-28 05:57:48,038 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 16 [2021-12-28 05:57:48,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:48,038 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2021-12-28 05:57:48,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 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-28 05:57:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2021-12-28 05:57:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 05:57:48,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:48,038 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:48,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:57:48,039 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:48,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:48,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1997554901, now seen corresponding path program 1 times [2021-12-28 05:57:48,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:48,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014157131] [2021-12-28 05:57:48,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:48,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:48,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:48,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014157131] [2021-12-28 05:57:48,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014157131] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:57:48,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370086368] [2021-12-28 05:57:48,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:48,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:57:48,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:57:48,100 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:57:48,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 05:57:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:48,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-28 05:57:48,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:57:48,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:57:48,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:57:48,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:57:48,328 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 21 treesize of output 20 [2021-12-28 05:57:48,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:57:48,334 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 21 treesize of output 20 [2021-12-28 05:57:48,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:57:48,350 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 21 treesize of output 20 [2021-12-28 05:57:48,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:57:48,357 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 21 treesize of output 20 [2021-12-28 05:57:48,453 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:57:48,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:57:48,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:57:48,460 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:57:48,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 10 [2021-12-28 05:57:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:48,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:57:48,822 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 19 [2021-12-28 05:57:48,825 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 17 [2021-12-28 05:57:48,831 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 23 treesize of output 21 [2021-12-28 05:57:48,848 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 22 treesize of output 20 [2021-12-28 05:57:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:48,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370086368] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:57:48,870 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:57:48,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-28 05:57:48,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025954078] [2021-12-28 05:57:48,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:57:48,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 05:57:48,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:48,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 05:57:48,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-28 05:57:48,872 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 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-28 05:57:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:49,105 INFO L93 Difference]: Finished difference Result 205 states and 221 transitions. [2021-12-28 05:57:49,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:57:49,105 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 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 21 [2021-12-28 05:57:49,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:49,106 INFO L225 Difference]: With dead ends: 205 [2021-12-28 05:57:49,106 INFO L226 Difference]: Without dead ends: 205 [2021-12-28 05:57:49,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2021-12-28 05:57:49,107 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 337 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:49,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 503 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 331 Invalid, 0 Unknown, 54 Unchecked, 0.2s Time] [2021-12-28 05:57:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-28 05:57:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 161. [2021-12-28 05:57:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 126 states have (on average 1.380952380952381) internal successors, (174), 160 states have internal predecessors, (174), 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-28 05:57:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2021-12-28 05:57:49,109 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 21 [2021-12-28 05:57:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:49,109 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2021-12-28 05:57:49,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 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-28 05:57:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2021-12-28 05:57:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-28 05:57:49,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:49,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:49,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 05:57:49,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-28 05:57:49,311 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:49,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:49,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2039573154, now seen corresponding path program 1 times [2021-12-28 05:57:49,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:49,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105044182] [2021-12-28 05:57:49,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:49,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:49,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:49,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105044182] [2021-12-28 05:57:49,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105044182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:49,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:49,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:57:49,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654713820] [2021-12-28 05:57:49,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:49,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:57:49,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:49,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:57:49,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:57:49,362 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-28 05:57:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:49,455 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2021-12-28 05:57:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:57:49,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2021-12-28 05:57:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:49,456 INFO L225 Difference]: With dead ends: 165 [2021-12-28 05:57:49,457 INFO L226 Difference]: Without dead ends: 165 [2021-12-28 05:57:49,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:57:49,457 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 25 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:49,458 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 328 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-28 05:57:49,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 160. [2021-12-28 05:57:49,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 125 states have (on average 1.368) internal successors, (171), 159 states have internal predecessors, (171), 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-28 05:57:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2021-12-28 05:57:49,460 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 21 [2021-12-28 05:57:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:49,460 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2021-12-28 05:57:49,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-28 05:57:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2021-12-28 05:57:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 05:57:49,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:49,461 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:49,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 05:57:49,462 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:49,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:49,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1819127547, now seen corresponding path program 1 times [2021-12-28 05:57:49,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:49,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753826133] [2021-12-28 05:57:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:49,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:49,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:49,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753826133] [2021-12-28 05:57:49,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753826133] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:49,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:49,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:57:49,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429607200] [2021-12-28 05:57:49,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:49,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:57:49,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:49,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:57:49,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:57:49,497 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-28 05:57:49,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:49,561 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2021-12-28 05:57:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:57:49,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2021-12-28 05:57:49,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:49,562 INFO L225 Difference]: With dead ends: 162 [2021-12-28 05:57:49,562 INFO L226 Difference]: Without dead ends: 162 [2021-12-28 05:57:49,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:57:49,563 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 20 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:49,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 279 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-28 05:57:49,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2021-12-28 05:57:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 124 states have (on average 1.3548387096774193) internal successors, (168), 157 states have internal predecessors, (168), 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-28 05:57:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 168 transitions. [2021-12-28 05:57:49,566 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 168 transitions. Word has length 22 [2021-12-28 05:57:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:49,567 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 168 transitions. [2021-12-28 05:57:49,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-28 05:57:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 168 transitions. [2021-12-28 05:57:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 05:57:49,568 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:49,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:49,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 05:57:49,569 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:49,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:49,569 INFO L85 PathProgramCache]: Analyzing trace with hash 391604008, now seen corresponding path program 1 times [2021-12-28 05:57:49,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:49,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175059798] [2021-12-28 05:57:49,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:49,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:49,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:49,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175059798] [2021-12-28 05:57:49,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175059798] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:49,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:49,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:57:49,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66846064] [2021-12-28 05:57:49,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:49,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:57:49,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:49,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:57:49,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:57:49,601 INFO L87 Difference]: Start difference. First operand 158 states and 168 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-28 05:57:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:49,711 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2021-12-28 05:57:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:57:49,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2021-12-28 05:57:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:49,712 INFO L225 Difference]: With dead ends: 157 [2021-12-28 05:57:49,712 INFO L226 Difference]: Without dead ends: 157 [2021-12-28 05:57:49,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-28 05:57:49,713 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:49,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 313 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-12-28 05:57:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2021-12-28 05:57:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.346774193548387) internal successors, (167), 156 states have internal predecessors, (167), 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-28 05:57:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2021-12-28 05:57:49,715 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 24 [2021-12-28 05:57:49,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:49,715 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2021-12-28 05:57:49,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-28 05:57:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2021-12-28 05:57:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-28 05:57:49,716 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:49,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:49,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 05:57:49,716 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:49,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash 391604009, now seen corresponding path program 1 times [2021-12-28 05:57:49,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:49,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795635297] [2021-12-28 05:57:49,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:49,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:49,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:49,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795635297] [2021-12-28 05:57:49,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795635297] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:49,779 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:49,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:57:49,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460638603] [2021-12-28 05:57:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:49,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:57:49,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:57:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:57:49,782 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-28 05:57:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:49,881 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2021-12-28 05:57:49,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:57:49,882 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 24 [2021-12-28 05:57:49,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:49,882 INFO L225 Difference]: With dead ends: 156 [2021-12-28 05:57:49,882 INFO L226 Difference]: Without dead ends: 156 [2021-12-28 05:57:49,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-28 05:57:49,883 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:49,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 303 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-28 05:57:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-12-28 05:57:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 155 states have internal predecessors, (166), 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-28 05:57:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 166 transitions. [2021-12-28 05:57:49,885 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 166 transitions. Word has length 24 [2021-12-28 05:57:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:49,886 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 166 transitions. [2021-12-28 05:57:49,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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-28 05:57:49,886 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 166 transitions. [2021-12-28 05:57:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 05:57:49,886 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:49,886 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:49,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:57:49,887 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:49,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash -264588155, now seen corresponding path program 1 times [2021-12-28 05:57:49,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:49,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705224605] [2021-12-28 05:57:49,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:49,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:49,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:49,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705224605] [2021-12-28 05:57:49,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705224605] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:49,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:49,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:57:49,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123041842] [2021-12-28 05:57:49,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:49,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:57:49,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:49,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:57:49,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:57:49,925 INFO L87 Difference]: Start difference. First operand 156 states and 166 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-28 05:57:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:49,987 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2021-12-28 05:57:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:57:49,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2021-12-28 05:57:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:49,988 INFO L225 Difference]: With dead ends: 155 [2021-12-28 05:57:49,988 INFO L226 Difference]: Without dead ends: 155 [2021-12-28 05:57:49,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:57:49,989 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 15 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:49,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 255 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-28 05:57:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2021-12-28 05:57:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 123 states have (on average 1.3252032520325203) internal successors, (163), 153 states have internal predecessors, (163), 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-28 05:57:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 163 transitions. [2021-12-28 05:57:49,991 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 163 transitions. Word has length 25 [2021-12-28 05:57:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:49,992 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 163 transitions. [2021-12-28 05:57:49,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-28 05:57:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 163 transitions. [2021-12-28 05:57:49,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 05:57:49,992 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:49,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:49,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 05:57:49,993 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:49,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:49,993 INFO L85 PathProgramCache]: Analyzing trace with hash 201988172, now seen corresponding path program 1 times [2021-12-28 05:57:49,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:49,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765645491] [2021-12-28 05:57:49,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:49,994 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:57:50,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:50,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765645491] [2021-12-28 05:57:50,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765645491] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:50,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:50,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:57:50,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007106411] [2021-12-28 05:57:50,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:50,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:57:50,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:50,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:57:50,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:57:50,015 INFO L87 Difference]: Start difference. First operand 154 states and 163 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-28 05:57:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:50,037 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2021-12-28 05:57:50,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:57:50,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2021-12-28 05:57:50,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:50,038 INFO L225 Difference]: With dead ends: 156 [2021-12-28 05:57:50,038 INFO L226 Difference]: Without dead ends: 156 [2021-12-28 05:57:50,038 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:57:50,039 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 72 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:50,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 114 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:57:50,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-28 05:57:50,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-12-28 05:57:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 125 states have (on average 1.32) internal successors, (165), 155 states have internal predecessors, (165), 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-28 05:57:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2021-12-28 05:57:50,041 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 27 [2021-12-28 05:57:50,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:50,041 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2021-12-28 05:57:50,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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-28 05:57:50,042 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2021-12-28 05:57:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 05:57:50,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:50,042 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:50,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 05:57:50,042 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:50,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:50,043 INFO L85 PathProgramCache]: Analyzing trace with hash -866016759, now seen corresponding path program 1 times [2021-12-28 05:57:50,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:50,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865848904] [2021-12-28 05:57:50,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:50,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:50,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:50,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:50,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865848904] [2021-12-28 05:57:50,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865848904] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:50,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:50,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:57:50,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015782813] [2021-12-28 05:57:50,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:50,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:57:50,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:50,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:57:50,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:57:50,089 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-28 05:57:50,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:50,184 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2021-12-28 05:57:50,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:57:50,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2021-12-28 05:57:50,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:50,186 INFO L225 Difference]: With dead ends: 169 [2021-12-28 05:57:50,186 INFO L226 Difference]: Without dead ends: 169 [2021-12-28 05:57:50,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:57:50,186 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 263 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:50,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 172 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:57:50,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-28 05:57:50,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2021-12-28 05:57:50,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 153 states have internal predecessors, (162), 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-28 05:57:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2021-12-28 05:57:50,189 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 27 [2021-12-28 05:57:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:50,189 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2021-12-28 05:57:50,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-28 05:57:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2021-12-28 05:57:50,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 05:57:50,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:50,190 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:50,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 05:57:50,191 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:50,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1099927530, now seen corresponding path program 1 times [2021-12-28 05:57:50,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:50,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897011890] [2021-12-28 05:57:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:50,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:50,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:50,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897011890] [2021-12-28 05:57:50,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897011890] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:50,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:50,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:57:50,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678989718] [2021-12-28 05:57:50,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:50,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:57:50,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:50,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:57:50,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:57:50,252 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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-28 05:57:50,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:50,446 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2021-12-28 05:57:50,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:57:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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 28 [2021-12-28 05:57:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:50,447 INFO L225 Difference]: With dead ends: 154 [2021-12-28 05:57:50,448 INFO L226 Difference]: Without dead ends: 154 [2021-12-28 05:57:50,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-12-28 05:57:50,448 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 57 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:50,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 348 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:57:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-28 05:57:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2021-12-28 05:57:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 124 states have (on average 1.2983870967741935) internal successors, (161), 152 states have internal predecessors, (161), 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-28 05:57:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 161 transitions. [2021-12-28 05:57:50,450 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 161 transitions. Word has length 28 [2021-12-28 05:57:50,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:50,450 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 161 transitions. [2021-12-28 05:57:50,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 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-28 05:57:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 161 transitions. [2021-12-28 05:57:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 05:57:50,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:50,451 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:50,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 05:57:50,451 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:50,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1099927531, now seen corresponding path program 1 times [2021-12-28 05:57:50,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:50,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914602831] [2021-12-28 05:57:50,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:50,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:50,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:50,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914602831] [2021-12-28 05:57:50,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914602831] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:50,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:57:50,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:57:50,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464561504] [2021-12-28 05:57:50,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:50,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:57:50,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:50,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:57:50,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:57:50,544 INFO L87 Difference]: Start difference. First operand 153 states and 161 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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-28 05:57:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:50,797 INFO L93 Difference]: Finished difference Result 149 states and 157 transitions. [2021-12-28 05:57:50,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:57:50,797 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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 28 [2021-12-28 05:57:50,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:50,798 INFO L225 Difference]: With dead ends: 149 [2021-12-28 05:57:50,798 INFO L226 Difference]: Without dead ends: 149 [2021-12-28 05:57:50,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-12-28 05:57:50,798 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 67 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:50,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 453 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:57:50,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-28 05:57:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 130. [2021-12-28 05:57:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 129 states have internal predecessors, (137), 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-28 05:57:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2021-12-28 05:57:50,800 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 28 [2021-12-28 05:57:50,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:50,801 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2021-12-28 05:57:50,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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-28 05:57:50,801 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2021-12-28 05:57:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 05:57:50,801 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:50,801 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:50,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-28 05:57:50,801 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:50,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:50,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2136034553, now seen corresponding path program 1 times [2021-12-28 05:57:50,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:50,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933227529] [2021-12-28 05:57:50,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:50,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:50,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:50,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933227529] [2021-12-28 05:57:50,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933227529] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:57:50,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942292227] [2021-12-28 05:57:50,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:50,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:57:50,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:57:50,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:57:50,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 05:57:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:50,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 05:57:50,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:57:50,952 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-28 05:57:50,983 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-28 05:57:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:57:50,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:57:50,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942292227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:57:50,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 05:57:50,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2021-12-28 05:57:50,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572268584] [2021-12-28 05:57:50,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:57:50,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:57:50,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:50,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:57:50,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:57:50,997 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-28 05:57:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:51,042 INFO L93 Difference]: Finished difference Result 139 states and 146 transitions. [2021-12-28 05:57:51,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:57:51,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2021-12-28 05:57:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:51,043 INFO L225 Difference]: With dead ends: 139 [2021-12-28 05:57:51,043 INFO L226 Difference]: Without dead ends: 139 [2021-12-28 05:57:51,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:57:51,043 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 6 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:51,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 252 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:57:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-28 05:57:51,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2021-12-28 05:57:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 132 states have internal predecessors, (140), 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-28 05:57:51,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2021-12-28 05:57:51,046 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 29 [2021-12-28 05:57:51,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:51,046 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2021-12-28 05:57:51,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-28 05:57:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2021-12-28 05:57:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-28 05:57:51,047 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:51,047 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:51,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 05:57:51,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-28 05:57:51,272 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:51,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:51,272 INFO L85 PathProgramCache]: Analyzing trace with hash 180762931, now seen corresponding path program 1 times [2021-12-28 05:57:51,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:51,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568406749] [2021-12-28 05:57:51,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:51,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:51,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:51,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568406749] [2021-12-28 05:57:51,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568406749] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:57:51,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334668840] [2021-12-28 05:57:51,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:51,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:57:51,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:57:51,388 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:57:51,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 05:57:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:51,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-28 05:57:51,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:57:51,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:57:51,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 11 treesize of output 7 [2021-12-28 05:57:51,496 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:57:51,497 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:57:51,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:57:51,501 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 21 treesize of output 20 [2021-12-28 05:57:51,530 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:57:51,530 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:57:51,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:57:51,534 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 21 treesize of output 20 [2021-12-28 05:57:51,597 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-28 05:57:51,601 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-28 05:57:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:57:51,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:57:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:57:51,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334668840] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:57:51,722 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:57:51,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2021-12-28 05:57:51,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736263786] [2021-12-28 05:57:51,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:57:51,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:57:51,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:51,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:57:51,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:57:51,723 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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-28 05:57:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:52,031 INFO L93 Difference]: Finished difference Result 181 states and 191 transitions. [2021-12-28 05:57:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 05:57:52,033 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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 30 [2021-12-28 05:57:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:52,034 INFO L225 Difference]: With dead ends: 181 [2021-12-28 05:57:52,034 INFO L226 Difference]: Without dead ends: 181 [2021-12-28 05:57:52,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-12-28 05:57:52,035 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 78 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:52,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 468 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:57:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-28 05:57:52,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 144. [2021-12-28 05:57:52,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 143 states have internal predecessors, (153), 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-28 05:57:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2021-12-28 05:57:52,037 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 30 [2021-12-28 05:57:52,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:52,037 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2021-12-28 05:57:52,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 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-28 05:57:52,037 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2021-12-28 05:57:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 05:57:52,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:52,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:52,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 05:57:52,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:57:52,247 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1308683207, now seen corresponding path program 1 times [2021-12-28 05:57:52,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:52,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075653397] [2021-12-28 05:57:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:52,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:57:52,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:52,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075653397] [2021-12-28 05:57:52,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075653397] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:57:52,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488048293] [2021-12-28 05:57:52,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:52,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:57:52,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:57:52,281 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:57:52,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-28 05:57:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:52,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 05:57:52,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:57:52,409 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 13 treesize of output 9 [2021-12-28 05:57:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:57:52,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:57:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:57:52,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488048293] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:57:52,466 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:57:52,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-12-28 05:57:52,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332217227] [2021-12-28 05:57:52,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:57:52,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:57:52,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:52,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:57:52,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:57:52,468 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-28 05:57:52,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:52,532 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2021-12-28 05:57:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:57:52,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 31 [2021-12-28 05:57:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:52,533 INFO L225 Difference]: With dead ends: 152 [2021-12-28 05:57:52,533 INFO L226 Difference]: Without dead ends: 129 [2021-12-28 05:57:52,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:57:52,534 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:52,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2021-12-28 05:57:52,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-28 05:57:52,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-28 05:57:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.280373831775701) internal successors, (137), 128 states have internal predecessors, (137), 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-28 05:57:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2021-12-28 05:57:52,535 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 31 [2021-12-28 05:57:52,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:52,536 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2021-12-28 05:57:52,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-28 05:57:52,536 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2021-12-28 05:57:52,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-28 05:57:52,536 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:52,536 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:52,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-28 05:57:52,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:57:52,755 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:52,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash 929038273, now seen corresponding path program 1 times [2021-12-28 05:57:52,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:52,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071615391] [2021-12-28 05:57:52,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:52,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:52,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:52,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071615391] [2021-12-28 05:57:52,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071615391] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:57:52,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943431745] [2021-12-28 05:57:52,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:52,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:57:52,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:57:52,965 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:57:52,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-28 05:57:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:53,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-28 05:57:53,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:57:53,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:57:53,086 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-28 05:57:53,122 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:57:53,123 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 11 treesize of output 11 [2021-12-28 05:57:53,136 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 11 treesize of output 7 [2021-12-28 05:57:53,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:57:53,143 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 21 treesize of output 20 [2021-12-28 05:57:53,198 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:57:53,198 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 29 treesize of output 30 [2021-12-28 05:57:53,202 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 20 treesize of output 22 [2021-12-28 05:57:53,223 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 16 treesize of output 8 [2021-12-28 05:57:53,241 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 16 treesize of output 18 [2021-12-28 05:57:53,261 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 16 treesize of output 18 [2021-12-28 05:57:53,312 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-28 05:57:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:53,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:57:53,358 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2021-12-28 05:57:53,371 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2021-12-28 05:57:53,375 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2021-12-28 05:57:53,385 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_915 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_913) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_912) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2021-12-28 05:57:53,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_913 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (v_ArrVal_915 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_913) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_912) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_915)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2021-12-28 05:57:53,407 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:57:53,407 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 38 treesize of output 39 [2021-12-28 05:57:53,409 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 70 treesize of output 62 [2021-12-28 05:57:53,414 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 29 treesize of output 27 [2021-12-28 05:57:53,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_908 Int) (v_ArrVal_915 (Array Int Int))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (or (and (not .cse0) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_908)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) (and (forall ((v_ArrVal_913 (Array Int Int)) (v_arrayElimCell_29 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_908)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_913) v_arrayElimCell_29 v_ArrVal_915) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) .cse0)))) is different from false [2021-12-28 05:57:54,185 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:57:54,190 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:57:54,190 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 2 case distinctions, treesize of input 63 treesize of output 55 [2021-12-28 05:57:54,194 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:57:54,196 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:57:54,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 92 [2021-12-28 05:57:54,203 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 92 treesize of output 80 [2021-12-28 05:57:54,210 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 12 treesize of output 8 [2021-12-28 05:57:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:54,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943431745] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:57:54,236 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:57:54,236 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 26 [2021-12-28 05:57:54,236 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711834518] [2021-12-28 05:57:54,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:57:54,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-28 05:57:54,237 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:57:54,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-28 05:57:54,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=305, Unknown=10, NotChecked=246, Total=650 [2021-12-28 05:57:54,238 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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-28 05:57:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:57:54,732 INFO L93 Difference]: Finished difference Result 221 states and 236 transitions. [2021-12-28 05:57:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-28 05:57:54,733 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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 35 [2021-12-28 05:57:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:57:54,734 INFO L225 Difference]: With dead ends: 221 [2021-12-28 05:57:54,734 INFO L226 Difference]: Without dead ends: 221 [2021-12-28 05:57:54,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=691, Unknown=10, NotChecked=378, Total=1332 [2021-12-28 05:57:54,735 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 353 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 850 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:57:54,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 487 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 584 Invalid, 0 Unknown, 850 Unchecked, 0.3s Time] [2021-12-28 05:57:54,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-28 05:57:54,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 155. [2021-12-28 05:57:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.2406015037593985) internal successors, (165), 154 states have internal predecessors, (165), 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-28 05:57:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2021-12-28 05:57:54,738 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 35 [2021-12-28 05:57:54,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:57:54,738 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2021-12-28 05:57:54,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.730769230769231) internal successors, (71), 26 states have internal predecessors, (71), 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-28 05:57:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2021-12-28 05:57:54,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 05:57:54,738 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:57:54,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:57:54,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-28 05:57:54,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-28 05:57:54,939 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:57:54,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:57:54,939 INFO L85 PathProgramCache]: Analyzing trace with hash 899162440, now seen corresponding path program 1 times [2021-12-28 05:57:54,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:57:54,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878878371] [2021-12-28 05:57:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:54,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:57:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:55,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:57:55,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878878371] [2021-12-28 05:57:55,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878878371] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:57:55,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480219082] [2021-12-28 05:57:55,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:57:55,097 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:57:55,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:57:55,098 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:57:55,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-28 05:57:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:57:55,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-28 05:57:55,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:57:55,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:57:55,252 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-28 05:57:55,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-28 05:57:55,288 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 11 treesize of output 7 [2021-12-28 05:57:55,378 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:57:55,378 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 28 treesize of output 29 [2021-12-28 05:57:55,466 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:57:55,466 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-28 05:57:55,501 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:57:55,501 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 28 treesize of output 29 [2021-12-28 05:57:55,668 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:57:55,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-28 05:57:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:57:55,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:57:56,099 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:57:56,100 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 38 treesize of output 31 [2021-12-28 05:57:56,108 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:57:56,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 252 treesize of output 227 [2021-12-28 05:57:56,113 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 212 treesize of output 204 [2021-12-28 05:57:56,126 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:57:56,126 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 204 treesize of output 196 [2021-12-28 05:58:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:02,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480219082] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:58:02,014 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:58:02,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 33 [2021-12-28 05:58:02,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871580905] [2021-12-28 05:58:02,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:58:02,015 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-28 05:58:02,015 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:02,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-28 05:58:02,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=936, Unknown=25, NotChecked=0, Total=1122 [2021-12-28 05:58:02,016 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand has 34 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:02,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:02,497 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2021-12-28 05:58:02,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-28 05:58:02,498 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-28 05:58:02,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:02,499 INFO L225 Difference]: With dead ends: 231 [2021-12-28 05:58:02,499 INFO L226 Difference]: Without dead ends: 231 [2021-12-28 05:58:02,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1334, Unknown=25, NotChecked=0, Total=1640 [2021-12-28 05:58:02,500 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 435 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1208 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:02,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [435 Valid, 852 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 731 Invalid, 0 Unknown, 1208 Unchecked, 0.3s Time] [2021-12-28 05:58:02,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-28 05:58:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 163. [2021-12-28 05:58:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 162 states have internal predecessors, (175), 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-28 05:58:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 175 transitions. [2021-12-28 05:58:02,502 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 175 transitions. Word has length 42 [2021-12-28 05:58:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:02,502 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 175 transitions. [2021-12-28 05:58:02,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.6666666666666665) internal successors, (121), 34 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 175 transitions. [2021-12-28 05:58:02,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 05:58:02,502 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:02,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:02,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:02,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:58:02,715 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:02,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash 899162441, now seen corresponding path program 1 times [2021-12-28 05:58:02,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:02,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294368145] [2021-12-28 05:58:02,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:02,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:02,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:02,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294368145] [2021-12-28 05:58:02,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294368145] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:58:02,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582532082] [2021-12-28 05:58:02,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:02,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:58:02,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:58:02,911 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:58:02,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-28 05:58:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:03,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-28 05:58:03,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:03,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:03,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:03,090 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:58:03,090 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 11 treesize of output 11 [2021-12-28 05:58:03,113 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 11 treesize of output 7 [2021-12-28 05:58:03,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:03,214 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:58:03,214 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 38 treesize of output 37 [2021-12-28 05:58:03,228 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 18 treesize of output 20 [2021-12-28 05:58:03,322 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 05:58:03,325 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-28 05:58:03,336 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 5 treesize of output 3 [2021-12-28 05:58:03,349 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:58:03,349 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-28 05:58:03,406 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:58:03,407 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 38 treesize of output 37 [2021-12-28 05:58:03,412 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 18 treesize of output 20 [2021-12-28 05:58:03,593 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:58:03,594 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 05:58:03,598 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:58:03,599 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:58:03,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 16 [2021-12-28 05:58:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:03,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:58:04,604 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:58:04,604 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 112 treesize of output 105 [2021-12-28 05:58:04,609 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:58:04,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 81 [2021-12-28 05:58:04,618 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:58:04,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 390 treesize of output 353 [2021-12-28 05:58:04,631 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:58:04,631 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1397 treesize of output 1340 [2021-12-28 05:58:04,660 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 1309 treesize of output 1285 [2021-12-28 05:58:04,669 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 1285 treesize of output 1237 [2021-12-28 05:58:04,677 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 1237 treesize of output 1189 [2021-12-28 05:58:04,691 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:58:04,691 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 1189 treesize of output 1134 [2021-12-28 05:58:04,701 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 1125 treesize of output 1117 [2021-12-28 05:58:04,710 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 1117 treesize of output 1101 [2021-12-28 05:58:04,719 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 1101 treesize of output 1089 [2021-12-28 05:58:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:07,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582532082] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:58:07,813 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:58:07,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 35 [2021-12-28 05:58:07,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527450689] [2021-12-28 05:58:07,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:58:07,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-28 05:58:07,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:07,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-28 05:58:07,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1125, Unknown=17, NotChecked=0, Total=1260 [2021-12-28 05:58:07,814 INFO L87 Difference]: Start difference. First operand 163 states and 175 transitions. Second operand has 36 states, 35 states have (on average 3.5428571428571427) internal successors, (124), 36 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:09,041 INFO L93 Difference]: Finished difference Result 231 states and 247 transitions. [2021-12-28 05:58:09,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-28 05:58:09,041 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.5428571428571427) internal successors, (124), 36 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-28 05:58:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:09,042 INFO L225 Difference]: With dead ends: 231 [2021-12-28 05:58:09,042 INFO L226 Difference]: Without dead ends: 231 [2021-12-28 05:58:09,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=440, Invalid=2623, Unknown=17, NotChecked=0, Total=3080 [2021-12-28 05:58:09,043 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 573 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 644 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:09,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [573 Valid, 770 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 917 Invalid, 0 Unknown, 644 Unchecked, 0.4s Time] [2021-12-28 05:58:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-28 05:58:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 166. [2021-12-28 05:58:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 144 states have (on average 1.2361111111111112) internal successors, (178), 165 states have internal predecessors, (178), 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-28 05:58:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2021-12-28 05:58:09,046 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 42 [2021-12-28 05:58:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:09,046 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2021-12-28 05:58:09,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.5428571428571427) internal successors, (124), 36 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2021-12-28 05:58:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 05:58:09,046 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:09,047 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:09,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:09,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:58:09,259 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:09,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1421280140, now seen corresponding path program 1 times [2021-12-28 05:58:09,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:09,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523965336] [2021-12-28 05:58:09,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:09,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:09,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:09,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523965336] [2021-12-28 05:58:09,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523965336] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:58:09,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132234796] [2021-12-28 05:58:09,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:09,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:58:09,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:58:09,675 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:58:09,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-28 05:58:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:09,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-28 05:58:09,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:09,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:09,814 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-28 05:58:09,859 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:58:09,860 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 11 treesize of output 11 [2021-12-28 05:58:09,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:58:09,907 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 21 treesize of output 20 [2021-12-28 05:58:09,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:10,015 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:58:10,015 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 29 treesize of output 30 [2021-12-28 05:58:10,019 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 20 treesize of output 22 [2021-12-28 05:58:10,050 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 16 treesize of output 8 [2021-12-28 05:58:10,068 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 16 treesize of output 18 [2021-12-28 05:58:10,097 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 16 treesize of output 18 [2021-12-28 05:58:10,114 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-28 05:58:10,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2021-12-28 05:58:10,126 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 16 treesize of output 18 [2021-12-28 05:58:10,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:10,206 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:58:10,206 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2021-12-28 05:58:10,209 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-28 05:58:10,233 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 24 treesize of output 12 [2021-12-28 05:58:10,245 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 16 treesize of output 18 [2021-12-28 05:58:10,256 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 16 treesize of output 18 [2021-12-28 05:58:10,315 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-28 05:58:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:10,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:58:10,353 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2021-12-28 05:58:10,359 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2021-12-28 05:58:10,363 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2021-12-28 05:58:10,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1277 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1278) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1277) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK)) is different from false [2021-12-28 05:58:10,374 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1277 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1278) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1277) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_1280)) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) is different from false [2021-12-28 05:58:10,383 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:58:10,383 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 33 treesize of output 34 [2021-12-28 05:58:10,385 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 60 treesize of output 52 [2021-12-28 05:58:10,388 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 24 treesize of output 22 [2021-12-28 05:58:10,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1274 (Array Int Int))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (or (and .cse0 (forall ((v_ArrVal_1278 (Array Int Int)) (v_arrayElimCell_88 Int)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1274) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1278) v_arrayElimCell_88 v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK))) (and (not .cse0) (= ~unnamed1~0~BLACK (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_1274) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))))) is different from false [2021-12-28 05:58:11,079 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:58:11,080 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 63 treesize of output 55 [2021-12-28 05:58:11,084 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 104 treesize of output 92 [2021-12-28 05:58:11,087 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 57 treesize of output 53 [2021-12-28 05:58:11,119 INFO L353 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2021-12-28 05:58:11,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61 [2021-12-28 05:58:11,727 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1280 (Array Int Int)) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int) (v_ArrVal_1269 Int) (v_ArrVal_1274 (Array Int Int))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| |c_ULTIMATE.start_main_~end~0#1.base|) (and .cse0 (forall ((v_ArrVal_1270 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1269)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1270) v_arrayElimCell_90 v_ArrVal_1274) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))) (and .cse0 (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_arrayElimCell_90)) (and (not .cse0) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_1269)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1274) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))))) is different from false [2021-12-28 05:58:16,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_93| Int) (v_ArrVal_1280 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_17| Int) (v_arrayElimCell_90 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_11| Int) (v_ArrVal_1269 Int) (v_ArrVal_1274 (Array Int Int))) (let ((.cse0 (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_17|))) (or (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_17|) 0)) (and (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_arrayElimCell_90) .cse0) (and (forall ((v_ArrVal_1270 (Array Int Int))) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_93| v_ArrVal_1269)) |v_ULTIMATE.start_main_#t~malloc3#1.base_17| v_ArrVal_1270) v_arrayElimCell_90 v_ArrVal_1274) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) .cse0) (= |v_ULTIMATE.start_main_#t~malloc7#1.base_11| |v_ULTIMATE.start_main_#t~malloc3#1.base_17|) (not (<= |v_ULTIMATE.start_main_~end~0#1.offset_93| |c_ULTIMATE.start_main_~list~0#1.offset|)) (and (not .cse0) (= ~unnamed1~0~BLACK (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_93| v_ArrVal_1269)) |v_ULTIMATE.start_main_#t~malloc3#1.base_17| v_ArrVal_1274) |v_ULTIMATE.start_main_#t~malloc7#1.base_11| v_ArrVal_1280) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))))))) is different from false [2021-12-28 05:58:16,417 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:58:16,421 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:58:16,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 61 [2021-12-28 05:58:16,425 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:58:16,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:58:16,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 92 [2021-12-28 05:58:16,441 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 92 treesize of output 80 [2021-12-28 05:58:16,448 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 12 treesize of output 8 [2021-12-28 05:58:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:16,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132234796] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:58:16,481 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:58:16,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 22] total 46 [2021-12-28 05:58:16,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177526752] [2021-12-28 05:58:16,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:58:16,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2021-12-28 05:58:16,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:58:16,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2021-12-28 05:58:16,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1173, Unknown=24, NotChecked=632, Total=2070 [2021-12-28 05:58:16,483 INFO L87 Difference]: Start difference. First operand 166 states and 178 transitions. Second operand has 46 states, 46 states have (on average 2.282608695652174) internal successors, (105), 46 states have internal predecessors, (105), 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-28 05:58:17,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:17,283 INFO L93 Difference]: Finished difference Result 425 states and 457 transitions. [2021-12-28 05:58:17,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-28 05:58:17,284 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.282608695652174) internal successors, (105), 46 states have internal predecessors, (105), 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 45 [2021-12-28 05:58:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:17,285 INFO L225 Difference]: With dead ends: 425 [2021-12-28 05:58:17,285 INFO L226 Difference]: Without dead ends: 425 [2021-12-28 05:58:17,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 69 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=503, Invalid=2367, Unknown=24, NotChecked=888, Total=3782 [2021-12-28 05:58:17,286 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 710 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 3910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3000 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:17,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [710 Valid, 911 Invalid, 3910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 783 Invalid, 0 Unknown, 3000 Unchecked, 0.4s Time] [2021-12-28 05:58:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-12-28 05:58:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 192. [2021-12-28 05:58:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 170 states have (on average 1.2058823529411764) internal successors, (205), 191 states have internal predecessors, (205), 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-28 05:58:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 205 transitions. [2021-12-28 05:58:17,290 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 205 transitions. Word has length 45 [2021-12-28 05:58:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:17,290 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 205 transitions. [2021-12-28 05:58:17,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.282608695652174) internal successors, (105), 46 states have internal predecessors, (105), 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-28 05:58:17,290 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 205 transitions. [2021-12-28 05:58:17,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-28 05:58:17,290 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:17,290 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:17,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-28 05:58:17,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-28 05:58:17,512 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:17,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1605357382, now seen corresponding path program 2 times [2021-12-28 05:58:17,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:58:17,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571837145] [2021-12-28 05:58:17,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:17,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:58:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:17,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:58:17,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571837145] [2021-12-28 05:58:17,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571837145] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:58:17,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738492606] [2021-12-28 05:58:17,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 05:58:17,722 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:58:17,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:58:17,723 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 05:58:17,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-28 05:58:17,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 05:58:17,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 05:58:17,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-28 05:58:17,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:17,951 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-28 05:58:17,952 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-28 05:58:17,967 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-28 05:58:17,967 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2021-12-28 05:58:18,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:58:18,039 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 29 treesize of output 28 [2021-12-28 05:58:18,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:58:18,047 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 29 treesize of output 28 [2021-12-28 05:58:18,774 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:58:18,777 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:58:18,787 INFO L353 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2021-12-28 05:58:18,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 64 [2021-12-28 05:58:18,790 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:58:18,803 INFO L353 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2021-12-28 05:58:18,803 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 40 [2021-12-28 05:58:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:18,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:58:24,234 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:58:24,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 3127 treesize of output 2863 [2021-12-28 05:58:24,359 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:58:24,360 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 10023 treesize of output 8705 [2021-12-28 05:58:24,519 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2021-12-28 05:58:24,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:24,724 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-12-28 05:58:24,725 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-28 05:58:24,727 INFO L158 Benchmark]: Toolchain (without parser) took 40649.10ms. Allocated memory was 62.9MB in the beginning and 318.8MB in the end (delta: 255.9MB). Free memory was 41.6MB in the beginning and 289.4MB in the end (delta: -247.8MB). Peak memory consumption was 193.1MB. Max. memory is 16.1GB. [2021-12-28 05:58:24,728 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 44.6MB in the beginning and 44.5MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 05:58:24,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.27ms. Allocated memory is still 62.9MB. Free memory was 41.4MB in the beginning and 38.3MB in the end (delta: 3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 05:58:24,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.02ms. Allocated memory is still 62.9MB. Free memory was 38.3MB in the beginning and 35.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 05:58:24,728 INFO L158 Benchmark]: Boogie Preprocessor took 55.68ms. Allocated memory is still 62.9MB. Free memory was 35.9MB in the beginning and 34.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 05:58:24,728 INFO L158 Benchmark]: RCFGBuilder took 572.08ms. Allocated memory is still 62.9MB. Free memory was 34.0MB in the beginning and 29.9MB in the end (delta: 4.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 05:58:24,728 INFO L158 Benchmark]: TraceAbstraction took 39612.28ms. Allocated memory was 62.9MB in the beginning and 318.8MB in the end (delta: 255.9MB). Free memory was 29.2MB in the beginning and 289.4MB in the end (delta: -260.2MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. [2021-12-28 05:58:24,729 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 62.9MB. Free memory was 44.6MB in the beginning and 44.5MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.27ms. Allocated memory is still 62.9MB. Free memory was 41.4MB in the beginning and 38.3MB in the end (delta: 3.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.02ms. Allocated memory is still 62.9MB. Free memory was 38.3MB in the beginning and 35.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.68ms. Allocated memory is still 62.9MB. Free memory was 35.9MB in the beginning and 34.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 572.08ms. Allocated memory is still 62.9MB. Free memory was 34.0MB in the beginning and 29.9MB in the end (delta: 4.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 39612.28ms. Allocated memory was 62.9MB in the beginning and 318.8MB in the end (delta: 255.9MB). Free memory was 29.2MB in the beginning and 289.4MB in the end (delta: -260.2MB). Peak memory consumption was 178.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-28 05:58:24,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:58:26,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:58:26,324 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:58:26,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:58:26,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:58:26,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:58:26,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:58:26,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:58:26,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:58:26,367 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:58:26,368 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:58:26,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:58:26,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:58:26,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:58:26,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:58:26,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:58:26,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:58:26,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:58:26,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:58:26,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:58:26,384 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:58:26,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:58:26,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:58:26,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:58:26,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:58:26,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:58:26,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:58:26,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:58:26,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:58:26,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:58:26,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:58:26,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:58:26,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:58:26,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:58:26,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:58:26,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:58:26,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:58:26,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:58:26,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:58:26,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:58:26,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:58:26,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-28 05:58:26,431 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:58:26,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:58:26,432 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:58:26,432 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:58:26,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:58:26,433 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:58:26,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:58:26,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:58:26,435 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:58:26,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:58:26,435 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:58:26,436 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:58:26,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:58:26,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:58:26,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:58:26,436 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:58:26,436 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:58:26,436 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 05:58:26,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:58:26,437 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:58:26,437 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-28 05:58:26,437 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-28 05:58:26,437 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:58:26,437 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:58:26,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:58:26,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:58:26,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:58:26,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:58:26,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:58:26,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:58:26,449 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-28 05:58:26,449 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-28 05:58:26,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-28 05:58:26,450 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2021-12-28 05:58:26,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:58:26,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:58:26,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:58:26,736 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:58:26,736 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:58:26,737 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2021-12-28 05:58:26,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e781204/30102ec12dd44f7fb1334166392bd72d/FLAG6a8e1116e [2021-12-28 05:58:27,190 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:58:27,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2021-12-28 05:58:27,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e781204/30102ec12dd44f7fb1334166392bd72d/FLAG6a8e1116e [2021-12-28 05:58:27,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e781204/30102ec12dd44f7fb1334166392bd72d [2021-12-28 05:58:27,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:58:27,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:58:27,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:58:27,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:58:27,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:58:27,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:58:27" (1/1) ... [2021-12-28 05:58:27,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ffdc58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27, skipping insertion in model container [2021-12-28 05:58:27,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:58:27" (1/1) ... [2021-12-28 05:58:27,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:58:27,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:58:27,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2021-12-28 05:58:27,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2021-12-28 05:58:27,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2021-12-28 05:58:27,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2021-12-28 05:58:27,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2021-12-28 05:58:27,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2021-12-28 05:58:27,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2021-12-28 05:58:27,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:58:27,866 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:58:27,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2021-12-28 05:58:27,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2021-12-28 05:58:27,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2021-12-28 05:58:27,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2021-12-28 05:58:27,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2021-12-28 05:58:27,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2021-12-28 05:58:27,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2021-12-28 05:58:27,916 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:58:27,940 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:58:27,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27 WrapperNode [2021-12-28 05:58:27,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:58:27,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:58:27,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:58:27,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:58:27,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27" (1/1) ... [2021-12-28 05:58:27,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27" (1/1) ... [2021-12-28 05:58:27,983 INFO L137 Inliner]: procedures = 122, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 158 [2021-12-28 05:58:27,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:58:27,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:58:27,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:58:27,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:58:27,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27" (1/1) ... [2021-12-28 05:58:27,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27" (1/1) ... [2021-12-28 05:58:27,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27" (1/1) ... [2021-12-28 05:58:28,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27" (1/1) ... [2021-12-28 05:58:28,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27" (1/1) ... [2021-12-28 05:58:28,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27" (1/1) ... [2021-12-28 05:58:28,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27" (1/1) ... [2021-12-28 05:58:28,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:58:28,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:58:28,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:58:28,028 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:58:28,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27" (1/1) ... [2021-12-28 05:58:28,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:58:28,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:58:28,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-28 05:58:28,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-28 05:58:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-28 05:58:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:58:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:58:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:58:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:58:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:58:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-28 05:58:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-28 05:58:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:58:28,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:58:28,173 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:58:28,174 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:58:28,690 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:58:28,695 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:58:28,696 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-12-28 05:58:28,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:58:28 BoogieIcfgContainer [2021-12-28 05:58:28,697 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:58:28,698 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:58:28,698 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:58:28,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:58:28,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:58:27" (1/3) ... [2021-12-28 05:58:28,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687e2a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:58:28, skipping insertion in model container [2021-12-28 05:58:28,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:58:27" (2/3) ... [2021-12-28 05:58:28,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687e2a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:58:28, skipping insertion in model container [2021-12-28 05:58:28,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:58:28" (3/3) ... [2021-12-28 05:58:28,702 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2021-12-28 05:58:28,711 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:58:28,711 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2021-12-28 05:58:28,755 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:58:28,759 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 05:58:28,760 INFO L340 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2021-12-28 05:58:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 82 states have (on average 2.231707317073171) internal successors, (183), 153 states have internal predecessors, (183), 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-28 05:58:28,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:58:28,780 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:28,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:58:28,781 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:28,786 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-28 05:58:28,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:28,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389325891] [2021-12-28 05:58:28,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:28,798 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:28,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:28,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:28,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-28 05:58:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:28,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:58:28,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:28,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:28,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:28,941 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:28,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389325891] [2021-12-28 05:58:28,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389325891] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:28,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:28,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:58:28,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095741299] [2021-12-28 05:58:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:28,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:58:28,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:28,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:58:28,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:28,979 INFO L87 Difference]: Start difference. First operand has 154 states, 82 states have (on average 2.231707317073171) internal successors, (183), 153 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:29,179 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2021-12-28 05:58:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:58:29,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-28 05:58:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:29,186 INFO L225 Difference]: With dead ends: 155 [2021-12-28 05:58:29,186 INFO L226 Difference]: Without dead ends: 151 [2021-12-28 05:58:29,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:29,190 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 135 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:29,190 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 93 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:29,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-28 05:58:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2021-12-28 05:58:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 83 states have (on average 1.855421686746988) internal successors, (154), 146 states have internal predecessors, (154), 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-28 05:58:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 154 transitions. [2021-12-28 05:58:29,217 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 154 transitions. Word has length 3 [2021-12-28 05:58:29,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:29,217 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 154 transitions. [2021-12-28 05:58:29,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:29,217 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 154 transitions. [2021-12-28 05:58:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:58:29,218 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:29,218 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:58:29,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:29,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:29,424 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:29,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-28 05:58:29,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:29,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703428866] [2021-12-28 05:58:29,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:29,425 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:29,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:29,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:29,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-28 05:58:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:29,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 05:58:29,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:29,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:29,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:29,510 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:29,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703428866] [2021-12-28 05:58:29,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703428866] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:29,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:29,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:58:29,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416934164] [2021-12-28 05:58:29,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:29,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:58:29,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:29,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:58:29,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:29,518 INFO L87 Difference]: Start difference. First operand 147 states and 154 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:29,726 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2021-12-28 05:58:29,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:58:29,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-28 05:58:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:29,728 INFO L225 Difference]: With dead ends: 164 [2021-12-28 05:58:29,728 INFO L226 Difference]: Without dead ends: 164 [2021-12-28 05:58:29,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:29,729 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 129 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:29,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 98 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-28 05:58:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2021-12-28 05:58:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 150 states have internal predecessors, (158), 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-28 05:58:29,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2021-12-28 05:58:29,736 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 3 [2021-12-28 05:58:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:29,736 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2021-12-28 05:58:29,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2021-12-28 05:58:29,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-28 05:58:29,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:29,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:29,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:29,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:29,937 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:29,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:29,938 INFO L85 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2021-12-28 05:58:29,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:29,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135926573] [2021-12-28 05:58:29,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:29,939 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:29,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:29,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:29,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-28 05:58:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:30,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 05:58:30,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:30,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:30,059 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-28 05:58:30,059 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-28 05:58:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:30,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:30,077 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:30,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135926573] [2021-12-28 05:58:30,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135926573] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:30,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:30,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:58:30,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192351223] [2021-12-28 05:58:30,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:30,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:58:30,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:30,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:58:30,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:58:30,078 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:30,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:30,340 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2021-12-28 05:58:30,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:58:30,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-28 05:58:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:30,342 INFO L225 Difference]: With dead ends: 152 [2021-12-28 05:58:30,342 INFO L226 Difference]: Without dead ends: 152 [2021-12-28 05:58:30,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:30,343 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 211 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:30,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 75 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-28 05:58:30,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2021-12-28 05:58:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 92 states have (on average 1.5978260869565217) internal successors, (147), 137 states have internal predecessors, (147), 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-28 05:58:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2021-12-28 05:58:30,355 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 8 [2021-12-28 05:58:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:30,355 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2021-12-28 05:58:30,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2021-12-28 05:58:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-28 05:58:30,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:30,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:30,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:30,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:30,556 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:30,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:30,557 INFO L85 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2021-12-28 05:58:30,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:30,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897034652] [2021-12-28 05:58:30,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:30,558 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:30,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:30,559 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:30,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-28 05:58:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:30,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 05:58:30,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:30,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:30,688 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:58:30,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-28 05:58:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:30,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:30,700 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:30,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897034652] [2021-12-28 05:58:30,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897034652] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:30,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:30,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:58:30,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368831014] [2021-12-28 05:58:30,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:30,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:58:30,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:30,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:58:30,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:58:30,701 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:31,015 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2021-12-28 05:58:31,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:58:31,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-28 05:58:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:31,016 INFO L225 Difference]: With dead ends: 176 [2021-12-28 05:58:31,016 INFO L226 Difference]: Without dead ends: 176 [2021-12-28 05:58:31,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:31,017 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 175 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:31,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 113 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:58:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-28 05:58:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 147. [2021-12-28 05:58:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 102 states have (on average 1.5588235294117647) internal successors, (159), 146 states have internal predecessors, (159), 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-28 05:58:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2021-12-28 05:58:31,023 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 8 [2021-12-28 05:58:31,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:31,024 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2021-12-28 05:58:31,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:31,024 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2021-12-28 05:58:31,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-28 05:58:31,024 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:31,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:31,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:31,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:31,231 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:31,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:31,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1116069405, now seen corresponding path program 1 times [2021-12-28 05:58:31,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:31,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606246838] [2021-12-28 05:58:31,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:31,232 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:31,233 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:31,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-28 05:58:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:31,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:58:31,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:31,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:31,299 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:31,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606246838] [2021-12-28 05:58:31,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606246838] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:31,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:31,300 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:58:31,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823595865] [2021-12-28 05:58:31,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:31,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:58:31,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:58:31,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:58:31,300 INFO L87 Difference]: Start difference. First operand 147 states and 159 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:31,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:31,496 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2021-12-28 05:58:31,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:58:31,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-28 05:58:31,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:31,497 INFO L225 Difference]: With dead ends: 161 [2021-12-28 05:58:31,497 INFO L226 Difference]: Without dead ends: 161 [2021-12-28 05:58:31,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:31,500 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 147 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:31,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 171 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-28 05:58:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 145. [2021-12-28 05:58:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 101 states have (on average 1.5346534653465347) internal successors, (155), 144 states have internal predecessors, (155), 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-28 05:58:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2021-12-28 05:58:31,514 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 10 [2021-12-28 05:58:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:31,514 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2021-12-28 05:58:31,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2021-12-28 05:58:31,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:58:31,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:31,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:31,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:31,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:31,717 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:31,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:31,718 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2021-12-28 05:58:31,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:31,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220198444] [2021-12-28 05:58:31,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:31,718 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:31,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:31,719 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:31,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-28 05:58:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:31,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 05:58:31,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:31,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:31,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:31,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-28 05:58:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:31,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:31,819 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:31,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220198444] [2021-12-28 05:58:31,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220198444] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:31,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:31,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:58:31,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966930739] [2021-12-28 05:58:31,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:31,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:58:31,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:31,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:58:31,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:31,821 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:32,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:32,098 INFO L93 Difference]: Finished difference Result 144 states and 153 transitions. [2021-12-28 05:58:32,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:58:32,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-28 05:58:32,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:32,099 INFO L225 Difference]: With dead ends: 144 [2021-12-28 05:58:32,099 INFO L226 Difference]: Without dead ends: 144 [2021-12-28 05:58:32,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-28 05:58:32,100 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 9 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:32,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 330 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:58:32,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-28 05:58:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-12-28 05:58:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.5148514851485149) internal successors, (153), 143 states have internal predecessors, (153), 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-28 05:58:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2021-12-28 05:58:32,103 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 11 [2021-12-28 05:58:32,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:32,103 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2021-12-28 05:58:32,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2021-12-28 05:58:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:58:32,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:32,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:32,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:32,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:32,304 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:32,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:32,305 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2021-12-28 05:58:32,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:32,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666371183] [2021-12-28 05:58:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:32,305 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:32,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:32,306 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:32,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-28 05:58:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:32,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 05:58:32,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:32,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:32,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:32,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:32,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-28 05:58:32,452 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-28 05:58:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:32,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:32,466 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:32,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666371183] [2021-12-28 05:58:32,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666371183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:32,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:32,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:58:32,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766710536] [2021-12-28 05:58:32,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:32,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:58:32,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:32,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:58:32,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:32,467 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:32,790 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2021-12-28 05:58:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:58:32,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-28 05:58:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:32,791 INFO L225 Difference]: With dead ends: 143 [2021-12-28 05:58:32,791 INFO L226 Difference]: Without dead ends: 143 [2021-12-28 05:58:32,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-28 05:58:32,792 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 4 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:32,792 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 315 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:58:32,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-28 05:58:32,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-12-28 05:58:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 101 states have (on average 1.495049504950495) internal successors, (151), 142 states have internal predecessors, (151), 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-28 05:58:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2021-12-28 05:58:32,795 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 11 [2021-12-28 05:58:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:32,795 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2021-12-28 05:58:32,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2021-12-28 05:58:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-28 05:58:32,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:32,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:32,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:33,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:33,002 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:33,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:33,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1485862716, now seen corresponding path program 1 times [2021-12-28 05:58:33,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:33,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166702690] [2021-12-28 05:58:33,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:33,002 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:33,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:33,004 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:33,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-28 05:58:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:33,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 05:58:33,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:33,064 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-28 05:58:33,106 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-28 05:58:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:33,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:33,113 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:33,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166702690] [2021-12-28 05:58:33,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166702690] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:33,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:33,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:58:33,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494568772] [2021-12-28 05:58:33,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:33,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:58:33,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:33,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:58:33,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:33,115 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:33,424 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2021-12-28 05:58:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:58:33,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-28 05:58:33,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:33,425 INFO L225 Difference]: With dead ends: 197 [2021-12-28 05:58:33,425 INFO L226 Difference]: Without dead ends: 197 [2021-12-28 05:58:33,426 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:58:33,426 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 87 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:33,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 298 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:58:33,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-28 05:58:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 148. [2021-12-28 05:58:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 106 states have (on average 1.471698113207547) internal successors, (156), 147 states have internal predecessors, (156), 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-28 05:58:33,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2021-12-28 05:58:33,429 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 13 [2021-12-28 05:58:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:33,429 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2021-12-28 05:58:33,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-28 05:58:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2021-12-28 05:58:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-28 05:58:33,429 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:33,429 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:33,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:33,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:33,630 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:33,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:33,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2021-12-28 05:58:33,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:33,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832017414] [2021-12-28 05:58:33,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:33,631 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:33,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:33,632 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:33,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-28 05:58:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:33,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 05:58:33,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:33,743 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-28 05:58:33,743 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 21 [2021-12-28 05:58:33,851 INFO L353 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-28 05:58:33,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2021-12-28 05:58:33,942 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 11 treesize of output 7 [2021-12-28 05:58:34,155 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:58:34,156 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 44 treesize of output 43 [2021-12-28 05:58:34,240 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 41 treesize of output 25 [2021-12-28 05:58:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:34,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:34,452 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:34,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832017414] [2021-12-28 05:58:34,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832017414] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:34,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:34,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:58:34,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296478625] [2021-12-28 05:58:34,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:34,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 05:58:34,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:34,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 05:58:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:58:34,453 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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-28 05:58:34,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:34,975 INFO L93 Difference]: Finished difference Result 220 states and 234 transitions. [2021-12-28 05:58:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 05:58:34,977 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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 15 [2021-12-28 05:58:34,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:34,977 INFO L225 Difference]: With dead ends: 220 [2021-12-28 05:58:34,977 INFO L226 Difference]: Without dead ends: 220 [2021-12-28 05:58:34,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-12-28 05:58:34,978 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 162 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:34,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 544 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 209 Invalid, 0 Unknown, 367 Unchecked, 0.3s Time] [2021-12-28 05:58:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-12-28 05:58:34,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 150. [2021-12-28 05:58:34,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 108 states have (on average 1.4722222222222223) internal successors, (159), 149 states have internal predecessors, (159), 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-28 05:58:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 159 transitions. [2021-12-28 05:58:34,980 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 159 transitions. Word has length 15 [2021-12-28 05:58:34,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:34,981 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 159 transitions. [2021-12-28 05:58:34,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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-28 05:58:34,981 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 159 transitions. [2021-12-28 05:58:34,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-28 05:58:34,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:34,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:34,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:35,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:35,188 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:35,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:35,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2021-12-28 05:58:35,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:35,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359986893] [2021-12-28 05:58:35,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:35,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:35,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:35,189 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:35,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-28 05:58:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:35,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-28 05:58:35,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:35,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:35,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:35,295 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:58:35,296 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 11 treesize of output 11 [2021-12-28 05:58:35,318 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 11 treesize of output 7 [2021-12-28 05:58:35,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:35,382 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:58:35,382 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 38 treesize of output 37 [2021-12-28 05:58:35,385 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 18 treesize of output 20 [2021-12-28 05:58:35,418 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 25 treesize of output 13 [2021-12-28 05:58:35,421 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 15 treesize of output 7 [2021-12-28 05:58:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:35,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:35,453 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:35,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359986893] [2021-12-28 05:58:35,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359986893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:35,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:35,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:58:35,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754954144] [2021-12-28 05:58:35,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:35,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:58:35,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:35,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:58:35,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:58:35,454 INFO L87 Difference]: Start difference. First operand 150 states and 159 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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-28 05:58:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:36,239 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2021-12-28 05:58:36,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 05:58:36,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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 15 [2021-12-28 05:58:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:36,240 INFO L225 Difference]: With dead ends: 167 [2021-12-28 05:58:36,240 INFO L226 Difference]: Without dead ends: 167 [2021-12-28 05:58:36,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-12-28 05:58:36,241 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 228 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:36,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 296 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-28 05:58:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-28 05:58:36,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2021-12-28 05:58:36,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 123 states have (on average 1.3902439024390243) internal successors, (171), 158 states have internal predecessors, (171), 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-28 05:58:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2021-12-28 05:58:36,244 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 15 [2021-12-28 05:58:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:36,244 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2021-12-28 05:58:36,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 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-28 05:58:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2021-12-28 05:58:36,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-28 05:58:36,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:36,245 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:36,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-28 05:58:36,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:36,451 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:36,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2044653013, now seen corresponding path program 1 times [2021-12-28 05:58:36,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:36,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632989417] [2021-12-28 05:58:36,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:36,452 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:36,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:36,453 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:36,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-28 05:58:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:36,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-28 05:58:36,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:36,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:36,542 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:36,561 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:58:36,561 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:58:36,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:58:36,565 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 21 treesize of output 20 [2021-12-28 05:58:36,595 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:58:36,596 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:58:36,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:58:36,601 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 21 treesize of output 20 [2021-12-28 05:58:36,669 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-28 05:58:36,674 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-28 05:58:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:36,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:58:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:36,777 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:36,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632989417] [2021-12-28 05:58:36,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632989417] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:58:36,777 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-28 05:58:36,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-12-28 05:58:36,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257834613] [2021-12-28 05:58:36,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-28 05:58:36,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:58:36,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:58:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:58:36,778 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:37,164 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2021-12-28 05:58:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 05:58:37,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-28 05:58:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:37,165 INFO L225 Difference]: With dead ends: 209 [2021-12-28 05:58:37,166 INFO L226 Difference]: Without dead ends: 209 [2021-12-28 05:58:37,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:58:37,166 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 100 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:37,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 322 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-28 05:58:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-28 05:58:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 166. [2021-12-28 05:58:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 130 states have (on average 1.376923076923077) internal successors, (179), 165 states have internal predecessors, (179), 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-28 05:58:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2021-12-28 05:58:37,169 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 20 [2021-12-28 05:58:37,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:37,169 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2021-12-28 05:58:37,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:37,169 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2021-12-28 05:58:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-28 05:58:37,170 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:37,170 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:37,185 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-28 05:58:37,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:37,375 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2086671266, now seen corresponding path program 1 times [2021-12-28 05:58:37,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:37,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528719918] [2021-12-28 05:58:37,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:37,376 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:37,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:37,377 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:37,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-28 05:58:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:37,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 05:58:37,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:37,443 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-28 05:58:37,489 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-28 05:58:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:37,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:37,502 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:37,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528719918] [2021-12-28 05:58:37,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528719918] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:37,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:37,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:58:37,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464802295] [2021-12-28 05:58:37,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:37,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:58:37,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:37,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:58:37,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:37,504 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:37,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:37,776 INFO L93 Difference]: Finished difference Result 185 states and 198 transitions. [2021-12-28 05:58:37,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:58:37,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-28 05:58:37,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:37,778 INFO L225 Difference]: With dead ends: 185 [2021-12-28 05:58:37,778 INFO L226 Difference]: Without dead ends: 185 [2021-12-28 05:58:37,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:58:37,778 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 55 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:37,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 284 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-28 05:58:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 166. [2021-12-28 05:58:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 130 states have (on average 1.3692307692307693) internal successors, (178), 165 states have internal predecessors, (178), 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-28 05:58:37,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2021-12-28 05:58:37,784 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 20 [2021-12-28 05:58:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:37,785 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2021-12-28 05:58:37,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2021-12-28 05:58:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-28 05:58:37,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:37,785 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:37,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:37,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:37,992 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:37,992 INFO L85 PathProgramCache]: Analyzing trace with hash 786329176, now seen corresponding path program 1 times [2021-12-28 05:58:37,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:37,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082026147] [2021-12-28 05:58:37,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:37,993 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:37,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:37,993 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:37,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-28 05:58:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:38,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 05:58:38,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:38,110 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-28 05:58:38,118 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-28 05:58:38,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:38,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:38,124 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:38,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082026147] [2021-12-28 05:58:38,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082026147] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:38,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:38,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:58:38,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120043618] [2021-12-28 05:58:38,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:38,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:58:38,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:38,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:58:38,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:58:38,126 INFO L87 Difference]: Start difference. First operand 166 states and 178 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:38,295 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2021-12-28 05:58:38,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:58:38,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-28 05:58:38,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:38,296 INFO L225 Difference]: With dead ends: 164 [2021-12-28 05:58:38,296 INFO L226 Difference]: Without dead ends: 164 [2021-12-28 05:58:38,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:38,297 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 19 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:38,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 273 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:38,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-12-28 05:58:38,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-12-28 05:58:38,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 163 states have internal predecessors, (175), 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-28 05:58:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2021-12-28 05:58:38,299 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 20 [2021-12-28 05:58:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:38,299 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2021-12-28 05:58:38,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 05:58:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2021-12-28 05:58:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 05:58:38,300 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:38,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:38,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:38,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:38,500 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:38,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:38,501 INFO L85 PathProgramCache]: Analyzing trace with hash 9814789, now seen corresponding path program 1 times [2021-12-28 05:58:38,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:38,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363535128] [2021-12-28 05:58:38,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:38,501 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:38,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:38,502 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:38,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-28 05:58:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:38,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 05:58:38,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:38,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:38,614 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:38,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-28 05:58:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:38,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:38,632 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:38,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363535128] [2021-12-28 05:58:38,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363535128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:38,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:38,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:58:38,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124769985] [2021-12-28 05:58:38,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:38,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:58:38,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:38,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:58:38,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:38,633 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-28 05:58:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:38,867 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2021-12-28 05:58:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:58:38,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2021-12-28 05:58:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:38,868 INFO L225 Difference]: With dead ends: 163 [2021-12-28 05:58:38,868 INFO L226 Difference]: Without dead ends: 163 [2021-12-28 05:58:38,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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-28 05:58:38,869 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:38,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 306 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:38,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-28 05:58:38,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-12-28 05:58:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 129 states have (on average 1.3488372093023255) internal successors, (174), 162 states have internal predecessors, (174), 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-28 05:58:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 174 transitions. [2021-12-28 05:58:38,874 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 174 transitions. Word has length 22 [2021-12-28 05:58:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:38,874 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 174 transitions. [2021-12-28 05:58:38,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-28 05:58:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 174 transitions. [2021-12-28 05:58:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 05:58:38,875 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:38,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:38,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:39,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:39,082 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:39,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash 9814790, now seen corresponding path program 1 times [2021-12-28 05:58:39,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:39,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962808378] [2021-12-28 05:58:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:39,083 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:39,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:39,084 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:39,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-28 05:58:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:39,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 05:58:39,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:39,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:39,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:39,210 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:39,227 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-28 05:58:39,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-28 05:58:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:39,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:39,240 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:39,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962808378] [2021-12-28 05:58:39,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962808378] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:39,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:39,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:58:39,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745227096] [2021-12-28 05:58:39,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:39,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:58:39,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:39,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:58:39,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:39,241 INFO L87 Difference]: Start difference. First operand 163 states and 174 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-28 05:58:39,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:39,510 INFO L93 Difference]: Finished difference Result 162 states and 173 transitions. [2021-12-28 05:58:39,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:58:39,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2021-12-28 05:58:39,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:39,511 INFO L225 Difference]: With dead ends: 162 [2021-12-28 05:58:39,511 INFO L226 Difference]: Without dead ends: 162 [2021-12-28 05:58:39,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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-28 05:58:39,511 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 2 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:39,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 298 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:39,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-28 05:58:39,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-12-28 05:58:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 129 states have (on average 1.3410852713178294) internal successors, (173), 161 states have internal predecessors, (173), 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-28 05:58:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2021-12-28 05:58:39,514 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 22 [2021-12-28 05:58:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:39,514 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2021-12-28 05:58:39,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-28 05:58:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2021-12-28 05:58:39,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 05:58:39,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:39,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:39,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-28 05:58:39,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:39,721 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:39,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:39,722 INFO L85 PathProgramCache]: Analyzing trace with hash 784847942, now seen corresponding path program 1 times [2021-12-28 05:58:39,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:39,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19326536] [2021-12-28 05:58:39,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:39,722 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:39,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:39,723 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:39,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-28 05:58:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:39,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-28 05:58:39,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:39,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:39,865 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:39,889 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-28 05:58:39,889 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-28 05:58:39,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:58:39,895 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 21 treesize of output 20 [2021-12-28 05:58:39,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, 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-28 05:58:39,917 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-28 05:58:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:39,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:39,926 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:39,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19326536] [2021-12-28 05:58:39,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19326536] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:39,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:39,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:58:39,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273140662] [2021-12-28 05:58:39,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:39,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:58:39,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:39,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:58:39,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:58:39,928 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-28 05:58:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:40,089 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2021-12-28 05:58:40,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:58:40,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2021-12-28 05:58:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:40,090 INFO L225 Difference]: With dead ends: 160 [2021-12-28 05:58:40,090 INFO L226 Difference]: Without dead ends: 160 [2021-12-28 05:58:40,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:40,091 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 14 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:40,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 250 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:58:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-28 05:58:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-28 05:58:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 128 states have (on average 1.328125) internal successors, (170), 159 states have internal predecessors, (170), 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-28 05:58:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 170 transitions. [2021-12-28 05:58:40,093 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 170 transitions. Word has length 23 [2021-12-28 05:58:40,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:40,093 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 170 transitions. [2021-12-28 05:58:40,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-28 05:58:40,093 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 170 transitions. [2021-12-28 05:58:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 05:58:40,094 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:40,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:40,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:40,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:40,294 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:40,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:40,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1675242166, now seen corresponding path program 1 times [2021-12-28 05:58:40,295 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:40,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136806410] [2021-12-28 05:58:40,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:40,295 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:40,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:40,296 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:40,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-28 05:58:40,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:40,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 05:58:40,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:40,415 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-28 05:58:40,440 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-28 05:58:40,456 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:58:40,456 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 11 treesize of output 11 [2021-12-28 05:58:40,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:40,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:40,471 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:40,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136806410] [2021-12-28 05:58:40,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136806410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:40,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:40,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:58:40,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883722696] [2021-12-28 05:58:40,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:40,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:58:40,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:40,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:58:40,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:58:40,472 INFO L87 Difference]: Start difference. First operand 160 states and 170 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-28 05:58:40,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:40,626 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2021-12-28 05:58:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:58:40,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2021-12-28 05:58:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:40,627 INFO L225 Difference]: With dead ends: 172 [2021-12-28 05:58:40,627 INFO L226 Difference]: Without dead ends: 172 [2021-12-28 05:58:40,627 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:58:40,628 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 154 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:40,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 94 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:58:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-12-28 05:58:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2021-12-28 05:58:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 127 states have (on average 1.31496062992126) internal successors, (167), 157 states have internal predecessors, (167), 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-28 05:58:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2021-12-28 05:58:40,630 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 25 [2021-12-28 05:58:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:40,630 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2021-12-28 05:58:40,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 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-28 05:58:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2021-12-28 05:58:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:58:40,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:40,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:40,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:40,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:40,839 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:40,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash -619225460, now seen corresponding path program 1 times [2021-12-28 05:58:40,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:40,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374292356] [2021-12-28 05:58:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:40,840 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:40,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:40,840 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:40,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-28 05:58:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:40,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 05:58:40,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 05:58:40,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:40,978 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:40,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374292356] [2021-12-28 05:58:40,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374292356] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:40,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:40,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:58:40,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89640105] [2021-12-28 05:58:40,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:40,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:58:40,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:40,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:58:40,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:58:40,979 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-28 05:58:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:41,029 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2021-12-28 05:58:41,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:58:41,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2021-12-28 05:58:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:41,030 INFO L225 Difference]: With dead ends: 160 [2021-12-28 05:58:41,031 INFO L226 Difference]: Without dead ends: 160 [2021-12-28 05:58:41,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-28 05:58:41,031 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 70 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:41,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 111 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:58:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-28 05:58:41,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2021-12-28 05:58:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 129 states have (on average 1.310077519379845) internal successors, (169), 159 states have internal predecessors, (169), 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-28 05:58:41,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2021-12-28 05:58:41,033 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 26 [2021-12-28 05:58:41,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:41,034 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2021-12-28 05:58:41,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 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-28 05:58:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2021-12-28 05:58:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:58:41,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:41,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:41,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:41,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:41,241 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:41,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:41,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1783743687, now seen corresponding path program 1 times [2021-12-28 05:58:41,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:41,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26312169] [2021-12-28 05:58:41,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:41,242 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:41,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:41,243 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:41,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-28 05:58:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:41,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-28 05:58:41,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:41,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:41,447 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 05:58:41,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2021-12-28 05:58:41,465 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 11 treesize of output 7 [2021-12-28 05:58:41,517 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:58:41,518 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 28 treesize of output 29 [2021-12-28 05:58:41,537 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 25 treesize of output 13 [2021-12-28 05:58:41,642 INFO L353 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-28 05:58:41,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2021-12-28 05:58:41,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:41,817 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:58:41,817 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2021-12-28 05:58:41,859 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 33 treesize of output 17 [2021-12-28 05:58:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:42,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:42,039 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:42,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26312169] [2021-12-28 05:58:42,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26312169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:42,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:42,040 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 05:58:42,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013652708] [2021-12-28 05:58:42,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:42,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 05:58:42,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:42,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 05:58:42,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:58:42,041 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 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-28 05:58:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:58:42,487 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2021-12-28 05:58:42,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-28 05:58:42,488 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 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 26 [2021-12-28 05:58:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:58:42,488 INFO L225 Difference]: With dead ends: 161 [2021-12-28 05:58:42,488 INFO L226 Difference]: Without dead ends: 161 [2021-12-28 05:58:42,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2021-12-28 05:58:42,489 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 97 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:58:42,489 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 323 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 181 Invalid, 0 Unknown, 325 Unchecked, 0.2s Time] [2021-12-28 05:58:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-28 05:58:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2021-12-28 05:58:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 129 states have (on average 1.302325581395349) internal successors, (168), 158 states have internal predecessors, (168), 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-28 05:58:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2021-12-28 05:58:42,491 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 26 [2021-12-28 05:58:42,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:58:42,491 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2021-12-28 05:58:42,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 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-28 05:58:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2021-12-28 05:58:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 05:58:42,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:58:42,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:58:42,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-28 05:58:42,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-28 05:58:42,700 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 67 more)] === [2021-12-28 05:58:42,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:58:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1783743688, now seen corresponding path program 1 times [2021-12-28 05:58:42,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:58:42,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053130549] [2021-12-28 05:58:42,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:58:42,701 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:58:42,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:58:42,701 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-28 05:58:42,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-28 05:58:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:58:42,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-28 05:58:42,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:58:42,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-28 05:58:42,886 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 05:58:42,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2021-12-28 05:58:42,892 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 6 treesize of output 5 [2021-12-28 05:58:42,909 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 11 treesize of output 7 [2021-12-28 05:58:42,969 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:58:42,969 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 37 treesize of output 36 [2021-12-28 05:58:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2021-12-28 05:58:43,081 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-28 05:58:43,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2021-12-28 05:58:43,085 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-28 05:58:43,111 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 11 treesize of output 7 [2021-12-28 05:58:43,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 05:58:43,194 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:58:43,195 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 38 treesize of output 37 [2021-12-28 05:58:43,198 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 18 treesize of output 20 [2021-12-28 05:58:43,219 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 25 treesize of output 13 [2021-12-28 05:58:43,222 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 15 treesize of output 7 [2021-12-28 05:58:43,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:58:43,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:58:43,278 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:58:43,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053130549] [2021-12-28 05:58:43,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053130549] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:58:43,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:58:43,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 05:58:43,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739738160] [2021-12-28 05:58:43,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:58:43,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 05:58:43,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:58:43,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 05:58:43,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:58:43,279 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 14 states have internal predecessors, (26), 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)