./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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/array-fpi/brs1.c -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 1719c559f228c1029533750a96ea896ed07efcc9b139440443e471db2c10d1e7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:23:25,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:23:25,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:23:25,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:23:25,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:23:25,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:23:25,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:23:25,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:23:25,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:23:25,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:23:25,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:23:25,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:23:25,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:23:25,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:23:25,604 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:23:25,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:23:25,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:23:25,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:23:25,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:23:25,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:23:25,612 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:23:25,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:23:25,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:23:25,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:23:25,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:23:25,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:23:25,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:23:25,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:23:25,627 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:23:25,628 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:23:25,628 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:23:25,629 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:23:25,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:23:25,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:23:25,632 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:23:25,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:23:25,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:23:25,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:23:25,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:23:25,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:23:25,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:23:25,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:23:25,639 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:23:25,672 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:23:25,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:23:25,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:23:25,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:23:25,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:23:25,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:23:25,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:23:25,677 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:23:25,677 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:23:25,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:23:25,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:23:25,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:23:25,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:23:25,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:23:25,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:23:25,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:23:25,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:23:25,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:23:25,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:23:25,681 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:23:25,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:23:25,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:23:25,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:23:25,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:23:25,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:23:25,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:23:25,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:23:25,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:23:25,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:23:25,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:23:25,684 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:23:25,684 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:23:25,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:23:25,685 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 -> 1719c559f228c1029533750a96ea896ed07efcc9b139440443e471db2c10d1e7 [2022-07-19 10:23:25,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:23:25,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:23:25,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:23:25,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:23:25,964 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:23:25,964 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs1.c [2022-07-19 10:23:26,053 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb872be48/f3066ee3e3144e2ca4b6a7ad18b51310/FLAGcdfe0d884 [2022-07-19 10:23:26,489 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:23:26,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs1.c [2022-07-19 10:23:26,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb872be48/f3066ee3e3144e2ca4b6a7ad18b51310/FLAGcdfe0d884 [2022-07-19 10:23:26,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb872be48/f3066ee3e3144e2ca4b6a7ad18b51310 [2022-07-19 10:23:26,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:23:26,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:23:26,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:23:26,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:23:26,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:23:26,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:23:26" (1/1) ... [2022-07-19 10:23:26,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11808228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:26, skipping insertion in model container [2022-07-19 10:23:26,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:23:26" (1/1) ... [2022-07-19 10:23:26,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:23:26,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:23:27,087 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/array-fpi/brs1.c[587,600] [2022-07-19 10:23:27,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:23:27,113 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:23:27,129 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/array-fpi/brs1.c[587,600] [2022-07-19 10:23:27,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:23:27,164 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:23:27,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:27 WrapperNode [2022-07-19 10:23:27,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:23:27,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:23:27,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:23:27,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:23:27,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:27" (1/1) ... [2022-07-19 10:23:27,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:27" (1/1) ... [2022-07-19 10:23:27,209 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2022-07-19 10:23:27,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:23:27,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:23:27,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:23:27,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:23:27,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:27" (1/1) ... [2022-07-19 10:23:27,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:27" (1/1) ... [2022-07-19 10:23:27,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:27" (1/1) ... [2022-07-19 10:23:27,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:27" (1/1) ... [2022-07-19 10:23:27,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:27" (1/1) ... [2022-07-19 10:23:27,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:27" (1/1) ... [2022-07-19 10:23:27,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:27" (1/1) ... [2022-07-19 10:23:27,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:23:27,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:23:27,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:23:27,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:23:27,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:27" (1/1) ... [2022-07-19 10:23:27,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:23:27,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:23:27,289 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) [2022-07-19 10:23:27,311 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 [2022-07-19 10:23:27,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:23:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:23:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 10:23:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 10:23:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 10:23:27,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:23:27,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:23:27,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 10:23:27,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 10:23:27,398 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:23:27,400 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:23:27,570 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:23:27,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:23:27,590 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-19 10:23:27,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:23:27 BoogieIcfgContainer [2022-07-19 10:23:27,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:23:27,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:23:27,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:23:27,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:23:27,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:23:26" (1/3) ... [2022-07-19 10:23:27,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb6273f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:23:27, skipping insertion in model container [2022-07-19 10:23:27,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:27" (2/3) ... [2022-07-19 10:23:27,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eb6273f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:23:27, skipping insertion in model container [2022-07-19 10:23:27,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:23:27" (3/3) ... [2022-07-19 10:23:27,613 INFO L111 eAbstractionObserver]: Analyzing ICFG brs1.c [2022-07-19 10:23:27,625 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:23:27,634 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:23:27,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:23:27,700 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@58d52882, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@758af316 [2022-07-19 10:23:27,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:23:27,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 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) [2022-07-19 10:23:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 10:23:27,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:23:27,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:23:27,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:23:27,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:23:27,739 INFO L85 PathProgramCache]: Analyzing trace with hash 361760665, now seen corresponding path program 1 times [2022-07-19 10:23:27,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:23:27,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230141304] [2022-07-19 10:23:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:23:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:23:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:23:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:27,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:23:27,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230141304] [2022-07-19 10:23:27,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230141304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:23:27,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:23:27,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 10:23:27,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129672692] [2022-07-19 10:23:27,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:23:27,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 10:23:27,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:23:27,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 10:23:27,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 10:23:27,982 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 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 5.5) internal successors, (11), 2 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) [2022-07-19 10:23:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:23:27,995 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-07-19 10:23:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 10:23:27,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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 [2022-07-19 10:23:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:23:28,004 INFO L225 Difference]: With dead ends: 36 [2022-07-19 10:23:28,004 INFO L226 Difference]: Without dead ends: 16 [2022-07-19 10:23:28,008 INFO L412 NwaCegarLoop]: 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 [2022-07-19 10:23:28,014 INFO L413 NwaCegarLoop]: 23 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, 23 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 [2022-07-19 10:23:28,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:23:28,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-19 10:23:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-19 10:23:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 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) [2022-07-19 10:23:28,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-07-19 10:23:28,047 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2022-07-19 10:23:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:23:28,047 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-07-19 10:23:28,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) [2022-07-19 10:23:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-07-19 10:23:28,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 10:23:28,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:23:28,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:23:28,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:23:28,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:23:28,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:23:28,051 INFO L85 PathProgramCache]: Analyzing trace with hash -447913662, now seen corresponding path program 1 times [2022-07-19 10:23:28,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:23:28,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105511032] [2022-07-19 10:23:28,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:23:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:23:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:23:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:28,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:23:28,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105511032] [2022-07-19 10:23:28,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105511032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:23:28,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:23:28,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:23:28,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290314178] [2022-07-19 10:23:28,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:23:28,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:23:28,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:23:28,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:23:28,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:23:28,141 INFO L87 Difference]: Start difference. First operand 16 states and 18 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) [2022-07-19 10:23:28,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:23:28,207 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-07-19 10:23:28,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:23:28,208 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 [2022-07-19 10:23:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:23:28,209 INFO L225 Difference]: With dead ends: 30 [2022-07-19 10:23:28,210 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 10:23:28,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:23:28,212 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:23:28,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 11 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:23:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 10:23:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-07-19 10:23:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 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) [2022-07-19 10:23:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-19 10:23:28,217 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2022-07-19 10:23:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:23:28,218 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-19 10:23:28,218 INFO L496 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) [2022-07-19 10:23:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-07-19 10:23:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 10:23:28,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:23:28,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:23:28,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:23:28,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:23:28,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:23:28,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1044113915, now seen corresponding path program 1 times [2022-07-19 10:23:28,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:23:28,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324877043] [2022-07-19 10:23:28,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:23:28,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:23:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:23:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 10:23:28,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:23:28,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324877043] [2022-07-19 10:23:28,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324877043] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:23:28,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:23:28,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:23:28,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219633382] [2022-07-19 10:23:28,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:23:28,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:23:28,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:23:28,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:23:28,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:23:28,315 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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) [2022-07-19 10:23:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:23:28,368 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-07-19 10:23:28,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:23:28,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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 17 [2022-07-19 10:23:28,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:23:28,370 INFO L225 Difference]: With dead ends: 26 [2022-07-19 10:23:28,370 INFO L226 Difference]: Without dead ends: 22 [2022-07-19 10:23:28,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:23:28,372 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:23:28,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:23:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-19 10:23:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-07-19 10:23:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 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) [2022-07-19 10:23:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-07-19 10:23:28,377 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-07-19 10:23:28,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:23:28,377 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-07-19 10:23:28,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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) [2022-07-19 10:23:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-07-19 10:23:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:23:28,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:23:28,379 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:23:28,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:23:28,379 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:23:28,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:23:28,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1654199858, now seen corresponding path program 1 times [2022-07-19 10:23:28,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:23:28,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349966086] [2022-07-19 10:23:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:23:28,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:23:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:23:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:28,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:23:28,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349966086] [2022-07-19 10:23:28,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349966086] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:23:28,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822472886] [2022-07-19 10:23:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:23:28,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:28,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:23:28,535 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) [2022-07-19 10:23:28,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:23:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:23:28,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:23:28,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:23:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:28,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:23:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:28,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822472886] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:23:28,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:23:28,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-19 10:23:28,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277759206] [2022-07-19 10:23:28,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:23:28,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:23:28,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:23:28,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:23:28,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:23:28,794 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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) [2022-07-19 10:23:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:23:28,870 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-07-19 10:23:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:23:28,870 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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 [2022-07-19 10:23:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:23:28,871 INFO L225 Difference]: With dead ends: 42 [2022-07-19 10:23:28,871 INFO L226 Difference]: Without dead ends: 28 [2022-07-19 10:23:28,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:23:28,873 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:23:28,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 21 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:23:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-19 10:23:28,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-07-19 10:23:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:23:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-07-19 10:23:28,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2022-07-19 10:23:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:23:28,879 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-07-19 10:23:28,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 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) [2022-07-19 10:23:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-07-19 10:23:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 10:23:28,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:23:28,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:23:28,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:23:29,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:29,091 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:23:29,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:23:29,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1179965024, now seen corresponding path program 2 times [2022-07-19 10:23:29,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:23:29,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797635850] [2022-07-19 10:23:29,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:23:29,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:23:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:23:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:29,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:23:29,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797635850] [2022-07-19 10:23:29,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797635850] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:23:29,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349873196] [2022-07-19 10:23:29,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:23:29,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:29,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:23:29,480 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) [2022-07-19 10:23:29,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 10:23:29,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:23:29,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:23:29,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 10:23:29,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:23:29,680 INFO L390 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 15 treesize of output 11 [2022-07-19 10:23:29,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:29,867 INFO L390 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 23 treesize of output 22 [2022-07-19 10:23:30,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:30,030 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-19 10:23:30,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-07-19 10:23:32,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:32,330 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-19 10:23:32,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 34 treesize of output 13 [2022-07-19 10:23:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:32,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:23:34,127 INFO L390 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 238 treesize of output 222 [2022-07-19 10:23:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:34,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349873196] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:23:34,391 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:23:34,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 33 [2022-07-19 10:23:34,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897999924] [2022-07-19 10:23:34,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:23:34,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-19 10:23:34,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:23:34,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-19 10:23:34,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=880, Unknown=2, NotChecked=0, Total=1056 [2022-07-19 10:23:34,393 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:23:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:23:34,842 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2022-07-19 10:23:34,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-19 10:23:34,842 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 0 states have call successors, (0), 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 [2022-07-19 10:23:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:23:34,843 INFO L225 Difference]: With dead ends: 42 [2022-07-19 10:23:34,843 INFO L226 Difference]: Without dead ends: 38 [2022-07-19 10:23:34,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=319, Invalid=1485, Unknown=2, NotChecked=0, Total=1806 [2022-07-19 10:23:34,845 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:23:34,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 63 Unchecked, 0.0s Time] [2022-07-19 10:23:34,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-19 10:23:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2022-07-19 10:23:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:23:34,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-19 10:23:34,860 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 23 [2022-07-19 10:23:34,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:23:34,861 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-19 10:23:34,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:23:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-19 10:23:34,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:23:34,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:23:34,862 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:23:34,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 10:23:35,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:35,088 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:23:35,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:23:35,088 INFO L85 PathProgramCache]: Analyzing trace with hash -373004471, now seen corresponding path program 3 times [2022-07-19 10:23:35,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:23:35,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015476442] [2022-07-19 10:23:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:23:35,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:23:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:23:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:35,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:23:35,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015476442] [2022-07-19 10:23:35,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015476442] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:23:35,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634541413] [2022-07-19 10:23:35,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:23:35,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:35,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:23:35,168 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) [2022-07-19 10:23:35,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 10:23:35,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-19 10:23:35,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:23:35,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:23:35,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:23:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:35,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:23:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:35,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634541413] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:23:35,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:23:35,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 10:23:35,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674499485] [2022-07-19 10:23:35,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:23:35,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:23:35,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:23:35,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:23:35,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:23:35,341 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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) [2022-07-19 10:23:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:23:35,442 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-07-19 10:23:35,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:23:35,442 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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 26 [2022-07-19 10:23:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:23:35,444 INFO L225 Difference]: With dead ends: 58 [2022-07-19 10:23:35,444 INFO L226 Difference]: Without dead ends: 38 [2022-07-19 10:23:35,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:23:35,448 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 67 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:23:35,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 24 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:23:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-19 10:23:35,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2022-07-19 10:23:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 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) [2022-07-19 10:23:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-07-19 10:23:35,458 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 26 [2022-07-19 10:23:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:23:35,458 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-07-19 10:23:35,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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) [2022-07-19 10:23:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-07-19 10:23:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 10:23:35,459 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:23:35,459 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:23:35,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 10:23:35,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:35,684 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:23:35,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:23:35,684 INFO L85 PathProgramCache]: Analyzing trace with hash -976107378, now seen corresponding path program 4 times [2022-07-19 10:23:35,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:23:35,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002092484] [2022-07-19 10:23:35,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:23:35,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:23:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:23:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:35,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:23:35,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002092484] [2022-07-19 10:23:35,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002092484] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:23:35,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890364965] [2022-07-19 10:23:35,794 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:23:35,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:35,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:23:35,796 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) [2022-07-19 10:23:35,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 10:23:35,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:23:35,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:23:35,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 10:23:35,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:23:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:35,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:23:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:35,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890364965] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:23:35,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:23:35,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-07-19 10:23:35,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643434597] [2022-07-19 10:23:35,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:23:35,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:23:35,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:23:35,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:23:35,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:23:35,958 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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) [2022-07-19 10:23:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:23:36,129 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-19 10:23:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:23:36,129 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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 26 [2022-07-19 10:23:36,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:23:36,130 INFO L225 Difference]: With dead ends: 41 [2022-07-19 10:23:36,130 INFO L226 Difference]: Without dead ends: 32 [2022-07-19 10:23:36,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:23:36,131 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 53 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:23:36,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:23:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-19 10:23:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-07-19 10:23:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 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) [2022-07-19 10:23:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-19 10:23:36,136 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2022-07-19 10:23:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:23:36,136 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-19 10:23:36,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 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) [2022-07-19 10:23:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-19 10:23:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:23:36,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:23:36,137 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:23:36,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 10:23:36,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:36,338 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:23:36,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:23:36,339 INFO L85 PathProgramCache]: Analyzing trace with hash -690020773, now seen corresponding path program 5 times [2022-07-19 10:23:36,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:23:36,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079109820] [2022-07-19 10:23:36,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:23:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:23:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:23:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:36,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:23:36,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079109820] [2022-07-19 10:23:36,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079109820] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:23:36,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362342773] [2022-07-19 10:23:36,910 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 10:23:36,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:36,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:23:36,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:23:36,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 10:23:36,984 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-19 10:23:36,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:23:36,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-19 10:23:37,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:23:37,009 INFO L390 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 10 treesize of output 8 [2022-07-19 10:23:37,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 10:23:37,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:37,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-07-19 10:23:37,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:37,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2022-07-19 10:23:37,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:23:37,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:37,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 44 [2022-07-19 10:23:37,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:37,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:23:37,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2022-07-19 10:23:37,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:37,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 15 [2022-07-19 10:23:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:37,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:23:47,268 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 10:23:47,268 INFO L390 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 1332 treesize of output 1296 [2022-07-19 10:23:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:47,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362342773] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:23:47,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:23:47,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 39 [2022-07-19 10:23:47,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378424132] [2022-07-19 10:23:47,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:23:47,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-19 10:23:47,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:23:47,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-19 10:23:47,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1302, Unknown=5, NotChecked=0, Total=1482 [2022-07-19 10:23:47,800 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:23:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:23:48,435 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-07-19 10:23:48,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-19 10:23:48,436 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-19 10:23:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:23:48,436 INFO L225 Difference]: With dead ends: 64 [2022-07-19 10:23:48,437 INFO L226 Difference]: Without dead ends: 59 [2022-07-19 10:23:48,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=346, Invalid=2301, Unknown=5, NotChecked=0, Total=2652 [2022-07-19 10:23:48,438 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:23:48,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 111 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 176 Invalid, 0 Unknown, 129 Unchecked, 0.1s Time] [2022-07-19 10:23:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-19 10:23:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2022-07-19 10:23:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 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) [2022-07-19 10:23:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-19 10:23:48,446 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 29 [2022-07-19 10:23:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:23:48,446 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-19 10:23:48,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:23:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-19 10:23:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:23:48,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:23:48,448 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:23:48,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-19 10:23:48,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:48,652 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:23:48,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:23:48,652 INFO L85 PathProgramCache]: Analyzing trace with hash 900913518, now seen corresponding path program 6 times [2022-07-19 10:23:48,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:23:48,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443666976] [2022-07-19 10:23:48,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:23:48,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:23:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:23:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:48,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:23:48,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443666976] [2022-07-19 10:23:48,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443666976] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:23:48,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716215911] [2022-07-19 10:23:48,757 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 10:23:48,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:23:48,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:23:48,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 10:23:48,829 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-19 10:23:48,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:23:48,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:23:48,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:23:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:48,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:23:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:48,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716215911] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:23:48,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:23:48,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-07-19 10:23:48,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159772965] [2022-07-19 10:23:48,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:23:48,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:23:48,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:23:48,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:23:48,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:23:48,976 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:23:49,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:23:49,116 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-07-19 10:23:49,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:23:49,116 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 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 32 [2022-07-19 10:23:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:23:49,117 INFO L225 Difference]: With dead ends: 74 [2022-07-19 10:23:49,117 INFO L226 Difference]: Without dead ends: 56 [2022-07-19 10:23:49,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-07-19 10:23:49,118 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:23:49,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 55 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:23:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-19 10:23:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2022-07-19 10:23:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 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) [2022-07-19 10:23:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-07-19 10:23:49,125 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 32 [2022-07-19 10:23:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:23:49,125 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-07-19 10:23:49,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:23:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-07-19 10:23:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 10:23:49,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:23:49,126 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:23:49,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-19 10:23:49,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:49,327 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:23:49,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:23:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1277658368, now seen corresponding path program 7 times [2022-07-19 10:23:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:23:49,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366634620] [2022-07-19 10:23:49,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:23:49,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:23:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:23:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:50,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:23:50,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366634620] [2022-07-19 10:23:50,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366634620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:23:50,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266301660] [2022-07-19 10:23:50,228 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-19 10:23:50,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:23:50,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:23:50,232 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:23:50,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 10:23:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:23:50,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-19 10:23:50,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:23:50,318 INFO L390 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 10 treesize of output 8 [2022-07-19 10:23:50,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-19 10:23:50,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:50,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-07-19 10:23:50,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:50,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:50,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:50,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2022-07-19 10:23:50,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:50,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:50,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:50,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2022-07-19 10:23:50,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:50,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:50,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:50,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:50,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:23:50,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 59 [2022-07-19 10:23:51,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:51,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:23:51,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:51,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:51,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2022-07-19 10:23:51,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:51,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:51,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:51,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 10:23:51,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 54 [2022-07-19 10:23:51,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:51,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:51,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:23:51,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 19 [2022-07-19 10:23:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:23:51,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:24:32,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_268 Int) (v_ArrVal_266 Int) (v_ArrVal_265 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_272 Int) (v_ArrVal_270 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_265) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_266))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_266 1)) (not (<= v_ArrVal_272 (+ v_ArrVal_270 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_270)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_272 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_272)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (not (<= v_ArrVal_268 0)) (not (<= v_ArrVal_270 (+ v_ArrVal_268 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_268)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_265 1)))))) is different from false [2022-07-19 10:24:46,492 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-07-19 10:24:46,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 5580 treesize of output 5508 [2022-07-19 10:24:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-19 10:24:52,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266301660] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:24:52,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:24:52,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 53 [2022-07-19 10:24:52,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459106957] [2022-07-19 10:24:52,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:24:52,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-19 10:24:52,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:24:52,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-19 10:24:52,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=2335, Unknown=24, NotChecked=100, Total=2756 [2022-07-19 10:24:52,446 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:25:26,709 WARN L233 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:26:17,113 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 10:26:17,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:26:17,733 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2022-07-19 10:26:17,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-19 10:26:17,733 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-19 10:26:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:26:17,734 INFO L225 Difference]: With dead ends: 79 [2022-07-19 10:26:17,734 INFO L226 Difference]: Without dead ends: 74 [2022-07-19 10:26:17,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 140.6s TimeCoverageRelationStatistics Valid=591, Invalid=4333, Unknown=50, NotChecked=138, Total=5112 [2022-07-19 10:26:17,737 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:26:17,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 118 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 321 Invalid, 0 Unknown, 271 Unchecked, 0.3s Time] [2022-07-19 10:26:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-19 10:26:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2022-07-19 10:26:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:26:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-07-19 10:26:17,747 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 35 [2022-07-19 10:26:17,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:26:17,747 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-07-19 10:26:17,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:26:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-07-19 10:26:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 10:26:17,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:26:17,748 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:26:17,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 10:26:17,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:26:17,962 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:26:17,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:26:17,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1826805659, now seen corresponding path program 8 times [2022-07-19 10:26:17,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:26:17,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536257366] [2022-07-19 10:26:17,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:26:17,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:26:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:26:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:26:18,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:26:18,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536257366] [2022-07-19 10:26:18,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536257366] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:26:18,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235760997] [2022-07-19 10:26:18,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 10:26:18,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:26:18,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:26:18,120 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:26:18,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 10:26:18,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 10:26:18,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:26:18,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-19 10:26:18,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:26:18,369 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 10:26:18,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:26:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-19 10:26:18,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235760997] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:26:18,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:26:18,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2022-07-19 10:26:18,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973965861] [2022-07-19 10:26:18,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:26:18,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 10:26:18,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:26:18,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 10:26:18,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:26:18,471 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 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) [2022-07-19 10:26:18,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:26:18,908 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-07-19 10:26:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 10:26:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 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) Word has length 35 [2022-07-19 10:26:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:26:18,909 INFO L225 Difference]: With dead ends: 80 [2022-07-19 10:26:18,909 INFO L226 Difference]: Without dead ends: 76 [2022-07-19 10:26:18,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=814, Unknown=0, NotChecked=0, Total=1056 [2022-07-19 10:26:18,910 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:26:18,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 26 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:26:18,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-19 10:26:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 39. [2022-07-19 10:26:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:26:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-07-19 10:26:18,919 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2022-07-19 10:26:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:26:18,919 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-07-19 10:26:18,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 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) [2022-07-19 10:26:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-07-19 10:26:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 10:26:18,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:26:18,920 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:26:18,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 10:26:19,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-19 10:26:19,145 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:26:19,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:26:19,145 INFO L85 PathProgramCache]: Analyzing trace with hash 876019369, now seen corresponding path program 9 times [2022-07-19 10:26:19,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:26:19,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303463465] [2022-07-19 10:26:19,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:26:19,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:26:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:26:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:26:19,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:26:19,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303463465] [2022-07-19 10:26:19,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303463465] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:26:19,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592483279] [2022-07-19 10:26:19,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 10:26:19,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:26:19,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:26:19,276 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:26:19,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-19 10:26:19,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-19 10:26:19,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:26:19,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 10:26:19,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:26:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:26:19,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:26:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:26:19,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592483279] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 10:26:19,606 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 10:26:19,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2022-07-19 10:26:19,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79772552] [2022-07-19 10:26:19,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 10:26:19,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-19 10:26:19,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:26:19,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-19 10:26:19,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-07-19 10:26:19,608 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:26:19,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:26:19,845 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-07-19 10:26:19,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:26:19,845 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-19 10:26:19,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:26:19,846 INFO L225 Difference]: With dead ends: 67 [2022-07-19 10:26:19,846 INFO L226 Difference]: Without dead ends: 46 [2022-07-19 10:26:19,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-19 10:26:19,847 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 58 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:26:19,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 37 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:26:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-19 10:26:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2022-07-19 10:26:19,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:26:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2022-07-19 10:26:19,856 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 38 [2022-07-19 10:26:19,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:26:19,857 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2022-07-19 10:26:19,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:26:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2022-07-19 10:26:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 10:26:19,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:26:19,858 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:26:19,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-19 10:26:20,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:26:20,079 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:26:20,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:26:20,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1188189509, now seen corresponding path program 10 times [2022-07-19 10:26:20,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:26:20,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703251345] [2022-07-19 10:26:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:26:20,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:26:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:26:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:26:21,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:26:21,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703251345] [2022-07-19 10:26:21,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703251345] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:26:21,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526024818] [2022-07-19 10:26:21,601 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 10:26:21,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:26:21,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:26:21,604 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:26:21,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 10:26:21,669 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 10:26:21,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 10:26:21,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-19 10:26:21,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:26:21,759 INFO L390 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 15 treesize of output 11 [2022-07-19 10:26:21,860 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 10:26:21,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-19 10:26:21,991 INFO L356 Elim1Store]: treesize reduction 84, result has 20.8 percent of original size [2022-07-19 10:26:21,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 39 [2022-07-19 10:26:22,206 INFO L356 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-07-19 10:26:22,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-07-19 10:26:22,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:26:22,390 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 10:26:22,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2022-07-19 10:26:22,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:26:22,573 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-19 10:26:22,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 72 treesize of output 75 [2022-07-19 10:26:22,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:26:22,801 INFO L356 Elim1Store]: treesize reduction 128, result has 0.8 percent of original size [2022-07-19 10:26:22,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 78 treesize of output 75 [2022-07-19 10:26:23,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:26:23,023 INFO L356 Elim1Store]: treesize reduction 205, result has 0.5 percent of original size [2022-07-19 10:26:23,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 89 [2022-07-19 10:26:23,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:26:23,348 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 10:26:23,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 67 [2022-07-19 10:26:31,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 10:26:31,715 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 10:26:31,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 23 [2022-07-19 10:26:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:26:31,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:26:59,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_421 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_428 Int) (v_ArrVal_427 Int) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_421)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_425 (+ v_ArrVal_423 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_423)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_421 1)) (not (<= v_ArrVal_428 (+ v_ArrVal_427 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_427)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_427 (+ v_ArrVal_425 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_428 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_428)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (not (<= v_ArrVal_423 0)))))) is different from false [2022-07-19 10:27:01,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_421 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_428 Int) (v_ArrVal_427 Int) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_421)))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (<= (+ v_ArrVal_428 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_428)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (not (<= v_ArrVal_425 (+ v_ArrVal_423 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_423)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_421 1)) (not (<= v_ArrVal_428 (+ v_ArrVal_427 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_427)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_427 (+ v_ArrVal_425 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_423 0)))))) is different from false [2022-07-19 10:27:03,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_421 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_418 Int) (v_ArrVal_428 Int) (v_ArrVal_427 Int) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_418) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_421))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_428 (+ v_ArrVal_427 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_427)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_427 (+ v_ArrVal_425 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_418 1)) (not (<= v_ArrVal_421 1)) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_428)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) v_ArrVal_428) (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (not (<= v_ArrVal_425 (+ v_ArrVal_423 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_423)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_423 0)))))) is different from false [2022-07-19 10:27:06,131 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_421 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_418 Int) (v_ArrVal_428 Int) (v_ArrVal_427 Int) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_418) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_421))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_425 (+ v_ArrVal_423 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_423)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_418 1)) (<= (+ v_ArrVal_428 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_428)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (not (<= v_ArrVal_421 1)) (not (<= v_ArrVal_428 (+ v_ArrVal_427 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_427)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_427 (+ v_ArrVal_425 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_423 0)))))) is different from false [2022-07-19 10:27:08,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_421 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_418 Int) (v_ArrVal_428 Int) (v_ArrVal_416 Int) (v_ArrVal_427 Int) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_416) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_418) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_421))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_416 1)) (not (<= v_ArrVal_427 (+ v_ArrVal_425 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (<= (+ v_ArrVal_428 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_428)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ 3 |c_ULTIMATE.start_main_~i~0#1|)) (not (<= v_ArrVal_418 1)) (not (<= v_ArrVal_421 1)) (not (<= v_ArrVal_425 (+ v_ArrVal_423 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_423)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_428 (+ v_ArrVal_427 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_427)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_423 0)))))) is different from false [2022-07-19 10:27:10,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_423 Int) (v_ArrVal_421 Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int) (v_ArrVal_418 Int) (v_ArrVal_428 Int) (v_ArrVal_416 Int) (v_ArrVal_427 Int) (v_ArrVal_425 Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_416) (+ .cse2 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_418) (+ .cse2 12 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_421))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (or (not (<= v_ArrVal_416 1)) (not (<= v_ArrVal_425 (+ v_ArrVal_423 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_423)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (not (<= v_ArrVal_428 (+ v_ArrVal_427 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_427)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_418 1)) (not (<= v_ArrVal_427 (+ v_ArrVal_425 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_425)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= v_ArrVal_421 1)) (<= (+ v_ArrVal_428 (select (select (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse1 |ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_428)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ |c_ULTIMATE.start_main_~i~0#1| 4)) (not (<= v_ArrVal_423 0)))))) is different from false [2022-07-19 10:27:10,638 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-07-19 10:27:10,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 851046 treesize of output 845664