./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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-sorted-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:40:58,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:40:58,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:40:58,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:40:58,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:40:58,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:40:58,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:40:58,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:40:58,677 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:40:58,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:40:58,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:40:58,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:40:58,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:40:58,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:40:58,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:40:58,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:40:58,689 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:40:58,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:40:58,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:40:58,697 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:40:58,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:40:58,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:40:58,700 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:40:58,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:40:58,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:40:58,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:40:58,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:40:58,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:40:58,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:40:58,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:40:58,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:40:58,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:40:58,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:40:58,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:40:58,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:40:58,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:40:58,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:40:58,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:40:58,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:40:58,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:40:58,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:40:58,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-28 05:40:58,750 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:40:58,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:40:58,750 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:40:58,750 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:40:58,751 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:40:58,751 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:40:58,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:40:58,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:40:58,752 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:40:58,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:40:58,752 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:40:58,752 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:40:58,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:40:58,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:40:58,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:40:58,753 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:40:58,753 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:40:58,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:40:58,753 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:40:58,754 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:40:58,754 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:40:58,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:40:58,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:40:58,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:40:58,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:40:58,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:40:58,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:40:58,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:40:58,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:40:58,755 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-memcleanup) ) 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 -> 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 [2021-12-28 05:40:59,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:40:59,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:40:59,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:40:59,124 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:40:59,125 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:40:59,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-1.i [2021-12-28 05:40:59,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4ffbd24/7c266144aacf43bbbfc61bc9b80d44d7/FLAG322787b14 [2021-12-28 05:40:59,589 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:40:59,590 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i [2021-12-28 05:40:59,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4ffbd24/7c266144aacf43bbbfc61bc9b80d44d7/FLAG322787b14 [2021-12-28 05:40:59,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4ffbd24/7c266144aacf43bbbfc61bc9b80d44d7 [2021-12-28 05:40:59,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:40:59,615 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:40:59,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:40:59,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:40:59,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:40:59,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:40:59" (1/1) ... [2021-12-28 05:40:59,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa29494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:40:59, skipping insertion in model container [2021-12-28 05:40:59,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:40:59" (1/1) ... [2021-12-28 05:40:59,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:40:59,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:40:59,906 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-sorted-1.i[22384,22397] [2021-12-28 05:40:59,908 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-sorted-1.i[22614,22627] [2021-12-28 05:40:59,910 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-sorted-1.i[22989,23002] [2021-12-28 05:40:59,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-sorted-1.i[23053,23066] [2021-12-28 05:40:59,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-sorted-1.i[23184,23197] [2021-12-28 05:40:59,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-sorted-1.i[23248,23261] [2021-12-28 05:40:59,916 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:40:59,923 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:40:59,940 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-sorted-1.i[22384,22397] [2021-12-28 05:40:59,942 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-sorted-1.i[22614,22627] [2021-12-28 05:40:59,944 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-sorted-1.i[22989,23002] [2021-12-28 05:40:59,944 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-sorted-1.i[23053,23066] [2021-12-28 05:40:59,945 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-sorted-1.i[23184,23197] [2021-12-28 05:40:59,945 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-sorted-1.i[23248,23261] [2021-12-28 05:40:59,946 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:40:59,967 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:40:59,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:40:59 WrapperNode [2021-12-28 05:40:59,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:40:59,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:40:59,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:40:59,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:40:59,973 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:40:59" (1/1) ... [2021-12-28 05:40:59,993 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:40:59" (1/1) ... [2021-12-28 05:41:00,013 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2021-12-28 05:41:00,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:00,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:41:00,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:41:00,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:41:00,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:40:59" (1/1) ... [2021-12-28 05:41:00,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:40:59" (1/1) ... [2021-12-28 05:41:00,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:40:59" (1/1) ... [2021-12-28 05:41:00,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:40:59" (1/1) ... [2021-12-28 05:41:00,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:40:59" (1/1) ... [2021-12-28 05:41:00,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:40:59" (1/1) ... [2021-12-28 05:41:00,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:40:59" (1/1) ... [2021-12-28 05:41:00,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:41:00,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:41:00,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:41:00,053 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:41:00,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:40:59" (1/1) ... [2021-12-28 05:41:00,057 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:41:00,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:00,075 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:41:00,087 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:41:00,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 05:41:00,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 05:41:00,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:41:00,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:41:00,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:41:00,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:41:00,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:41:00,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:41:00,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:41:00,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:41:00,190 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:41:00,191 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:41:00,662 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:41:00,669 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:41:00,674 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-12-28 05:41:00,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:00 BoogieIcfgContainer [2021-12-28 05:41:00,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:41:00,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:41:00,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:41:00,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:41:00,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:40:59" (1/3) ... [2021-12-28 05:41:00,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dba42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:00, skipping insertion in model container [2021-12-28 05:41:00,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:40:59" (2/3) ... [2021-12-28 05:41:00,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dba42c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:00, skipping insertion in model container [2021-12-28 05:41:00,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:00" (3/3) ... [2021-12-28 05:41:00,683 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2021-12-28 05:41:00,687 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:41:00,687 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-12-28 05:41:00,723 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:41:00,730 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:41:00,731 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-12-28 05:41:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 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:41:00,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:41:00,752 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:00,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:41:00,753 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:00,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-28 05:41:00,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:00,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907739411] [2021-12-28 05:41:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:00,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:00,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:00,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:00,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907739411] [2021-12-28 05:41:00,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907739411] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:00,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:00,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:00,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964328402] [2021-12-28 05:41:00,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:00,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:00,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:00,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:00,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:00,909 INFO L87 Difference]: Start difference. First operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 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:41:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:01,065 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2021-12-28 05:41:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:01,067 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:41:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:01,073 INFO L225 Difference]: With dead ends: 182 [2021-12-28 05:41:01,073 INFO L226 Difference]: Without dead ends: 178 [2021-12-28 05:41:01,074 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:41:01,076 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:01,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 118 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-28 05:41:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2021-12-28 05:41:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 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:41:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2021-12-28 05:41:01,107 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 3 [2021-12-28 05:41:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:01,108 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2021-12-28 05:41:01,108 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:41:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2021-12-28 05:41:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:41:01,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:01,109 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:41:01,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:41:01,109 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:01,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:01,110 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-28 05:41:01,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:01,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629170628] [2021-12-28 05:41:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:01,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:01,140 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:41:01,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:01,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629170628] [2021-12-28 05:41:01,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629170628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:01,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:01,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:01,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702136043] [2021-12-28 05:41:01,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:01,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:01,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:01,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:01,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:01,144 INFO L87 Difference]: Start difference. First operand 174 states and 185 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:41:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:01,236 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2021-12-28 05:41:01,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:01,237 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:41:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:01,238 INFO L225 Difference]: With dead ends: 175 [2021-12-28 05:41:01,238 INFO L226 Difference]: Without dead ends: 175 [2021-12-28 05:41:01,238 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:41:01,239 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 167 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 116 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:41:01,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 116 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:01,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-28 05:41:01,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2021-12-28 05:41:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 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:41:01,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2021-12-28 05:41:01,254 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 3 [2021-12-28 05:41:01,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:01,254 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2021-12-28 05:41:01,254 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:41:01,254 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2021-12-28 05:41:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 05:41:01,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:01,255 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:01,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:41:01,255 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:01,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2021-12-28 05:41:01,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:01,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416497785] [2021-12-28 05:41:01,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:01,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:01,308 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:41:01,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:01,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416497785] [2021-12-28 05:41:01,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416497785] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:01,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:01,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:01,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511942994] [2021-12-28 05:41:01,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:01,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:01,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:01,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:01,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:01,311 INFO L87 Difference]: Start difference. First operand 171 states and 182 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:41:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:01,454 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2021-12-28 05:41:01,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:01,454 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:41:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:01,455 INFO L225 Difference]: With dead ends: 178 [2021-12-28 05:41:01,455 INFO L226 Difference]: Without dead ends: 178 [2021-12-28 05:41:01,456 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:41:01,457 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 294 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:01,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 89 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-28 05:41:01,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2021-12-28 05:41:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 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:41:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2021-12-28 05:41:01,464 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 9 [2021-12-28 05:41:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:01,465 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2021-12-28 05:41:01,465 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:41:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2021-12-28 05:41:01,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 05:41:01,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:01,465 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:01,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:41:01,466 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:01,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:01,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2021-12-28 05:41:01,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:01,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443579628] [2021-12-28 05:41:01,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:01,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:01,543 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:41:01,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:01,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443579628] [2021-12-28 05:41:01,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443579628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:01,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:01,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 05:41:01,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259884368] [2021-12-28 05:41:01,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:01,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:41:01,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:01,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:41:01,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:41:01,546 INFO L87 Difference]: Start difference. First operand 167 states and 189 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:41:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:01,784 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2021-12-28 05:41:01,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:01,785 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:41:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:01,785 INFO L225 Difference]: With dead ends: 258 [2021-12-28 05:41:01,785 INFO L226 Difference]: Without dead ends: 258 [2021-12-28 05:41:01,786 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:41:01,786 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 437 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:01,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 130 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-28 05:41:01,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2021-12-28 05:41:01,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 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:41:01,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2021-12-28 05:41:01,794 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 9 [2021-12-28 05:41:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:01,795 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2021-12-28 05:41:01,795 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:41:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2021-12-28 05:41:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:41:01,795 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:01,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:01,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:41:01,796 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:01,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:01,796 INFO L85 PathProgramCache]: Analyzing trace with hash 233093812, now seen corresponding path program 1 times [2021-12-28 05:41:01,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:01,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425019259] [2021-12-28 05:41:01,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:01,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:01,823 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:41:01,823 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:01,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425019259] [2021-12-28 05:41:01,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425019259] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:01,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:01,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:01,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645679101] [2021-12-28 05:41:01,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:01,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:01,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:01,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:01,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:01,825 INFO L87 Difference]: Start difference. First operand 220 states and 264 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:41:01,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:01,839 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2021-12-28 05:41:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:01,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:41:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:01,842 INFO L225 Difference]: With dead ends: 266 [2021-12-28 05:41:01,842 INFO L226 Difference]: Without dead ends: 266 [2021-12-28 05:41:01,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:41:01,843 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:01,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 235 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:01,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-12-28 05:41:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2021-12-28 05:41:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 states have internal predecessors, (284), 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:41:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2021-12-28 05:41:01,850 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 11 [2021-12-28 05:41:01,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:01,850 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2021-12-28 05:41:01,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:41:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2021-12-28 05:41:01,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 05:41:01,851 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:01,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:01,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:41:01,851 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:01,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:01,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2021-12-28 05:41:01,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:01,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257496144] [2021-12-28 05:41:01,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:01,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:01,929 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:41:01,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:01,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257496144] [2021-12-28 05:41:01,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257496144] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:01,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:01,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:01,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529712746] [2021-12-28 05:41:01,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:01,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:01,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:01,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:01,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:01,931 INFO L87 Difference]: Start difference. First operand 233 states and 284 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:41:02,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:02,074 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2021-12-28 05:41:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:41:02,074 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:41:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:02,075 INFO L225 Difference]: With dead ends: 232 [2021-12-28 05:41:02,075 INFO L226 Difference]: Without dead ends: 232 [2021-12-28 05:41:02,075 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:41:02,076 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 6 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:02,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 406 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:02,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-28 05:41:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2021-12-28 05:41:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 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:41:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2021-12-28 05:41:02,081 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 12 [2021-12-28 05:41:02,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:02,081 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2021-12-28 05:41:02,081 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:41:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2021-12-28 05:41:02,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-28 05:41:02,082 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:02,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:02,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:41:02,082 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:02,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:02,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2021-12-28 05:41:02,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:02,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031027346] [2021-12-28 05:41:02,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:02,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:02,120 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:41:02,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:02,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031027346] [2021-12-28 05:41:02,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031027346] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:02,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:02,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:02,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846639832] [2021-12-28 05:41:02,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:02,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:02,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:02,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:02,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:02,123 INFO L87 Difference]: Start difference. First operand 232 states and 281 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:41:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:02,256 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2021-12-28 05:41:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:02,256 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:41:02,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:02,257 INFO L225 Difference]: With dead ends: 231 [2021-12-28 05:41:02,257 INFO L226 Difference]: Without dead ends: 231 [2021-12-28 05:41:02,257 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:41:02,258 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 7 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:02,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 426 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:02,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-28 05:41:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2021-12-28 05:41:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 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:41:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2021-12-28 05:41:02,263 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 12 [2021-12-28 05:41:02,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:02,263 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2021-12-28 05:41:02,263 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:41:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2021-12-28 05:41:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:41:02,264 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:02,264 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:41:02,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:41:02,264 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:02,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2021-12-28 05:41:02,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:02,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395313329] [2021-12-28 05:41:02,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:02,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:02,343 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:41:02,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:02,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395313329] [2021-12-28 05:41:02,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395313329] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:02,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:02,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:41:02,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032065049] [2021-12-28 05:41:02,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:02,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:41:02,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:02,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:41:02,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:41:02,346 INFO L87 Difference]: Start difference. First operand 231 states and 278 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:41:02,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:02,625 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2021-12-28 05:41:02,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:41:02,625 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:41:02,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:02,626 INFO L225 Difference]: With dead ends: 237 [2021-12-28 05:41:02,626 INFO L226 Difference]: Without dead ends: 237 [2021-12-28 05:41:02,627 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:41:02,627 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 291 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:02,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 289 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2021-12-28 05:41:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2021-12-28 05:41:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 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:41:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2021-12-28 05:41:02,644 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 16 [2021-12-28 05:41:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:02,644 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2021-12-28 05:41:02,644 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:41:02,645 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2021-12-28 05:41:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 05:41:02,645 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:02,645 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:41:02,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:41:02,645 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:02,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:02,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2021-12-28 05:41:02,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:02,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650403718] [2021-12-28 05:41:02,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:02,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:02,849 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:41:02,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:02,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650403718] [2021-12-28 05:41:02,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650403718] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:02,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:02,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 05:41:02,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322069637] [2021-12-28 05:41:02,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:02,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 05:41:02,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:02,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 05:41:02,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:41:02,856 INFO L87 Difference]: Start difference. First operand 230 states and 276 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:41:03,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:03,504 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2021-12-28 05:41:03,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 05:41:03,504 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:41:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:03,505 INFO L225 Difference]: With dead ends: 232 [2021-12-28 05:41:03,505 INFO L226 Difference]: Without dead ends: 232 [2021-12-28 05:41:03,505 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:41:03,506 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 288 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:03,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 388 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:41:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-28 05:41:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2021-12-28 05:41:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 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:41:03,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2021-12-28 05:41:03,511 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 16 [2021-12-28 05:41:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:03,511 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2021-12-28 05:41:03,511 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:41:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2021-12-28 05:41:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-28 05:41:03,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:03,512 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] [2021-12-28 05:41:03,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:41:03,513 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash -961820477, now seen corresponding path program 1 times [2021-12-28 05:41:03,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:03,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843813213] [2021-12-28 05:41:03,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:03,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 05:41:03,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:03,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843813213] [2021-12-28 05:41:03,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843813213] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:03,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:03,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:03,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801931650] [2021-12-28 05:41:03,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:03,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:03,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:03,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:03,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:03,612 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:41:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:03,738 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2021-12-28 05:41:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:41:03,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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 25 [2021-12-28 05:41:03,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:03,739 INFO L225 Difference]: With dead ends: 253 [2021-12-28 05:41:03,740 INFO L226 Difference]: Without dead ends: 253 [2021-12-28 05:41:03,740 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:41:03,741 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 295 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:03,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 202 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 05:41:03,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-12-28 05:41:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 214. [2021-12-28 05:41:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 213 states have internal predecessors, (254), 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:41:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2021-12-28 05:41:03,746 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 25 [2021-12-28 05:41:03,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:03,748 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2021-12-28 05:41:03,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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:41:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2021-12-28 05:41:03,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 05:41:03,748 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:03,749 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] [2021-12-28 05:41:03,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:41:03,749 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:03,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912174, now seen corresponding path program 1 times [2021-12-28 05:41:03,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:03,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225586292] [2021-12-28 05:41:03,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:03,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:03,973 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:41:03,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:03,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225586292] [2021-12-28 05:41:03,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225586292] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:03,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764721904] [2021-12-28 05:41:03,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:03,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:03,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:03,988 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:41:04,019 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:41:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:04,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-28 05:41:04,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:04,140 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:41:04,251 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:04,252 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:41:04,294 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:41:04,393 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:04,394 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 19 treesize of output 22 [2021-12-28 05:41:04,495 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:04,495 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 22 treesize of output 22 [2021-12-28 05:41:04,583 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:04,583 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:41:04,733 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:04,735 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:04,735 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:41:04,741 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:41:04,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:04,973 INFO L353 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2021-12-28 05:41:04,974 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 19 treesize of output 18 [2021-12-28 05:41:04,983 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2021-12-28 05:41:04,996 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0) (= |c_ULTIMATE.start_main_#t~mem5#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) is different from false [2021-12-28 05:41:05,009 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2021-12-28 05:41:05,047 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) .cse1))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2021-12-28 05:41:05,062 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_334))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))))) is different from false [2021-12-28 05:41:05,097 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:05,097 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 51 treesize of output 36 [2021-12-28 05:41:05,105 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:05,105 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 170 treesize of output 137 [2021-12-28 05:41:05,111 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 122 treesize of output 114 [2021-12-28 05:41:05,118 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:05,119 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 114 treesize of output 102 [2021-12-28 05:41:05,823 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:41:05,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764721904] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 05:41:05,824 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 05:41:05,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2021-12-28 05:41:05,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713423090] [2021-12-28 05:41:05,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 05:41:05,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-28 05:41:05,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:41:05,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-28 05:41:05,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=780, Unknown=8, NotChecked=300, Total=1190 [2021-12-28 05:41:05,826 INFO L87 Difference]: Start difference. First operand 214 states and 254 transitions. Second operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 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:41:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:07,507 INFO L93 Difference]: Finished difference Result 505 states and 581 transitions. [2021-12-28 05:41:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-28 05:41:07,507 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 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:41:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:07,509 INFO L225 Difference]: With dead ends: 505 [2021-12-28 05:41:07,509 INFO L226 Difference]: Without dead ends: 505 [2021-12-28 05:41:07,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=354, Invalid=1728, Unknown=8, NotChecked=460, Total=2550 [2021-12-28 05:41:07,510 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 773 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1883 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:07,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [773 Valid, 1654 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1611 Invalid, 0 Unknown, 1883 Unchecked, 1.0s Time] [2021-12-28 05:41:07,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2021-12-28 05:41:07,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 239. [2021-12-28 05:41:07,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 states have internal predecessors, (284), 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:41:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 284 transitions. [2021-12-28 05:41:07,515 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 284 transitions. Word has length 31 [2021-12-28 05:41:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:07,515 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 284 transitions. [2021-12-28 05:41:07,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 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:41:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 284 transitions. [2021-12-28 05:41:07,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-28 05:41:07,516 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:07,516 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] [2021-12-28 05:41:07,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:07,729 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:41:07,729 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912173, now seen corresponding path program 1 times [2021-12-28 05:41:07,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:41:07,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081730818] [2021-12-28 05:41:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:07,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:41:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:07,968 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:41:07,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:41:07,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081730818] [2021-12-28 05:41:07,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081730818] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 05:41:07,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355285811] [2021-12-28 05:41:07,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:07,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 05:41:07,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:07,974 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:41:07,975 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:41:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:08,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-28 05:41:08,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:08,080 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:41:08,166 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:41:08,177 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:08,178 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:41:08,227 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:41:08,232 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:41:08,330 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:08,331 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:41:08,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 18 treesize of output 20 [2021-12-28 05:41:08,424 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:08,424 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:41:08,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 05:41:08,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-28 05:41:08,481 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:08,481 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:41:08,485 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:41:08,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:08,646 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:41:08,649 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 05:41:08,650 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:08,650 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:41:08,668 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:41:08,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:11,573 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:11,574 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:41:11,579 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:11,583 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:41:11,593 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:11,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 688 treesize of output 619 [2021-12-28 05:41:11,611 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:11,611 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 3027 treesize of output 2898 [2021-12-28 05:41:11,658 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 2867 treesize of output 2739 [2021-12-28 05:41:11,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 2739 treesize of output 2675 [2021-12-28 05:41:11,704 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 2675 treesize of output 2547 [2021-12-28 05:41:11,725 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:11,726 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 2547 treesize of output 2384 [2021-12-28 05:41:11,740 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 2375 treesize of output 2367 [2021-12-28 05:41:11,769 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 2367 treesize of output 2363 [2021-12-28 05:41:11,784 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 2363 treesize of output 2355 [2021-12-28 05:41:11,807 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2021-12-28 05:41:11,847 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:41:12,024 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,SelfDestructingSolverStorable11 [2021-12-28 05:41:12,024 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:41:12,029 INFO L158 Benchmark]: Toolchain (without parser) took 12412.03ms. Allocated memory was 50.3MB in the beginning and 180.4MB in the end (delta: 130.0MB). Free memory was 24.6MB in the beginning and 155.1MB in the end (delta: -130.4MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2021-12-28 05:41:12,029 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 50.3MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 41.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 05:41:12,029 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.31ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 24.4MB in the beginning and 39.9MB in the end (delta: -15.6MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2021-12-28 05:41:12,029 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.15ms. Allocated memory is still 65.0MB. Free memory was 39.7MB in the beginning and 37.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 05:41:12,029 INFO L158 Benchmark]: Boogie Preprocessor took 37.84ms. Allocated memory is still 65.0MB. Free memory was 37.5MB in the beginning and 35.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 05:41:12,030 INFO L158 Benchmark]: RCFGBuilder took 624.57ms. Allocated memory is still 65.0MB. Free memory was 35.4MB in the beginning and 41.3MB in the end (delta: -5.9MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2021-12-28 05:41:12,030 INFO L158 Benchmark]: TraceAbstraction took 11349.32ms. Allocated memory was 65.0MB in the beginning and 180.4MB in the end (delta: 115.3MB). Free memory was 41.0MB in the beginning and 155.1MB in the end (delta: -114.0MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2021-12-28 05:41:12,031 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 50.3MB. Free memory was 32.5MB in the beginning and 32.4MB in the end (delta: 41.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.31ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 24.4MB in the beginning and 39.9MB in the end (delta: -15.6MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.15ms. Allocated memory is still 65.0MB. Free memory was 39.7MB in the beginning and 37.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.84ms. Allocated memory is still 65.0MB. Free memory was 37.5MB in the beginning and 35.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 624.57ms. Allocated memory is still 65.0MB. Free memory was 35.4MB in the beginning and 41.3MB in the end (delta: -5.9MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11349.32ms. Allocated memory was 65.0MB in the beginning and 180.4MB in the end (delta: 115.3MB). Free memory was 41.0MB in the beginning and 155.1MB in the end (delta: -114.0MB). Peak memory consumption was 100.2MB. 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:41:12,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-sorted-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 05:41:13,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:41:13,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:41:13,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:41:13,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:41:13,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:41:13,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:41:13,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:41:13,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:41:13,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:41:13,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:41:13,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:41:13,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:41:13,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:41:13,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:41:13,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:41:13,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:41:13,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:41:13,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:41:13,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:41:13,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:41:13,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:41:13,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:41:13,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:41:13,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:41:13,904 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:41:13,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:41:13,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:41:13,906 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:41:13,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:41:13,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:41:13,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:41:13,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:41:13,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:41:13,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:41:13,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:41:13,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:41:13,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:41:13,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:41:13,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:41:13,912 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:41:13,913 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2021-12-28 05:41:13,940 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:41:13,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:41:13,941 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:41:13,941 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:41:13,942 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:41:13,942 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:41:13,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:41:13,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:41:13,943 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:41:13,944 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:41:13,944 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 05:41:13,944 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 05:41:13,945 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:41:13,945 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 05:41:13,945 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:41:13,945 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 05:41:13,945 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 05:41:13,945 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:41:13,945 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 05:41:13,946 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-28 05:41:13,946 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-28 05:41:13,946 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 05:41:13,946 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:41:13,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:41:13,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:41:13,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:41:13,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:41:13,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:41:13,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:41:13,954 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-28 05:41:13,954 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-28 05:41:13,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-28 05:41:13,954 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-memcleanup) ) 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 -> 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 [2021-12-28 05:41:14,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:41:14,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:41:14,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:41:14,250 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:41:14,250 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:41:14,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-1.i [2021-12-28 05:41:14,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4ab6f1c/239dd99601ce486f9f4fc52c8876ccc1/FLAG077b255ad [2021-12-28 05:41:14,696 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:41:14,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i [2021-12-28 05:41:14,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4ab6f1c/239dd99601ce486f9f4fc52c8876ccc1/FLAG077b255ad [2021-12-28 05:41:14,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4ab6f1c/239dd99601ce486f9f4fc52c8876ccc1 [2021-12-28 05:41:14,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:41:14,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:41:14,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:41:14,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:41:14,723 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:41:14,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:41:14" (1/1) ... [2021-12-28 05:41:14,724 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d306663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:14, skipping insertion in model container [2021-12-28 05:41:14,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:41:14" (1/1) ... [2021-12-28 05:41:14,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:41:14,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:41:15,045 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-sorted-1.i[22384,22397] [2021-12-28 05:41:15,052 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-sorted-1.i[22614,22627] [2021-12-28 05:41:15,059 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-sorted-1.i[22989,23002] [2021-12-28 05:41:15,060 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-sorted-1.i[23053,23066] [2021-12-28 05:41:15,062 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-sorted-1.i[23184,23197] [2021-12-28 05:41:15,062 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-sorted-1.i[23248,23261] [2021-12-28 05:41:15,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:41:15,085 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:41:15,115 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-sorted-1.i[22384,22397] [2021-12-28 05:41:15,121 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-sorted-1.i[22614,22627] [2021-12-28 05:41:15,127 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-sorted-1.i[22989,23002] [2021-12-28 05:41:15,127 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-sorted-1.i[23053,23066] [2021-12-28 05:41:15,130 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-sorted-1.i[23184,23197] [2021-12-28 05:41:15,132 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-sorted-1.i[23248,23261] [2021-12-28 05:41:15,139 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:41:15,164 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:41:15,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:15 WrapperNode [2021-12-28 05:41:15,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:41:15,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:15,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:41:15,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:41:15,170 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:41:15" (1/1) ... [2021-12-28 05:41:15,189 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:41:15" (1/1) ... [2021-12-28 05:41:15,208 INFO L137 Inliner]: procedures = 122, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 190 [2021-12-28 05:41:15,210 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:41:15,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:41:15,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:41:15,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:41:15,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:15" (1/1) ... [2021-12-28 05:41:15,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:15" (1/1) ... [2021-12-28 05:41:15,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:15" (1/1) ... [2021-12-28 05:41:15,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:15" (1/1) ... [2021-12-28 05:41:15,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:15" (1/1) ... [2021-12-28 05:41:15,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:15" (1/1) ... [2021-12-28 05:41:15,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:15" (1/1) ... [2021-12-28 05:41:15,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:41:15,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:41:15,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:41:15,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:41:15,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:15" (1/1) ... [2021-12-28 05:41:15,273 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:41:15,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:41:15,305 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:41:15,330 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:41:15,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-28 05:41:15,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:41:15,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:41:15,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:41:15,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:41:15,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:41:15,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-28 05:41:15,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-28 05:41:15,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:41:15,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:41:15,478 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:41:15,488 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:41:15,924 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:41:15,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:41:15,929 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2021-12-28 05:41:15,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:15 BoogieIcfgContainer [2021-12-28 05:41:15,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:41:15,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:41:15,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:41:15,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:41:15,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:41:14" (1/3) ... [2021-12-28 05:41:15,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449fa3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:15, skipping insertion in model container [2021-12-28 05:41:15,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:41:15" (2/3) ... [2021-12-28 05:41:15,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449fa3d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:41:15, skipping insertion in model container [2021-12-28 05:41:15,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:41:15" (3/3) ... [2021-12-28 05:41:15,935 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2021-12-28 05:41:15,938 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:41:15,939 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2021-12-28 05:41:15,999 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:41:16,021 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:41:16,021 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2021-12-28 05:41:16,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 94 states have (on average 2.223404255319149) internal successors, (209), 174 states have internal predecessors, (209), 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:41:16,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:41:16,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:16,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:41:16,036 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:16,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:16,040 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-28 05:41:16,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:16,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942095627] [2021-12-28 05:41:16,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:16,048 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:16,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:16,051 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:41:16,052 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:41:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:16,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:41:16,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:16,198 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:41:16,204 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:41:16,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:16,205 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:16,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942095627] [2021-12-28 05:41:16,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942095627] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:16,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:16,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:16,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023045372] [2021-12-28 05:41:16,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:16,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:16,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:16,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:16,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:16,238 INFO L87 Difference]: Start difference. First operand has 175 states, 94 states have (on average 2.223404255319149) internal successors, (209), 174 states have internal predecessors, (209), 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:41:16,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:16,425 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2021-12-28 05:41:16,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:16,427 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:41:16,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:16,433 INFO L225 Difference]: With dead ends: 178 [2021-12-28 05:41:16,433 INFO L226 Difference]: Without dead ends: 174 [2021-12-28 05:41:16,434 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:41:16,436 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:16,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 113 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:16,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-12-28 05:41:16,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2021-12-28 05:41:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 93 states have (on average 1.935483870967742) internal successors, (180), 169 states have internal predecessors, (180), 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:41:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 180 transitions. [2021-12-28 05:41:16,467 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 180 transitions. Word has length 3 [2021-12-28 05:41:16,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:16,467 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 180 transitions. [2021-12-28 05:41:16,467 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:41:16,467 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 180 transitions. [2021-12-28 05:41:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-28 05:41:16,468 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:16,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-28 05:41:16,486 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:41:16,674 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:41:16,675 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:16,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:16,677 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-28 05:41:16,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:16,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972601196] [2021-12-28 05:41:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:16,681 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:16,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:16,683 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:41:16,684 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:41:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:16,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 05:41:16,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:16,748 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:41:16,755 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:41:16,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:16,756 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:16,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972601196] [2021-12-28 05:41:16,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972601196] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:16,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:16,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 05:41:16,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615687967] [2021-12-28 05:41:16,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:16,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:16,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:16,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:16,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:16,762 INFO L87 Difference]: Start difference. First operand 170 states and 180 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:41:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:16,966 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2021-12-28 05:41:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:16,967 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:41:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:16,968 INFO L225 Difference]: With dead ends: 171 [2021-12-28 05:41:16,968 INFO L226 Difference]: Without dead ends: 171 [2021-12-28 05:41:16,968 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:41:16,969 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 162 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 111 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.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:16,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 111 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-28 05:41:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2021-12-28 05:41:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 93 states have (on average 1.903225806451613) internal successors, (177), 166 states have internal predecessors, (177), 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:41:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 177 transitions. [2021-12-28 05:41:16,975 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 177 transitions. Word has length 3 [2021-12-28 05:41:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:16,976 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 177 transitions. [2021-12-28 05:41:16,976 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:41:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 177 transitions. [2021-12-28 05:41:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-28 05:41:16,976 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:16,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:16,998 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:41:17,183 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:41:17,184 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:17,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:17,185 INFO L85 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2021-12-28 05:41:17,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:17,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804330382] [2021-12-28 05:41:17,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:17,186 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:17,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:17,187 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:41:17,197 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:41:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:17,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 05:41:17,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:17,280 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:41:17,318 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-28 05:41:17,318 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:41:17,335 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:41:17,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:17,336 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:17,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804330382] [2021-12-28 05:41:17,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804330382] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:17,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:17,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:17,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276229215] [2021-12-28 05:41:17,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:17,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:17,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:17,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:17,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:17,338 INFO L87 Difference]: Start difference. First operand 167 states and 177 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:41:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:17,602 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2021-12-28 05:41:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 05:41:17,603 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:41:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:17,604 INFO L225 Difference]: With dead ends: 174 [2021-12-28 05:41:17,604 INFO L226 Difference]: Without dead ends: 174 [2021-12-28 05:41:17,604 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:41:17,605 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 285 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:17,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 84 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-12-28 05:41:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2021-12-28 05:41:17,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 107 states have (on average 1.719626168224299) internal successors, (184), 162 states have internal predecessors, (184), 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:41:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2021-12-28 05:41:17,612 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 8 [2021-12-28 05:41:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:17,612 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2021-12-28 05:41:17,612 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:41:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2021-12-28 05:41:17,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-28 05:41:17,613 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:17,613 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:17,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-28 05:41:17,819 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:41:17,820 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:17,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2021-12-28 05:41:17,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:17,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527663095] [2021-12-28 05:41:17,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:17,821 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:17,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:17,822 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:41:17,824 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:41:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:17,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 05:41:17,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:17,919 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:41:17,986 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:17,986 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:41:17,996 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:41:17,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:17,996 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:17,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527663095] [2021-12-28 05:41:17,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527663095] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:17,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:17,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:17,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572190132] [2021-12-28 05:41:17,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:17,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:17,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:17,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:17,998 INFO L87 Difference]: Start difference. First operand 163 states and 184 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:41:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:18,375 INFO L93 Difference]: Finished difference Result 251 states and 273 transitions. [2021-12-28 05:41:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:41:18,376 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:41:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:18,376 INFO L225 Difference]: With dead ends: 251 [2021-12-28 05:41:18,376 INFO L226 Difference]: Without dead ends: 251 [2021-12-28 05:41:18,377 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:41:18,377 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 328 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:18,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 138 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:41:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-12-28 05:41:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 213. [2021-12-28 05:41:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 157 states have (on average 1.624203821656051) internal successors, (255), 212 states have internal predecessors, (255), 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:41:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 255 transitions. [2021-12-28 05:41:18,389 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 255 transitions. Word has length 8 [2021-12-28 05:41:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:18,389 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 255 transitions. [2021-12-28 05:41:18,389 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:41:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 255 transitions. [2021-12-28 05:41:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-28 05:41:18,389 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:18,390 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:18,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-28 05:41:18,599 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:41:18,599 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:18,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:18,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1115996916, now seen corresponding path program 1 times [2021-12-28 05:41:18,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:18,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682077188] [2021-12-28 05:41:18,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:18,600 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:18,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:18,601 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:41:18,604 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:41:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:18,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 05:41:18,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:18,669 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:41:18,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:18,670 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:18,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682077188] [2021-12-28 05:41:18,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682077188] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:18,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:18,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:18,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895099431] [2021-12-28 05:41:18,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:18,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:18,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:18,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:18,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:18,672 INFO L87 Difference]: Start difference. First operand 213 states and 255 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:41:18,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:18,689 INFO L93 Difference]: Finished difference Result 257 states and 302 transitions. [2021-12-28 05:41:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:18,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:41:18,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:18,691 INFO L225 Difference]: With dead ends: 257 [2021-12-28 05:41:18,691 INFO L226 Difference]: Without dead ends: 257 [2021-12-28 05:41:18,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:41:18,692 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 116 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:18,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 228 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-12-28 05:41:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 224. [2021-12-28 05:41:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 168 states have (on average 1.625) internal successors, (273), 223 states have internal predecessors, (273), 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:41:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 273 transitions. [2021-12-28 05:41:18,700 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 273 transitions. Word has length 10 [2021-12-28 05:41:18,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:18,700 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 273 transitions. [2021-12-28 05:41:18,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:41:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 273 transitions. [2021-12-28 05:41:18,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:41:18,701 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:18,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:18,721 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:41:18,908 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:41:18,908 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:18,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:18,909 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2021-12-28 05:41:18,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:18,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489353540] [2021-12-28 05:41:18,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:18,909 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:18,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:18,916 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:41:18,916 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:41:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:18,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-28 05:41:18,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:18,992 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:41:19,005 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:41:19,019 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:41:19,024 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:41:19,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:19,024 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:19,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489353540] [2021-12-28 05:41:19,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489353540] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:19,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:19,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:19,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934866367] [2021-12-28 05:41:19,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:19,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:19,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:19,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:19,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:19,026 INFO L87 Difference]: Start difference. First operand 224 states and 273 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:41:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:19,510 INFO L93 Difference]: Finished difference Result 223 states and 270 transitions. [2021-12-28 05:41:19,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 05:41:19,511 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:41:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:19,512 INFO L225 Difference]: With dead ends: 223 [2021-12-28 05:41:19,512 INFO L226 Difference]: Without dead ends: 223 [2021-12-28 05:41:19,512 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:41:19,513 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 9 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:19,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 406 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-28 05:41:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-12-28 05:41:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2021-12-28 05:41:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 222 states have internal predecessors, (270), 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:41:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 270 transitions. [2021-12-28 05:41:19,517 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 270 transitions. Word has length 11 [2021-12-28 05:41:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:19,518 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 270 transitions. [2021-12-28 05:41:19,518 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:41:19,518 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 270 transitions. [2021-12-28 05:41:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 05:41:19,518 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:19,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:19,535 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:41:19,725 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:41:19,726 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:19,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:19,726 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2021-12-28 05:41:19,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:19,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451788882] [2021-12-28 05:41:19,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:19,727 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:19,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:19,728 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:41:19,729 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:41:19,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:19,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 05:41:19,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:19,795 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:41:19,810 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:41:19,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 11 treesize of output 7 [2021-12-28 05:41:19,857 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:41:19,860 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:41:19,882 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:41:19,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:19,883 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:19,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451788882] [2021-12-28 05:41:19,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451788882] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:19,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:19,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:19,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308621590] [2021-12-28 05:41:19,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:19,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 05:41:19,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:19,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 05:41:19,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 05:41:19,885 INFO L87 Difference]: Start difference. First operand 223 states and 270 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:41:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:20,288 INFO L93 Difference]: Finished difference Result 222 states and 267 transitions. [2021-12-28 05:41:20,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:41:20,288 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:41:20,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:20,289 INFO L225 Difference]: With dead ends: 222 [2021-12-28 05:41:20,289 INFO L226 Difference]: Without dead ends: 222 [2021-12-28 05:41:20,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:41:20,290 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 4 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:20,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 386 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-28 05:41:20,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-12-28 05:41:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2021-12-28 05:41:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 168 states have (on average 1.5892857142857142) internal successors, (267), 221 states have internal predecessors, (267), 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:41:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 267 transitions. [2021-12-28 05:41:20,293 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 267 transitions. Word has length 11 [2021-12-28 05:41:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:20,293 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 267 transitions. [2021-12-28 05:41:20,293 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:41:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 267 transitions. [2021-12-28 05:41:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-28 05:41:20,293 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:20,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:20,304 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:41:20,501 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:41:20,502 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:20,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:20,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2021-12-28 05:41:20,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:20,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918189203] [2021-12-28 05:41:20,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:20,503 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:20,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:20,507 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:41:20,508 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:41:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:20,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-28 05:41:20,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:20,643 INFO L353 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-28 05:41:20,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:41:20,740 INFO L353 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-28 05:41:20,740 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:41:20,839 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:41:21,087 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:21,088 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:41:21,188 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:41:21,477 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:41:21,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:21,478 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918189203] [2021-12-28 05:41:21,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918189203] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:21,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:21,478 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:41:21,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294757692] [2021-12-28 05:41:21,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:21,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 05:41:21,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:21,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 05:41:21,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-28 05:41:21,479 INFO L87 Difference]: Start difference. First operand 222 states and 267 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:41:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:21,971 INFO L93 Difference]: Finished difference Result 224 states and 270 transitions. [2021-12-28 05:41:21,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 05:41:21,972 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:41:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:21,973 INFO L225 Difference]: With dead ends: 224 [2021-12-28 05:41:21,973 INFO L226 Difference]: Without dead ends: 224 [2021-12-28 05:41:21,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-12-28 05:41:21,973 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 27 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:21,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 557 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 208 Invalid, 0 Unknown, 160 Unchecked, 0.3s Time] [2021-12-28 05:41:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-12-28 05:41:21,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2021-12-28 05:41:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 170 states have (on average 1.588235294117647) internal successors, (270), 223 states have internal predecessors, (270), 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:41:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 270 transitions. [2021-12-28 05:41:21,977 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 270 transitions. Word has length 15 [2021-12-28 05:41:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:21,977 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 270 transitions. [2021-12-28 05:41:21,977 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:41:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 270 transitions. [2021-12-28 05:41:21,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-28 05:41:21,978 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:21,978 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:22,006 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:41:22,178 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:41:22,179 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:22,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:22,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2021-12-28 05:41:22,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:22,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303834882] [2021-12-28 05:41:22,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:22,180 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:22,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:22,181 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:41:22,182 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:41:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:22,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-28 05:41:22,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:22,286 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:41:22,312 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:41:22,320 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 05:41:22,320 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:41:22,342 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:41:22,350 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:41:22,410 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:22,410 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:41:22,415 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:41:22,435 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:41:22,438 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:41:22,466 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:41:22,466 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:22,466 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:22,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303834882] [2021-12-28 05:41:22,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303834882] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:22,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:22,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:41:22,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966666679] [2021-12-28 05:41:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:22,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:41:22,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:22,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:41:22,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:41:22,467 INFO L87 Difference]: Start difference. First operand 224 states and 270 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:41:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:23,392 INFO L93 Difference]: Finished difference Result 225 states and 262 transitions. [2021-12-28 05:41:23,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 05:41:23,393 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:41:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:23,394 INFO L225 Difference]: With dead ends: 225 [2021-12-28 05:41:23,394 INFO L226 Difference]: Without dead ends: 225 [2021-12-28 05:41:23,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-12-28 05:41:23,394 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 275 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:23,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 354 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-28 05:41:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-28 05:41:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 218. [2021-12-28 05:41:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 170 states have (on average 1.5235294117647058) internal successors, (259), 217 states have internal predecessors, (259), 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:41:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 259 transitions. [2021-12-28 05:41:23,397 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 259 transitions. Word has length 15 [2021-12-28 05:41:23,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:23,398 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 259 transitions. [2021-12-28 05:41:23,398 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:41:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 259 transitions. [2021-12-28 05:41:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-28 05:41:23,398 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:23,398 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:41:23,408 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:41:23,605 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:41:23,605 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:23,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash -135560350, now seen corresponding path program 1 times [2021-12-28 05:41:23,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:23,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447280168] [2021-12-28 05:41:23,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:23,606 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:23,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:23,607 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:41:23,609 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:41:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:23,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 05:41:23,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:23,743 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:41:23,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:23,743 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:23,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447280168] [2021-12-28 05:41:23,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447280168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:23,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:23,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 05:41:23,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211499952] [2021-12-28 05:41:23,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:23,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 05:41:23,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:23,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 05:41:23,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 05:41:23,745 INFO L87 Difference]: Start difference. First operand 218 states and 259 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:41:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:23,951 INFO L93 Difference]: Finished difference Result 246 states and 268 transitions. [2021-12-28 05:41:23,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 05:41:23,952 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:41:23,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:23,952 INFO L225 Difference]: With dead ends: 246 [2021-12-28 05:41:23,952 INFO L226 Difference]: Without dead ends: 246 [2021-12-28 05:41:23,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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:41:23,953 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 286 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:23,953 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 193 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-28 05:41:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-12-28 05:41:23,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2021-12-28 05:41:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 215 states have internal predecessors, (255), 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:41:23,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 255 transitions. [2021-12-28 05:41:23,956 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 255 transitions. Word has length 22 [2021-12-28 05:41:23,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:23,956 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 255 transitions. [2021-12-28 05:41:23,956 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:41:23,956 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 255 transitions. [2021-12-28 05:41:23,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 05:41:23,957 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:23,957 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:23,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-28 05:41:24,164 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:41:24,164 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:24,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash -696597241, now seen corresponding path program 1 times [2021-12-28 05:41:24,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:24,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668449074] [2021-12-28 05:41:24,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:24,165 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:24,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:24,166 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:41:24,203 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:41:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:24,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-28 05:41:24,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:24,336 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:41:24,369 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 05:41:24,369 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:41:24,395 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:41:24,450 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:24,450 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:41:24,468 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:41:24,568 INFO L353 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-28 05:41:24,569 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:41:24,613 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:41:24,747 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:24,747 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:41:24,784 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:41:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:24,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:24,881 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:24,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668449074] [2021-12-28 05:41:24,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668449074] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:24,882 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:24,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 05:41:24,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088206299] [2021-12-28 05:41:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:24,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 05:41:24,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 05:41:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:41:24,882 INFO L87 Difference]: Start difference. First operand 216 states and 255 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 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:41:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:25,446 INFO L93 Difference]: Finished difference Result 239 states and 281 transitions. [2021-12-28 05:41:25,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-28 05:41:25,446 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 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:41:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:25,447 INFO L225 Difference]: With dead ends: 239 [2021-12-28 05:41:25,447 INFO L226 Difference]: Without dead ends: 239 [2021-12-28 05:41:25,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2021-12-28 05:41:25,448 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 114 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:25,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 562 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 399 Invalid, 0 Unknown, 245 Unchecked, 0.4s Time] [2021-12-28 05:41:25,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-28 05:41:25,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 229. [2021-12-28 05:41:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 228 states have internal predecessors, (272), 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:41:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 272 transitions. [2021-12-28 05:41:25,451 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 272 transitions. Word has length 27 [2021-12-28 05:41:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:25,451 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 272 transitions. [2021-12-28 05:41:25,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 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:41:25,451 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 272 transitions. [2021-12-28 05:41:25,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 05:41:25,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:25,452 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:25,460 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:41:25,660 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:41:25,660 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:25,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2073986969, now seen corresponding path program 1 times [2021-12-28 05:41:25,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:25,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342018516] [2021-12-28 05:41:25,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:25,661 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:25,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:25,662 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:41:25,663 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:41:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:25,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 05:41:25,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:25,836 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:25,836 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:25,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342018516] [2021-12-28 05:41:25,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342018516] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:25,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:25,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 05:41:25,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412684853] [2021-12-28 05:41:25,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:25,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 05:41:25,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:25,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 05:41:25,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 05:41:25,837 INFO L87 Difference]: Start difference. First operand 229 states and 272 transitions. Second operand has 3 states, 3 states have (on average 9.0) 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:41:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:25,852 INFO L93 Difference]: Finished difference Result 256 states and 298 transitions. [2021-12-28 05:41:25,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 05:41:25,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) 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:41:25,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:25,853 INFO L225 Difference]: With dead ends: 256 [2021-12-28 05:41:25,853 INFO L226 Difference]: Without dead ends: 256 [2021-12-28 05:41:25,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:41:25,855 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 41 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:25,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 287 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 05:41:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-28 05:41:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 229. [2021-12-28 05:41:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 228 states have internal predecessors, (270), 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:41:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 270 transitions. [2021-12-28 05:41:25,858 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 270 transitions. Word has length 27 [2021-12-28 05:41:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:25,859 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 270 transitions. [2021-12-28 05:41:25,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) 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:41:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 270 transitions. [2021-12-28 05:41:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-28 05:41:25,861 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:25,862 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 05:41:25,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-28 05:41:26,069 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:41:26,069 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:26,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1815821531, now seen corresponding path program 1 times [2021-12-28 05:41:26,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:26,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483923319] [2021-12-28 05:41:26,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:26,071 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:26,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:26,072 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:41:26,095 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:41:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:26,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-28 05:41:26,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:26,235 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:41:26,267 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 05:41:26,267 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:41:26,298 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:41:26,356 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:26,358 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:41:26,384 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:41:26,489 INFO L353 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-28 05:41:26,490 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:41:26,547 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:41:26,698 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:26,698 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:41:26,747 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:41:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 05:41:26,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 05:41:26,885 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-28 05:41:26,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483923319] [2021-12-28 05:41:26,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483923319] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:41:26,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:41:26,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 05:41:26,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654167768] [2021-12-28 05:41:26,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:41:26,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 05:41:26,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-28 05:41:26,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 05:41:26,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-28 05:41:26,886 INFO L87 Difference]: Start difference. First operand 229 states and 270 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 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:41:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:41:27,444 INFO L93 Difference]: Finished difference Result 240 states and 279 transitions. [2021-12-28 05:41:27,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-28 05:41:27,445 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 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:41:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:41:27,445 INFO L225 Difference]: With dead ends: 240 [2021-12-28 05:41:27,446 INFO L226 Difference]: Without dead ends: 240 [2021-12-28 05:41:27,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2021-12-28 05:41:27,446 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 117 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:41:27,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 511 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 360 Invalid, 0 Unknown, 259 Unchecked, 0.4s Time] [2021-12-28 05:41:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-12-28 05:41:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 229. [2021-12-28 05:41:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 182 states have (on average 1.478021978021978) internal successors, (269), 228 states have internal predecessors, (269), 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:41:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 269 transitions. [2021-12-28 05:41:27,449 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 269 transitions. Word has length 27 [2021-12-28 05:41:27,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:41:27,449 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 269 transitions. [2021-12-28 05:41:27,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 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:41:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 269 transitions. [2021-12-28 05:41:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 05:41:27,450 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:41:27,450 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:41:27,476 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:41:27,650 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:41:27,650 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2021-12-28 05:41:27,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:41:27,651 INFO L85 PathProgramCache]: Analyzing trace with hash -884267663, now seen corresponding path program 1 times [2021-12-28 05:41:27,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-28 05:41:27,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105123402] [2021-12-28 05:41:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:41:27,651 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-28 05:41:27,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-28 05:41:27,652 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:41:27,654 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:41:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:41:27,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-28 05:41:27,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 05:41:27,773 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:41:27,809 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-28 05:41:27,810 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:41:27,840 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:41:27,912 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:27,912 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:41:27,997 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:27,998 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:41:28,036 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 05:41:28,036 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:41:28,121 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:41:28,139 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:41:28,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 05:41:28,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_516) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2021-12-28 05:41:28,265 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_514))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2021-12-28 05:41:28,273 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_514))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-28 05:41:28,284 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:28,284 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:41:28,294 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:28,294 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 144 treesize of output 131 [2021-12-28 05:41:28,322 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 05:41:28,322 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 116 treesize of output 114 [2021-12-28 05:41:28,326 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 106 treesize of output 102