./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/cart.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 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/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/cart.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 12:12:59,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 12:12:59,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 12:12:59,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 12:12:59,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 12:12:59,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 12:12:59,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 12:12:59,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 12:12:59,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 12:12:59,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 12:12:59,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 12:12:59,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 12:12:59,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 12:12:59,198 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 12:12:59,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 12:12:59,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 12:12:59,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 12:12:59,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 12:12:59,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 12:12:59,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 12:12:59,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 12:12:59,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 12:12:59,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 12:12:59,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 12:12:59,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 12:12:59,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 12:12:59,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 12:12:59,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 12:12:59,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 12:12:59,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 12:12:59,221 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 12:12:59,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 12:12:59,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 12:12:59,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 12:12:59,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 12:12:59,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 12:12:59,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 12:12:59,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 12:12:59,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 12:12:59,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 12:12:59,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 12:12:59,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 12:12:59,256 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 12:12:59,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 12:12:59,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 12:12:59,257 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 12:12:59,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 12:12:59,258 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 12:12:59,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 12:12:59,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 12:12:59,260 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 12:12:59,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 12:12:59,261 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 12:12:59,261 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 12:12:59,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 12:12:59,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 12:12:59,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 12:12:59,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 12:12:59,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 12:12:59,262 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 12:12:59,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 12:12:59,263 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 12:12:59,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 12:12:59,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 12:12:59,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 12:12:59,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 12:12:59,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:12:59,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 12:12:59,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 12:12:59,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 12:12:59,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 12:12:59,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 12:12:59,266 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 12:12:59,266 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 12:12:59,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 12:12:59,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 12:12:59,267 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 ! call(reach_error())) ) 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 -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2021-12-21 12:12:59,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 12:12:59,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 12:12:59,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 12:12:59,495 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 12:12:59,496 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 12:12:59,497 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2021-12-21 12:12:59,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ff3982c/b53f4d20bbd24dc3b8602a3fc32d9a3c/FLAG667d97694 [2021-12-21 12:13:00,038 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 12:13:00,042 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2021-12-21 12:13:00,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ff3982c/b53f4d20bbd24dc3b8602a3fc32d9a3c/FLAG667d97694 [2021-12-21 12:13:00,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2ff3982c/b53f4d20bbd24dc3b8602a3fc32d9a3c [2021-12-21 12:13:00,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 12:13:00,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 12:13:00,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 12:13:00,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 12:13:00,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 12:13:00,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:13:00" (1/1) ... [2021-12-21 12:13:00,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c3fc8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00, skipping insertion in model container [2021-12-21 12:13:00,394 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:13:00" (1/1) ... [2021-12-21 12:13:00,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 12:13:00,423 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 12:13:00,656 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/heap-data/cart.i[23713,23726] [2021-12-21 12:13:00,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:13:00,664 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 12:13:00,696 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/heap-data/cart.i[23713,23726] [2021-12-21 12:13:00,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:13:00,721 INFO L208 MainTranslator]: Completed translation [2021-12-21 12:13:00,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00 WrapperNode [2021-12-21 12:13:00,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 12:13:00,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 12:13:00,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 12:13:00,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 12:13:00,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00" (1/1) ... [2021-12-21 12:13:00,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00" (1/1) ... [2021-12-21 12:13:00,777 INFO L137 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 77 [2021-12-21 12:13:00,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 12:13:00,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 12:13:00,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 12:13:00,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 12:13:00,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00" (1/1) ... [2021-12-21 12:13:00,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00" (1/1) ... [2021-12-21 12:13:00,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00" (1/1) ... [2021-12-21 12:13:00,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00" (1/1) ... [2021-12-21 12:13:00,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00" (1/1) ... [2021-12-21 12:13:00,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00" (1/1) ... [2021-12-21 12:13:00,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00" (1/1) ... [2021-12-21 12:13:00,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 12:13:00,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 12:13:00,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 12:13:00,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 12:13:00,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00" (1/1) ... [2021-12-21 12:13:00,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:13:00,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:13:00,838 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-21 12:13:00,840 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-21 12:13:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 12:13:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 12:13:00,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 12:13:00,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 12:13:00,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 12:13:00,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 12:13:00,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 12:13:00,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 12:13:00,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 12:13:00,977 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 12:13:00,979 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 12:13:01,166 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 12:13:01,171 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 12:13:01,171 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-21 12:13:01,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:13:01 BoogieIcfgContainer [2021-12-21 12:13:01,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 12:13:01,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 12:13:01,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 12:13:01,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 12:13:01,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:13:00" (1/3) ... [2021-12-21 12:13:01,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b56d118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:13:01, skipping insertion in model container [2021-12-21 12:13:01,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:00" (2/3) ... [2021-12-21 12:13:01,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b56d118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:13:01, skipping insertion in model container [2021-12-21 12:13:01,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:13:01" (3/3) ... [2021-12-21 12:13:01,180 INFO L111 eAbstractionObserver]: Analyzing ICFG cart.i [2021-12-21 12:13:01,184 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 12:13:01,184 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 12:13:01,221 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 12:13:01,226 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-21 12:13:01,227 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 12:13:01,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:01,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 12:13:01,253 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:01,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:01,255 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:01,260 INFO L85 PathProgramCache]: Analyzing trace with hash -680841488, now seen corresponding path program 1 times [2021-12-21 12:13:01,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:13:01,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943777569] [2021-12-21 12:13:01,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:01,269 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:13:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:01,408 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-21 12:13:01,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:13:01,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943777569] [2021-12-21 12:13:01,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943777569] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:13:01,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:13:01,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 12:13:01,412 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684068179] [2021-12-21 12:13:01,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:13:01,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 12:13:01,416 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:13:01,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 12:13:01,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 12:13:01,447 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-21 12:13:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:01,460 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2021-12-21 12:13:01,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 12:13:01,462 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-21 12:13:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:01,467 INFO L225 Difference]: With dead ends: 34 [2021-12-21 12:13:01,467 INFO L226 Difference]: Without dead ends: 17 [2021-12-21 12:13:01,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 12:13:01,473 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:01,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:13:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-21 12:13:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-21 12:13:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 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-21 12:13:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2021-12-21 12:13:01,508 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2021-12-21 12:13:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:01,509 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2021-12-21 12:13:01,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-21 12:13:01,509 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2021-12-21 12:13:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-21 12:13:01,510 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:01,510 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:01,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 12:13:01,511 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:01,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:01,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1910225148, now seen corresponding path program 1 times [2021-12-21 12:13:01,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:13:01,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079099327] [2021-12-21 12:13:01,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:01,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:13:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:01,627 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-21 12:13:01,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:13:01,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079099327] [2021-12-21 12:13:01,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079099327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:13:01,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:13:01,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 12:13:01,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78961767] [2021-12-21 12:13:01,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:13:01,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:13:01,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:13:01,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:13:01,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:13:01,632 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:01,691 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2021-12-21 12:13:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 12:13:01,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-21 12:13:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:01,692 INFO L225 Difference]: With dead ends: 36 [2021-12-21 12:13:01,692 INFO L226 Difference]: Without dead ends: 21 [2021-12-21 12:13:01,693 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-21 12:13:01,695 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:01,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:13:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-21 12:13:01,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-21 12:13:01,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 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-21 12:13:01,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2021-12-21 12:13:01,717 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2021-12-21 12:13:01,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:01,718 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-21 12:13:01,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2021-12-21 12:13:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-21 12:13:01,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:01,722 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:01,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 12:13:01,722 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:01,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1849394690, now seen corresponding path program 1 times [2021-12-21 12:13:01,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:13:01,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667316713] [2021-12-21 12:13:01,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:01,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:13:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:01,811 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:13:01,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667316713] [2021-12-21 12:13:01,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667316713] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:13:01,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:13:01,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 12:13:01,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382484798] [2021-12-21 12:13:01,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:13:01,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:13:01,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:13:01,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:13:01,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:13:01,814 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-21 12:13:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:01,849 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2021-12-21 12:13:01,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:13:01,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-21 12:13:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:01,850 INFO L225 Difference]: With dead ends: 36 [2021-12-21 12:13:01,851 INFO L226 Difference]: Without dead ends: 30 [2021-12-21 12:13:01,851 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-21 12:13:01,852 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:01,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 41 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:13:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-21 12:13:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-12-21 12:13:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 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-21 12:13:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2021-12-21 12:13:01,860 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2021-12-21 12:13:01,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:01,860 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-12-21 12:13:01,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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-21 12:13:01,861 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2021-12-21 12:13:01,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 12:13:01,861 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:01,862 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:01,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 12:13:01,862 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:01,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:01,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1690179633, now seen corresponding path program 1 times [2021-12-21 12:13:01,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:13:01,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662893449] [2021-12-21 12:13:01,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:01,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:13:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:13:01,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:13:01,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662893449] [2021-12-21 12:13:01,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662893449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:13:01,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:13:01,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 12:13:01,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618149523] [2021-12-21 12:13:01,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:13:01,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 12:13:01,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:13:01,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 12:13:01,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:13:01,932 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:01,942 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2021-12-21 12:13:01,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 12:13:01,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-21 12:13:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:01,943 INFO L225 Difference]: With dead ends: 37 [2021-12-21 12:13:01,943 INFO L226 Difference]: Without dead ends: 27 [2021-12-21 12:13:01,944 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-21 12:13:01,945 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:01,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:13:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-21 12:13:01,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-21 12:13:01,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2021-12-21 12:13:01,955 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2021-12-21 12:13:01,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:01,955 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2021-12-21 12:13:01,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:01,956 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2021-12-21 12:13:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-21 12:13:01,956 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:01,956 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:01,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 12:13:01,957 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:01,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1795441037, now seen corresponding path program 1 times [2021-12-21 12:13:01,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:13:01,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971098648] [2021-12-21 12:13:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:01,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:13:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:02,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:13:02,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971098648] [2021-12-21 12:13:02,131 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971098648] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:13:02,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810011912] [2021-12-21 12:13:02,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:02,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:13:02,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:13:02,136 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-21 12:13:02,137 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-21 12:13:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:02,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-21 12:13:02,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:02,463 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 0 case distinctions, treesize of input 32 treesize of output 25 [2021-12-21 12:13:02,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-21 12:13:02,545 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:02,546 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-12-21 12:13:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:02,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:13:02,706 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:02,709 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 936 treesize of output 908 [2021-12-21 12:13:02,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:13:02,768 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 16 treesize of output 8 [2021-12-21 12:13:02,834 INFO L353 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2021-12-21 12:13:02,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 572 treesize of output 518 [2021-12-21 12:13:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:13:03,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810011912] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:13:03,527 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 12:13:03,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 13 [2021-12-21 12:13:03,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758969438] [2021-12-21 12:13:03,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 12:13:03,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 12:13:03,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:13:03,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 12:13:03,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-12-21 12:13:03,530 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 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-21 12:13:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:03,721 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2021-12-21 12:13:03,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 12:13:03,722 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-21 12:13:03,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:03,722 INFO L225 Difference]: With dead ends: 48 [2021-12-21 12:13:03,722 INFO L226 Difference]: Without dead ends: 46 [2021-12-21 12:13:03,724 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2021-12-21 12:13:03,725 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 67 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:03,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 125 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 78 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2021-12-21 12:13:03,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-21 12:13:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2021-12-21 12:13:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 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-21 12:13:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2021-12-21 12:13:03,730 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2021-12-21 12:13:03,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:03,731 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2021-12-21 12:13:03,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 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-21 12:13:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2021-12-21 12:13:03,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-21 12:13:03,732 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:03,732 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:03,759 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-21 12:13:03,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:13:03,952 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:03,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:03,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1534874359, now seen corresponding path program 1 times [2021-12-21 12:13:03,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:13:03,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195947428] [2021-12-21 12:13:03,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:03,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:13:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:13:04,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:13:04,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195947428] [2021-12-21 12:13:04,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195947428] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:13:04,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326661146] [2021-12-21 12:13:04,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:04,074 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:13:04,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:13:04,076 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-21 12:13:04,103 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-21 12:13:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:04,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-21 12:13:04,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:04,223 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 6 treesize of output 5 [2021-12-21 12:13:04,311 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-21 12:13:04,313 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-21 12:13:04,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:04,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:13:04,396 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 30 treesize of output 26 [2021-12-21 12:13:04,403 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:04,403 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 33 treesize of output 37 [2021-12-21 12:13:04,413 INFO L353 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-21 12:13:04,414 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 33 treesize of output 32 [2021-12-21 12:13:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 12:13:04,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326661146] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:13:04,465 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 12:13:04,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2021-12-21 12:13:04,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760829683] [2021-12-21 12:13:04,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 12:13:04,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 12:13:04,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:13:04,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 12:13:04,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-12-21 12:13:04,468 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 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-21 12:13:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:04,672 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2021-12-21 12:13:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 12:13:04,673 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-21 12:13:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:04,673 INFO L225 Difference]: With dead ends: 59 [2021-12-21 12:13:04,673 INFO L226 Difference]: Without dead ends: 49 [2021-12-21 12:13:04,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2021-12-21 12:13:04,674 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 84 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:04,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 141 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:13:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-12-21 12:13:04,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2021-12-21 12:13:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 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-21 12:13:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2021-12-21 12:13:04,680 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2021-12-21 12:13:04,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:04,680 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2021-12-21 12:13:04,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 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-21 12:13:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2021-12-21 12:13:04,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-21 12:13:04,681 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:04,681 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:04,706 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-21 12:13:04,881 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,SelfDestructingSolverStorable5 [2021-12-21 12:13:04,882 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:04,882 INFO L85 PathProgramCache]: Analyzing trace with hash 379469720, now seen corresponding path program 2 times [2021-12-21 12:13:04,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:13:04,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337661595] [2021-12-21 12:13:04,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:04,883 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:13:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:05,012 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:05,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:13:05,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337661595] [2021-12-21 12:13:05,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337661595] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:13:05,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694325] [2021-12-21 12:13:05,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:13:05,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:13:05,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:13:05,014 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:13:05,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 12:13:05,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 12:13:05,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:13:05,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-21 12:13:05,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:05,138 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-21 12:13:05,143 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-21 12:13:05,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-12-21 12:13:05,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:13:05,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-12-21 12:13:05,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:13:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:05,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:13:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:05,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694325] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:13:05,333 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 12:13:05,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2021-12-21 12:13:05,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843728835] [2021-12-21 12:13:05,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 12:13:05,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 12:13:05,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:13:05,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 12:13:05,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 12:13:05,335 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 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-21 12:13:05,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:05,425 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2021-12-21 12:13:05,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 12:13:05,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-21 12:13:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:05,427 INFO L225 Difference]: With dead ends: 67 [2021-12-21 12:13:05,427 INFO L226 Difference]: Without dead ends: 40 [2021-12-21 12:13:05,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-12-21 12:13:05,428 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:05,428 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 118 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:13:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-12-21 12:13:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-12-21 12:13:05,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2021-12-21 12:13:05,433 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2021-12-21 12:13:05,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:05,433 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2021-12-21 12:13:05,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 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-21 12:13:05,434 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2021-12-21 12:13:05,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 12:13:05,434 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:05,435 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:05,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-21 12:13:05,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:13:05,647 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:05,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:05,648 INFO L85 PathProgramCache]: Analyzing trace with hash -3886178, now seen corresponding path program 3 times [2021-12-21 12:13:05,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 12:13:05,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491776623] [2021-12-21 12:13:05,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:05,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 12:13:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:05,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:05,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 12:13:05,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491776623] [2021-12-21 12:13:05,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491776623] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 12:13:05,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000288314] [2021-12-21 12:13:05,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 12:13:05,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:13:05,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:13:05,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 12:13:05,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 12:13:05,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-21 12:13:05,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:13:05,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-21 12:13:05,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:05,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 12:13:05,998 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-21 12:13:06,004 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-21 12:13:06,004 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 15 treesize of output 15 [2021-12-21 12:13:06,105 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 0 case distinctions, treesize of input 32 treesize of output 25 [2021-12-21 12:13:06,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-21 12:13:06,114 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 22 treesize of output 18 [2021-12-21 12:13:06,117 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-12-21 12:13:06,151 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 18 [2021-12-21 12:13:06,185 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:06,185 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2021-12-21 12:13:06,189 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:06,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:13:06,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_401) |c_ULTIMATE.start_main_~l~0#1.base|))) (<= (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (select .cse0 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4))))) is different from false [2021-12-21 12:13:06,328 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:06,329 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 2 case distinctions, treesize of input 104 treesize of output 86 [2021-12-21 12:13:06,337 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:06,337 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 80 treesize of output 82 [2021-12-21 12:13:06,343 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:13:06,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-12-21 12:13:06,346 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:13:06,348 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:13:06,352 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:06,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 32 [2021-12-21 12:13:06,391 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-21 12:13:06,391 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 3 [2021-12-21 12:13:06,435 INFO L353 Elim1Store]: treesize reduction 36, result has 50.7 percent of original size [2021-12-21 12:13:06,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 65 [2021-12-21 12:13:06,649 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Complicated and unsupported kind of self-update: (select |v_#memory_$Pointer$.base_58| (select (store (store v_ArrVal_391 8 v_ArrVal_398) 4 v_ArrVal_400) 0)) [2021-12-21 12:13:06,649 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-21 12:13:06,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2021-12-21 12:13:06,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400052744] [2021-12-21 12:13:06,650 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-21 12:13:06,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 12:13:06,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 12:13:06,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 12:13:06,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2021-12-21 12:13:06,651 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 12:13:06,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2021-12-21 12:13:06,653 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:06,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:13:06,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 12:13:06,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 12:13:06,868 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@60278515 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) 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-21 12:13:06,871 INFO L158 Benchmark]: Toolchain (without parser) took 6484.41ms. Allocated memory was 107.0MB in the beginning and 169.9MB in the end (delta: 62.9MB). Free memory was 74.4MB in the beginning and 119.2MB in the end (delta: -44.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2021-12-21 12:13:06,871 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 79.7MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 43.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 12:13:06,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.95ms. Allocated memory is still 107.0MB. Free memory was 74.2MB in the beginning and 75.8MB in the end (delta: -1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 12:13:06,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.16ms. Allocated memory is still 107.0MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 12:13:06,872 INFO L158 Benchmark]: Boogie Preprocessor took 33.73ms. Allocated memory is still 107.0MB. Free memory was 73.7MB in the beginning and 72.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 12:13:06,872 INFO L158 Benchmark]: RCFGBuilder took 360.57ms. Allocated memory is still 107.0MB. Free memory was 72.1MB in the beginning and 60.5MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-21 12:13:06,872 INFO L158 Benchmark]: TraceAbstraction took 5696.36ms. Allocated memory was 107.0MB in the beginning and 169.9MB in the end (delta: 62.9MB). Free memory was 60.0MB in the beginning and 119.2MB in the end (delta: -59.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2021-12-21 12:13:06,873 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.18ms. Allocated memory is still 79.7MB. Free memory was 36.1MB in the beginning and 36.1MB in the end (delta: 43.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.95ms. Allocated memory is still 107.0MB. Free memory was 74.2MB in the beginning and 75.8MB in the end (delta: -1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.16ms. Allocated memory is still 107.0MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.73ms. Allocated memory is still 107.0MB. Free memory was 73.7MB in the beginning and 72.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 360.57ms. Allocated memory is still 107.0MB. Free memory was 72.1MB in the beginning and 60.5MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5696.36ms. Allocated memory was 107.0MB in the beginning and 169.9MB in the end (delta: 62.9MB). Free memory was 60.0MB in the beginning and 119.2MB in the end (delta: -59.2MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@60278515 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@60278515: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-21 12:13:06,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/cart.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 12:13:08,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 12:13:08,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 12:13:08,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 12:13:08,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 12:13:08,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 12:13:08,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 12:13:08,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 12:13:08,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 12:13:08,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 12:13:08,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 12:13:08,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 12:13:08,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 12:13:08,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 12:13:08,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 12:13:08,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 12:13:08,805 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 12:13:08,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 12:13:08,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 12:13:08,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 12:13:08,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 12:13:08,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 12:13:08,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 12:13:08,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 12:13:08,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 12:13:08,822 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 12:13:08,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 12:13:08,823 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 12:13:08,824 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 12:13:08,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 12:13:08,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 12:13:08,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 12:13:08,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 12:13:08,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 12:13:08,829 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 12:13:08,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 12:13:08,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 12:13:08,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 12:13:08,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 12:13:08,831 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 12:13:08,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 12:13:08,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-21 12:13:08,868 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 12:13:08,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 12:13:08,869 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 12:13:08,869 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 12:13:08,871 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 12:13:08,871 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 12:13:08,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 12:13:08,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 12:13:08,872 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 12:13:08,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 12:13:08,873 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 12:13:08,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 12:13:08,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 12:13:08,874 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 12:13:08,874 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 12:13:08,874 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 12:13:08,874 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-21 12:13:08,874 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-21 12:13:08,875 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-21 12:13:08,875 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 12:13:08,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 12:13:08,875 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 12:13:08,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 12:13:08,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 12:13:08,876 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 12:13:08,876 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 12:13:08,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:13:08,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 12:13:08,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 12:13:08,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 12:13:08,884 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-21 12:13:08,884 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-21 12:13:08,885 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 12:13:08,885 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 12:13:08,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 12:13:08,885 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 12:13:08,885 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-21 12:13:08,886 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 ! call(reach_error())) ) 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 -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2021-12-21 12:13:09,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 12:13:09,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 12:13:09,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 12:13:09,217 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 12:13:09,217 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 12:13:09,219 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2021-12-21 12:13:09,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010a0399b/165e2a88dd7a4a11a98978a9ecea8934/FLAGfc222eedd [2021-12-21 12:13:09,756 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 12:13:09,757 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2021-12-21 12:13:09,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010a0399b/165e2a88dd7a4a11a98978a9ecea8934/FLAGfc222eedd [2021-12-21 12:13:10,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/010a0399b/165e2a88dd7a4a11a98978a9ecea8934 [2021-12-21 12:13:10,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 12:13:10,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 12:13:10,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 12:13:10,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 12:13:10,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 12:13:10,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:13:10" (1/1) ... [2021-12-21 12:13:10,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db1926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10, skipping insertion in model container [2021-12-21 12:13:10,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:13:10" (1/1) ... [2021-12-21 12:13:10,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 12:13:10,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 12:13:10,359 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/heap-data/cart.i[23713,23726] [2021-12-21 12:13:10,362 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:13:10,371 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 12:13:10,414 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/heap-data/cart.i[23713,23726] [2021-12-21 12:13:10,415 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 12:13:10,443 INFO L208 MainTranslator]: Completed translation [2021-12-21 12:13:10,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10 WrapperNode [2021-12-21 12:13:10,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 12:13:10,445 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 12:13:10,445 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 12:13:10,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 12:13:10,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10" (1/1) ... [2021-12-21 12:13:10,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10" (1/1) ... [2021-12-21 12:13:10,508 INFO L137 Inliner]: procedures = 124, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 75 [2021-12-21 12:13:10,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 12:13:10,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 12:13:10,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 12:13:10,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 12:13:10,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10" (1/1) ... [2021-12-21 12:13:10,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10" (1/1) ... [2021-12-21 12:13:10,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10" (1/1) ... [2021-12-21 12:13:10,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10" (1/1) ... [2021-12-21 12:13:10,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10" (1/1) ... [2021-12-21 12:13:10,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10" (1/1) ... [2021-12-21 12:13:10,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10" (1/1) ... [2021-12-21 12:13:10,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 12:13:10,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 12:13:10,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 12:13:10,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 12:13:10,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10" (1/1) ... [2021-12-21 12:13:10,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 12:13:10,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 12:13:10,596 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-21 12:13:10,607 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-21 12:13:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-21 12:13:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 12:13:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 12:13:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-21 12:13:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-21 12:13:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-21 12:13:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-21 12:13:10,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 12:13:10,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 12:13:10,731 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 12:13:10,733 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 12:13:10,985 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 12:13:10,990 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 12:13:10,990 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-21 12:13:10,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:13:10 BoogieIcfgContainer [2021-12-21 12:13:10,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 12:13:10,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 12:13:10,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 12:13:10,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 12:13:11,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:13:10" (1/3) ... [2021-12-21 12:13:11,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c25080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:13:11, skipping insertion in model container [2021-12-21 12:13:11,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:13:10" (2/3) ... [2021-12-21 12:13:11,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c25080 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:13:11, skipping insertion in model container [2021-12-21 12:13:11,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:13:10" (3/3) ... [2021-12-21 12:13:11,003 INFO L111 eAbstractionObserver]: Analyzing ICFG cart.i [2021-12-21 12:13:11,007 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 12:13:11,007 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 12:13:11,061 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 12:13:11,072 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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-21 12:13:11,072 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-21 12:13:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-21 12:13:11,092 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:11,094 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:11,095 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:11,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1597928625, now seen corresponding path program 1 times [2021-12-21 12:13:11,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:13:11,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554841531] [2021-12-21 12:13:11,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:11,110 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:13:11,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:13:11,113 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-21 12:13:11,114 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-21 12:13:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:11,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-21 12:13:11,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:11,246 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-21 12:13:11,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:13:11,247 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:13:11,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554841531] [2021-12-21 12:13:11,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554841531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:13:11,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:13:11,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 12:13:11,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667193761] [2021-12-21 12:13:11,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:13:11,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 12:13:11,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:13:11,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 12:13:11,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 12:13:11,280 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-21 12:13:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:11,292 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2021-12-21 12:13:11,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 12:13:11,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-21 12:13:11,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:11,300 INFO L225 Difference]: With dead ends: 33 [2021-12-21 12:13:11,300 INFO L226 Difference]: Without dead ends: 16 [2021-12-21 12:13:11,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 12:13:11,306 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:11,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:13:11,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-12-21 12:13:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-12-21 12:13:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2021-12-21 12:13:11,333 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 21 transitions. Word has length 9 [2021-12-21 12:13:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:11,333 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 21 transitions. [2021-12-21 12:13:11,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-21 12:13:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2021-12-21 12:13:11,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-21 12:13:11,335 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:11,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:11,354 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-21 12:13:11,555 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-21 12:13:11,556 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:11,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1565257307, now seen corresponding path program 1 times [2021-12-21 12:13:11,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:13:11,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337683631] [2021-12-21 12:13:11,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:11,561 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:13:11,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:13:11,562 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-21 12:13:11,564 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-21 12:13:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:11,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 12:13:11,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:11,750 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-21 12:13:11,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:13:11,751 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:13:11,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337683631] [2021-12-21 12:13:11,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337683631] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:13:11,751 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:13:11,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 12:13:11,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102467362] [2021-12-21 12:13:11,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:13:11,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:13:11,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:13:11,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:13:11,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:13:11,754 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:11,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:11,919 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2021-12-21 12:13:11,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 12:13:11,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-21 12:13:11,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:11,920 INFO L225 Difference]: With dead ends: 34 [2021-12-21 12:13:11,920 INFO L226 Difference]: Without dead ends: 19 [2021-12-21 12:13:11,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 12:13:11,922 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:11,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:13:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-21 12:13:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-21 12:13:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2021-12-21 12:13:11,926 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 11 [2021-12-21 12:13:11,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:11,926 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-12-21 12:13:11,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2021-12-21 12:13:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-21 12:13:11,927 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:11,927 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:11,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-21 12:13:12,127 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-21 12:13:12,128 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:12,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:12,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2088599158, now seen corresponding path program 1 times [2021-12-21 12:13:12,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:13:12,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875594039] [2021-12-21 12:13:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:12,129 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:13:12,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:13:12,130 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-21 12:13:12,131 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-21 12:13:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:12,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 12:13:12,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:12,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:13:12,231 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:13:12,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875594039] [2021-12-21 12:13:12,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875594039] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:13:12,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:13:12,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 12:13:12,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677718783] [2021-12-21 12:13:12,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:13:12,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-21 12:13:12,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:13:12,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 12:13:12,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 12:13:12,234 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:12,351 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2021-12-21 12:13:12,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 12:13:12,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-21 12:13:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:12,352 INFO L225 Difference]: With dead ends: 34 [2021-12-21 12:13:12,352 INFO L226 Difference]: Without dead ends: 28 [2021-12-21 12:13:12,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-21 12:13:12,354 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 33 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:12,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 36 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-21 12:13:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-12-21 12:13:12,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2021-12-21 12:13:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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-21 12:13:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2021-12-21 12:13:12,359 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 14 [2021-12-21 12:13:12,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:12,359 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2021-12-21 12:13:12,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-21 12:13:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2021-12-21 12:13:12,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-21 12:13:12,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:12,360 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:12,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-21 12:13:12,570 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-21 12:13:12,570 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:12,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1311378947, now seen corresponding path program 1 times [2021-12-21 12:13:12,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:13:12,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928457370] [2021-12-21 12:13:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:12,572 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:13:12,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:13:12,573 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-21 12:13:12,574 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-21 12:13:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:12,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 12:13:12,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 12:13:12,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 12:13:12,688 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:13:12,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928457370] [2021-12-21 12:13:12,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928457370] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 12:13:12,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 12:13:12,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 12:13:12,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178422792] [2021-12-21 12:13:12,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 12:13:12,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 12:13:12,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:13:12,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 12:13:12,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:13:12,690 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-21 12:13:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:12,712 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2021-12-21 12:13:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 12:13:12,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-21 12:13:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:12,715 INFO L225 Difference]: With dead ends: 35 [2021-12-21 12:13:12,715 INFO L226 Difference]: Without dead ends: 25 [2021-12-21 12:13:12,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 12:13:12,717 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:12,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-21 12:13:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-21 12:13:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-21 12:13:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 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-21 12:13:12,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2021-12-21 12:13:12,721 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 18 [2021-12-21 12:13:12,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:12,722 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2021-12-21 12:13:12,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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-21 12:13:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2021-12-21 12:13:12,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-21 12:13:12,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:12,723 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:12,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-21 12:13:12,940 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-21 12:13:12,940 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:12,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:12,941 INFO L85 PathProgramCache]: Analyzing trace with hash 502032321, now seen corresponding path program 1 times [2021-12-21 12:13:12,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:13:12,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926640361] [2021-12-21 12:13:12,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:12,942 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:13:12,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:13:12,943 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-21 12:13:12,945 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-21 12:13:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:13,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-21 12:13:13,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:13,264 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 0 case distinctions, treesize of input 40 treesize of output 33 [2021-12-21 12:13:13,295 INFO L353 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2021-12-21 12:13:13,296 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 61 [2021-12-21 12:13:13,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:13:13,417 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-21 12:13:13,417 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 45 treesize of output 15 [2021-12-21 12:13:13,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 12:13:13,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:13:13,702 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:13,702 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 2800 treesize of output 2614 [2021-12-21 12:13:14,195 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:13:14,196 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2021-12-21 12:13:14,274 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:13:14,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:13:14,303 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:14,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 71 [2021-12-21 12:13:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 12:13:14,665 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:13:14,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926640361] [2021-12-21 12:13:14,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926640361] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:13:14,665 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:13:14,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2021-12-21 12:13:14,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131901954] [2021-12-21 12:13:14,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:13:14,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-21 12:13:14,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:13:14,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-21 12:13:14,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-21 12:13:14,668 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:17,192 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-21 12:13:19,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-21 12:13:21,219 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-21 12:13:23,236 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-21 12:13:29,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-21 12:13:31,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-21 12:13:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:31,609 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2021-12-21 12:13:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 12:13:31,610 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-21 12:13:31,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:31,611 INFO L225 Difference]: With dead ends: 43 [2021-12-21 12:13:31,611 INFO L226 Difference]: Without dead ends: 41 [2021-12-21 12:13:31,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=67, Invalid=203, Unknown=2, NotChecked=0, Total=272 [2021-12-21 12:13:31,612 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 17 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:31,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 119 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 120 Invalid, 6 Unknown, 34 Unchecked, 12.6s Time] [2021-12-21 12:13:31,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-21 12:13:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2021-12-21 12:13:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 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-21 12:13:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2021-12-21 12:13:31,619 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 18 [2021-12-21 12:13:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:31,620 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2021-12-21 12:13:31,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2021-12-21 12:13:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-21 12:13:31,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:31,621 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:31,634 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-21 12:13:31,823 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-21 12:13:31,824 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:31,824 INFO L85 PathProgramCache]: Analyzing trace with hash 972646004, now seen corresponding path program 1 times [2021-12-21 12:13:31,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:13:31,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600238485] [2021-12-21 12:13:31,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 12:13:31,825 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:13:31,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:13:31,826 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-21 12:13:31,826 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-21 12:13:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 12:13:31,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-21 12:13:31,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:32,033 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-21 12:13:32,041 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-21 12:13:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 12:13:32,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:13:32,161 INFO L353 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-21 12:13:32,161 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 24 treesize of output 23 [2021-12-21 12:13:32,174 INFO L353 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-21 12:13:32,175 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 20 treesize of output 12 [2021-12-21 12:13:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 12:13:32,209 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:13:32,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600238485] [2021-12-21 12:13:32,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600238485] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:13:32,209 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:13:32,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-12-21 12:13:32,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974002298] [2021-12-21 12:13:32,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:13:32,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 12:13:32,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:13:32,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 12:13:32,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 12:13:32,210 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:32,621 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2021-12-21 12:13:32,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 12:13:32,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-21 12:13:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:32,622 INFO L225 Difference]: With dead ends: 57 [2021-12-21 12:13:32,622 INFO L226 Difference]: Without dead ends: 47 [2021-12-21 12:13:32,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-21 12:13:32,623 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:32,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 94 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-21 12:13:32,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-12-21 12:13:32,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2021-12-21 12:13:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 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-21 12:13:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2021-12-21 12:13:32,629 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 21 [2021-12-21 12:13:32,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:32,629 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2021-12-21 12:13:32,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 12:13:32,629 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2021-12-21 12:13:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-21 12:13:32,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:32,630 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:32,642 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-21 12:13:32,830 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-21 12:13:32,830 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:32,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:32,831 INFO L85 PathProgramCache]: Analyzing trace with hash 803189644, now seen corresponding path program 2 times [2021-12-21 12:13:32,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:13:32,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1180704050] [2021-12-21 12:13:32,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:13:32,832 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:13:32,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:13:32,833 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-21 12:13:32,835 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-21 12:13:32,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 12:13:32,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:13:32,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 12:13:32,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:33,003 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-21 12:13:33,008 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-21 12:13:33,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-12-21 12:13:33,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-12-21 12:13:33,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-21 12:13:33,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 11 treesize of output 7 [2021-12-21 12:13:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:33,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:13:33,271 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-21 12:13:33,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2021-12-21 12:13:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:33,288 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:13:33,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1180704050] [2021-12-21 12:13:33,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1180704050] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:13:33,289 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:13:33,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-12-21 12:13:33,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405544006] [2021-12-21 12:13:33,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:13:33,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 12:13:33,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:13:33,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 12:13:33,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-21 12:13:33,290 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-21 12:13:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:33,696 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2021-12-21 12:13:33,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 12:13:33,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-21 12:13:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:33,697 INFO L225 Difference]: With dead ends: 64 [2021-12-21 12:13:33,697 INFO L226 Difference]: Without dead ends: 37 [2021-12-21 12:13:33,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-21 12:13:33,698 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:33,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 95 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 21 Unchecked, 0.4s Time] [2021-12-21 12:13:33,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-21 12:13:33,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-12-21 12:13:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 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-21 12:13:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2021-12-21 12:13:33,703 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 22 [2021-12-21 12:13:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:33,704 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2021-12-21 12:13:33,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-21 12:13:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2021-12-21 12:13:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-21 12:13:33,705 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:33,705 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:33,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-21 12:13:33,917 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-21 12:13:33,917 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:33,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash 349213841, now seen corresponding path program 3 times [2021-12-21 12:13:33,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:13:33,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674595627] [2021-12-21 12:13:33,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 12:13:33,918 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:13:33,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:13:33,919 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-21 12:13:33,920 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-21 12:13:34,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-21 12:13:34,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:13:34,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-21 12:13:34,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:34,145 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-21 12:13:34,185 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 17 treesize of output 22 [2021-12-21 12:13:34,192 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-21 12:13:34,200 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-21 12:13:34,201 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 15 treesize of output 15 [2021-12-21 12:13:34,433 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 26 treesize of output 22 [2021-12-21 12:13:34,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:34,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:34,437 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-12-21 12:13:34,445 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 48 treesize of output 39 [2021-12-21 12:13:34,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:34,449 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:13:34,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:34,451 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2021-12-21 12:13:34,536 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 33 treesize of output 31 [2021-12-21 12:13:34,625 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:34,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2021-12-21 12:13:34,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:34,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:13:34,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_242) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) is different from false [2021-12-21 12:13:34,796 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_238 (_ BitVec 32)) (v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_237 (_ BitVec 32)) (v_ArrVal_240 (_ BitVec 32))) (not (let ((.cse0 (select (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|))) (store (store .cse1 .cse2 |c_ULTIMATE.start_main_~order~0#1|) .cse3 (select (store .cse1 .cse2 v_ArrVal_240) .cse3)))) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) .cse2 v_ArrVal_238) .cse3 v_ArrVal_237) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_242)) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|)))))) |c_ULTIMATE.start_main_#t~short8#1|) is different from false [2021-12-21 12:13:34,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (_ BitVec 32)) (v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_237 (_ BitVec 32)) (|v_ULTIMATE.start_main_~order~0#1_11| (_ BitVec 32)) (v_ArrVal_240 (_ BitVec 32))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (let ((.cse0 (select (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse1 .cse2 |v_ULTIMATE.start_main_~order~0#1_11|) .cse3 (select (store .cse1 .cse2 v_ArrVal_240) .cse3))) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base|) .cse2 v_ArrVal_238) .cse3 v_ArrVal_237) |c_ULTIMATE.start_main_~i~0#1.offset|) v_ArrVal_242)) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|)) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|))))) (bvslt (select .cse1 .cse3) |v_ULTIMATE.start_main_~order~0#1_11|) (bvslt |v_ULTIMATE.start_main_~order~0#1_11| (_ bv0 32))))) is different from false [2021-12-21 12:13:35,001 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (_ BitVec 32)) (v_ArrVal_242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_237 (_ BitVec 32)) (|v_ULTIMATE.start_main_~order~0#1_11| (_ BitVec 32)) (v_ArrVal_240 (_ BitVec 32))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~l~0#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~l~0#1.offset|))) (or (bvslt (select .cse0 .cse1) |v_ULTIMATE.start_main_~order~0#1_11|) (not (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~l~0#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~l~0#1.base| (store (store .cse0 .cse3 |v_ULTIMATE.start_main_~order~0#1_11|) .cse1 (select (store .cse0 .cse3 v_ArrVal_240) .cse1))) (select (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~l~0#1.base|) .cse3 v_ArrVal_238) .cse1 v_ArrVal_237) |c_ULTIMATE.start_main_~l~0#1.offset|) v_ArrVal_242) |c_ULTIMATE.start_main_~l~0#1.base|))) (bvsgt (select .cse2 .cse3) (select .cse2 .cse1))))) (bvslt |v_ULTIMATE.start_main_~order~0#1_11| (_ bv0 32))))) is different from false [2021-12-21 12:13:35,071 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:35,071 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 2 case distinctions, treesize of input 133 treesize of output 94 [2021-12-21 12:13:35,099 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:35,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 25 treesize of output 28 [2021-12-21 12:13:35,105 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 44 treesize of output 40 [2021-12-21 12:13:35,111 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2021-12-21 12:13:35,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2021-12-21 12:13:35,144 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-21 12:13:35,144 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-21 12:13:35,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674595627] [2021-12-21 12:13:35,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674595627] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 12:13:35,144 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-21 12:13:35,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2021-12-21 12:13:35,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293925570] [2021-12-21 12:13:35,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-21 12:13:35,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-21 12:13:35,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-21 12:13:35,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-21 12:13:35,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=174, Unknown=4, NotChecked=116, Total=342 [2021-12-21 12:13:35,145 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 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-21 12:13:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 12:13:36,713 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2021-12-21 12:13:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 12:13:36,714 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 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-21 12:13:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 12:13:36,714 INFO L225 Difference]: With dead ends: 58 [2021-12-21 12:13:36,714 INFO L226 Difference]: Without dead ends: 53 [2021-12-21 12:13:36,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=127, Invalid=391, Unknown=4, NotChecked=180, Total=702 [2021-12-21 12:13:36,715 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 62 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-21 12:13:36,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 179 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 140 Invalid, 0 Unknown, 170 Unchecked, 1.0s Time] [2021-12-21 12:13:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-12-21 12:13:36,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 46. [2021-12-21 12:13:36,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 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-21 12:13:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2021-12-21 12:13:36,722 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 25 [2021-12-21 12:13:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 12:13:36,723 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2021-12-21 12:13:36,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 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-21 12:13:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2021-12-21 12:13:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-21 12:13:36,724 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 12:13:36,724 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 12:13:36,741 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-21 12:13:36,936 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-21 12:13:36,937 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 12:13:36,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 12:13:36,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1022642084, now seen corresponding path program 2 times [2021-12-21 12:13:36,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-21 12:13:36,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31596225] [2021-12-21 12:13:36,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 12:13:36,938 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-21 12:13:36,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-21 12:13:36,939 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-21 12:13:36,939 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-21 12:13:37,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 12:13:37,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 12:13:37,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-21 12:13:37,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 12:13:37,158 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-21 12:13:37,185 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-21 12:13:37,192 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-21 12:13:37,201 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2021-12-21 12:13:37,202 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 15 treesize of output 15 [2021-12-21 12:13:37,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:37,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:37,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:37,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2021-12-21 12:13:37,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:37,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:37,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:37,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2021-12-21 12:13:37,538 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-21 12:13:37,538 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 104 treesize of output 97 [2021-12-21 12:13:37,544 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 0 case distinctions, treesize of input 76 treesize of output 57 [2021-12-21 12:13:37,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:37,554 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 74 treesize of output 66 [2021-12-21 12:13:37,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:37,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-21 12:13:37,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2021-12-21 12:13:37,712 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 66 treesize of output 46 [2021-12-21 12:13:37,716 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 53 treesize of output 33 [2021-12-21 12:13:37,759 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:37,760 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2021-12-21 12:13:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 12:13:37,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 12:13:37,962 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_320 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_318 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_321 (_ BitVec 32))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (store .cse2 .cse3 |c_ULTIMATE.start_main_~order~0#1|) .cse4 (select (store .cse2 .cse3 v_ArrVal_321) .cse4)))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_320) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (bvsgt (select .cse0 (bvadd .cse1 (_ bv8 32))) (select .cse0 (bvadd .cse1 (_ bv4 32))))))) |c_ULTIMATE.start_main_#t~short8#1|) is different from false [2021-12-21 12:13:37,995 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 12:13:37,996 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 2484 treesize of output 2289 [2021-12-21 12:13:38,615 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-21 12:13:38,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 4 [2021-12-21 12:13:39,416 INFO L353 Elim1Store]: treesize reduction 40, result has 70.6 percent of original size [2021-12-21 12:13:39,416 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 242