./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/process_queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/process_queue.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:38:37,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:38:37,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:38:37,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:38:37,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:38:37,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:38:37,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:38:37,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:38:37,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:38:37,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:38:37,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:38:37,221 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:38:37,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:38:37,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:38:37,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:38:37,226 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:38:37,227 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:38:37,228 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:38:37,231 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:38:37,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:38:37,235 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:38:37,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:38:37,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:38:37,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:38:37,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:38:37,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:38:37,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:38:37,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:38:37,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:38:37,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:38:37,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:38:37,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:38:37,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:38:37,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:38:37,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:38:37,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:38:37,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:38:37,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:38:37,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:38:37,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:38:37,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:38:37,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:38:37,258 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:38:37,289 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:38:37,290 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:38:37,290 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:38:37,290 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:38:37,291 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:38:37,291 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:38:37,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:38:37,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:38:37,292 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:38:37,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:38:37,293 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:38:37,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:38:37,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:38:37,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:38:37,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:38:37,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:38:37,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:38:37,294 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:38:37,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:38:37,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:38:37,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:38:37,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:38:37,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:38:37,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:38:37,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:38:37,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:38:37,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:38:37,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:38:37,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:38:37,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:38:37,297 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:38:37,297 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:38:37,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:38:37,298 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 -> 1ad9f94c1d10f7bc5f4235ca7c5dc51413b43a0e6c48b9e48da5d2e3e751252c [2022-07-12 03:38:37,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:38:37,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:38:37,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:38:37,606 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:38:37,607 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:38:37,608 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/process_queue.i [2022-07-12 03:38:37,661 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bde08f85/036113678fed4562842023dd51e1252a/FLAGe8f2917b1 [2022-07-12 03:38:38,170 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:38:38,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/process_queue.i [2022-07-12 03:38:38,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bde08f85/036113678fed4562842023dd51e1252a/FLAGe8f2917b1 [2022-07-12 03:38:38,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bde08f85/036113678fed4562842023dd51e1252a [2022-07-12 03:38:38,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:38:38,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:38:38,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:38:38,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:38:38,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:38:38,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:38:38" (1/1) ... [2022-07-12 03:38:38,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20e1c4a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:38, skipping insertion in model container [2022-07-12 03:38:38,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:38:38" (1/1) ... [2022-07-12 03:38:38,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:38:38,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:38:38,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/process_queue.i[23979,23992] [2022-07-12 03:38:38,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:38:38,973 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:38:39,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/process_queue.i[23979,23992] [2022-07-12 03:38:39,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:38:39,068 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:38:39,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:39 WrapperNode [2022-07-12 03:38:39,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:38:39,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:38:39,070 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:38:39,070 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:38:39,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:39" (1/1) ... [2022-07-12 03:38:39,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:39" (1/1) ... [2022-07-12 03:38:39,112 INFO L137 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 111 [2022-07-12 03:38:39,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:38:39,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:38:39,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:38:39,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:38:39,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:39" (1/1) ... [2022-07-12 03:38:39,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:39" (1/1) ... [2022-07-12 03:38:39,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:39" (1/1) ... [2022-07-12 03:38:39,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:39" (1/1) ... [2022-07-12 03:38:39,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:39" (1/1) ... [2022-07-12 03:38:39,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:39" (1/1) ... [2022-07-12 03:38:39,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:39" (1/1) ... [2022-07-12 03:38:39,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:38:39,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:38:39,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:38:39,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:38:39,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:39" (1/1) ... [2022-07-12 03:38:39,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:38:39,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:39,175 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-12 03:38:39,183 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-12 03:38:39,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:38:39,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:38:39,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 03:38:39,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:38:39,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:38:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 03:38:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 03:38:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:38:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 03:38:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:38:39,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:38:39,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:38:39,303 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:38:39,320 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:38:39,577 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:38:39,582 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:38:39,583 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 03:38:39,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:38:39 BoogieIcfgContainer [2022-07-12 03:38:39,585 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:38:39,586 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:38:39,586 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:38:39,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:38:39,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:38:38" (1/3) ... [2022-07-12 03:38:39,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7500ed7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:38:39, skipping insertion in model container [2022-07-12 03:38:39,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:38:39" (2/3) ... [2022-07-12 03:38:39,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7500ed7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:38:39, skipping insertion in model container [2022-07-12 03:38:39,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:38:39" (3/3) ... [2022-07-12 03:38:39,601 INFO L111 eAbstractionObserver]: Analyzing ICFG process_queue.i [2022-07-12 03:38:39,612 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:38:39,620 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:38:39,677 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:38:39,687 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@35b4d5a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@77c593a [2022-07-12 03:38:39,687 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:38:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 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-12 03:38:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:38:39,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:39,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:39,699 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2060272908, now seen corresponding path program 1 times [2022-07-12 03:38:39,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:39,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643353250] [2022-07-12 03:38:39,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:39,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:39,923 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-12 03:38:39,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:39,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643353250] [2022-07-12 03:38:39,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643353250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:39,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:39,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:38:39,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813034696] [2022-07-12 03:38:39,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:39,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:38:39,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:39,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:38:39,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:38:39,959 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 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) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:40,002 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2022-07-12 03:38:40,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:38:40,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 03:38:40,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:40,017 INFO L225 Difference]: With dead ends: 51 [2022-07-12 03:38:40,017 INFO L226 Difference]: Without dead ends: 23 [2022-07-12 03:38:40,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:38:40,022 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:40,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:38:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-12 03:38:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-12 03:38:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-07-12 03:38:40,046 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 11 [2022-07-12 03:38:40,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:40,047 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-07-12 03:38:40,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-07-12 03:38:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:38:40,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:40,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:40,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:38:40,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:40,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1911586027, now seen corresponding path program 1 times [2022-07-12 03:38:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:40,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525385550] [2022-07-12 03:38:40,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:40,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:40,102 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-12 03:38:40,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:40,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525385550] [2022-07-12 03:38:40,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525385550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:40,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:40,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:38:40,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511318996] [2022-07-12 03:38:40,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:40,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:38:40,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:40,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:38:40,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:38:40,109 INFO L87 Difference]: Start difference. First operand 23 states and 30 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-12 03:38:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:40,165 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-07-12 03:38:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:38:40,167 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-12 03:38:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:40,168 INFO L225 Difference]: With dead ends: 56 [2022-07-12 03:38:40,169 INFO L226 Difference]: Without dead ends: 35 [2022-07-12 03:38:40,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:38:40,171 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:40,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 86 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:38:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-12 03:38:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-07-12 03:38:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 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-12 03:38:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-07-12 03:38:40,183 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 11 [2022-07-12 03:38:40,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:40,183 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-07-12 03:38:40,184 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-12 03:38:40,185 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-07-12 03:38:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:38:40,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:40,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:40,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:38:40,187 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:40,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash 459687026, now seen corresponding path program 1 times [2022-07-12 03:38:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:40,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444997231] [2022-07-12 03:38:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:40,419 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-12 03:38:40,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:40,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444997231] [2022-07-12 03:38:40,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444997231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:40,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:40,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:38:40,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4444064] [2022-07-12 03:38:40,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:40,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:38:40,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:40,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:38:40,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:38:40,422 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-12 03:38:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:40,592 INFO L93 Difference]: Finished difference Result 74 states and 97 transitions. [2022-07-12 03:38:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:38:40,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-12 03:38:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:40,596 INFO L225 Difference]: With dead ends: 74 [2022-07-12 03:38:40,596 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 03:38:40,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:38:40,597 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:40,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 105 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:38:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 03:38:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2022-07-12 03:38:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 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-12 03:38:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2022-07-12 03:38:40,607 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 11 [2022-07-12 03:38:40,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:40,608 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2022-07-12 03:38:40,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-12 03:38:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-07-12 03:38:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:38:40,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:40,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:40,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 03:38:40,620 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:40,621 INFO L85 PathProgramCache]: Analyzing trace with hash 608373907, now seen corresponding path program 1 times [2022-07-12 03:38:40,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:40,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072850802] [2022-07-12 03:38:40,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:40,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:40,661 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-12 03:38:40,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:40,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072850802] [2022-07-12 03:38:40,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072850802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:40,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:40,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:38:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783932304] [2022-07-12 03:38:40,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:40,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:38:40,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:40,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:38:40,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:38:40,664 INFO L87 Difference]: Start difference. First operand 51 states and 68 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-12 03:38:40,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:40,756 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2022-07-12 03:38:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:38:40,769 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-12 03:38:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:40,770 INFO L225 Difference]: With dead ends: 106 [2022-07-12 03:38:40,770 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 03:38:40,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:38:40,772 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:40,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:38:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 03:38:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2022-07-12 03:38:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 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-12 03:38:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-07-12 03:38:40,785 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 11 [2022-07-12 03:38:40,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:40,785 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-07-12 03:38:40,786 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-12 03:38:40,786 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-07-12 03:38:40,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 03:38:40,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:40,787 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:40,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:38:40,787 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:40,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:40,788 INFO L85 PathProgramCache]: Analyzing trace with hash -2110602732, now seen corresponding path program 1 times [2022-07-12 03:38:40,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:40,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429314667] [2022-07-12 03:38:40,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:40,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:40,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:40,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:40,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429314667] [2022-07-12 03:38:40,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429314667] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:40,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118735555] [2022-07-12 03:38:40,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:40,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:40,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:40,953 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-12 03:38:40,967 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-12 03:38:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:41,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-12 03:38:41,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:41,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:38:41,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:41,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:41,328 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 31 treesize of output 26 [2022-07-12 03:38:41,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:41,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:41,338 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 31 treesize of output 26 [2022-07-12 03:38:41,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-07-12 03:38:41,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-07-12 03:38:41,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-12 03:38:41,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-07-12 03:38:41,383 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:38:41,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:38:41,485 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-07-12 03:38:41,486 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2022-07-12 03:38:41,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-07-12 03:38:41,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:41,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:42,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:42,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:42,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118735555] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:42,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:42,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-12 03:38:42,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023836701] [2022-07-12 03:38:42,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:42,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 03:38:42,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:42,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 03:38:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-12 03:38:42,313 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 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-12 03:38:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:42,502 INFO L93 Difference]: Finished difference Result 121 states and 160 transitions. [2022-07-12 03:38:42,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:38:42,503 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 03:38:42,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:42,504 INFO L225 Difference]: With dead ends: 121 [2022-07-12 03:38:42,504 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 03:38:42,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:38:42,506 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 40 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:42,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 225 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-07-12 03:38:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 03:38:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 54. [2022-07-12 03:38:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 0 states have call successors, (0), 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-12 03:38:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2022-07-12 03:38:42,522 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 14 [2022-07-12 03:38:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:42,522 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2022-07-12 03:38:42,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 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-12 03:38:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2022-07-12 03:38:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 03:38:42,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:42,524 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:42,551 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-12 03:38:42,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:42,748 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:42,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash 969563825, now seen corresponding path program 1 times [2022-07-12 03:38:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:42,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355030066] [2022-07-12 03:38:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:42,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:42,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:42,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355030066] [2022-07-12 03:38:42,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355030066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:38:42,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:38:42,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:38:42,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460236988] [2022-07-12 03:38:42,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:38:42,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:38:42,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:42,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:38:42,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:38:42,838 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-12 03:38:42,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:42,882 INFO L93 Difference]: Finished difference Result 117 states and 155 transitions. [2022-07-12 03:38:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:38:42,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-12 03:38:42,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:42,883 INFO L225 Difference]: With dead ends: 117 [2022-07-12 03:38:42,883 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 03:38:42,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:38:42,885 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 29 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:42,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 75 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:38:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 03:38:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-07-12 03:38:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 0 states have call successors, (0), 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-12 03:38:42,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2022-07-12 03:38:42,893 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 19 [2022-07-12 03:38:42,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:42,893 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2022-07-12 03:38:42,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-12 03:38:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2022-07-12 03:38:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 03:38:42,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:42,895 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:42,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 03:38:42,896 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:42,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1377311315, now seen corresponding path program 1 times [2022-07-12 03:38:42,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:42,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077369406] [2022-07-12 03:38:42,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:42,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:38:43,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:43,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077369406] [2022-07-12 03:38:43,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077369406] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:43,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355816346] [2022-07-12 03:38:43,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:43,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:43,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:43,051 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-12 03:38:43,052 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-12 03:38:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:43,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-12 03:38:43,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:43,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2022-07-12 03:38:43,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:43,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:43,339 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 14 treesize of output 14 [2022-07-12 03:38:43,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:43,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:43,346 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 14 treesize of output 14 [2022-07-12 03:38:43,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:38:43,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:43,357 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 18 treesize of output 20 [2022-07-12 03:38:43,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:38:43,399 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 15 treesize of output 7 [2022-07-12 03:38:43,405 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 28 treesize of output 16 [2022-07-12 03:38:43,425 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 15 treesize of output 7 [2022-07-12 03:38:43,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:38:43,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:43,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:43,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 35 [2022-07-12 03:38:43,498 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 29 treesize of output 21 [2022-07-12 03:38:43,502 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 9 treesize of output 7 [2022-07-12 03:38:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:38:43,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355816346] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:43,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:43,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-12 03:38:43,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492022202] [2022-07-12 03:38:43,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:43,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-12 03:38:43,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:43,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-12 03:38:43,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-12 03:38:43,593 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 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-12 03:38:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:44,468 INFO L93 Difference]: Finished difference Result 252 states and 333 transitions. [2022-07-12 03:38:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 03:38:44,469 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 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 22 [2022-07-12 03:38:44,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:44,470 INFO L225 Difference]: With dead ends: 252 [2022-07-12 03:38:44,470 INFO L226 Difference]: Without dead ends: 198 [2022-07-12 03:38:44,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 03:38:44,472 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 209 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:44,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 340 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 03:38:44,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-12 03:38:44,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 91. [2022-07-12 03:38:44,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 0 states have call successors, (0), 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-12 03:38:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2022-07-12 03:38:44,495 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 22 [2022-07-12 03:38:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:44,496 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2022-07-12 03:38:44,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.8125) internal successors, (61), 16 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-12 03:38:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2022-07-12 03:38:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 03:38:44,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:44,497 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:44,525 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-12 03:38:44,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-12 03:38:44,699 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:44,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1662719123, now seen corresponding path program 2 times [2022-07-12 03:38:44,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:44,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793432908] [2022-07-12 03:38:44,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:45,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:45,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793432908] [2022-07-12 03:38:45,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793432908] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:45,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046296421] [2022-07-12 03:38:45,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:38:45,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:45,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:45,005 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-12 03:38:45,034 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-12 03:38:45,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:38:45,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:38:45,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-12 03:38:45,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:45,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:38:45,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,211 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 14 treesize of output 14 [2022-07-12 03:38:45,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,216 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 14 treesize of output 14 [2022-07-12 03:38:45,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:38:45,233 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-12 03:38:45,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-07-12 03:38:45,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:38:45,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,518 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 46 treesize of output 39 [2022-07-12 03:38:45,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,525 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 54 treesize of output 45 [2022-07-12 03:38:45,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-07-12 03:38:45,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2022-07-12 03:38:45,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2022-07-12 03:38:45,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-12 03:38:45,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-12 03:38:45,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,561 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-12 03:38:45,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 28 treesize of output 26 [2022-07-12 03:38:45,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:45,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:45,723 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 50 [2022-07-12 03:38:45,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:45,734 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:38:45,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-12 03:38:45,752 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 15 treesize of output 7 [2022-07-12 03:38:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:45,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:45,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_512 (Array Int Int)) (v_ArrVal_515 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (v_ArrVal_517 (Array Int Int)) (v_ArrVal_519 (Array Int Int)) (v_ArrVal_525 Int)) (or (<= 1 (select (select (store (store |c_#memory_int| v_ArrVal_525 v_ArrVal_512) |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_515) (select (select (store (store |c_#memory_$Pointer$.base| v_ArrVal_525 (store v_ArrVal_519 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_519) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.base| v_ArrVal_525 v_ArrVal_524) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_525)) v_ArrVal_525) 8)) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| v_ArrVal_525 (store v_ArrVal_517 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_517) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_525 v_ArrVal_514) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)) v_ArrVal_525) 8)))) (not (< v_ArrVal_525 |c_#StackHeapBarrier|)) (not (= (select |c_#valid| v_ArrVal_525) 0)))) is different from false [2022-07-12 03:38:46,007 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:38:46,007 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 377 treesize of output 380 [2022-07-12 03:38:46,017 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 168 treesize of output 136 [2022-07-12 03:38:46,028 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 274 treesize of output 210 [2022-07-12 03:38:52,256 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:52,258 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 79 treesize of output 77 [2022-07-12 03:38:52,262 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 88 treesize of output 86 [2022-07-12 03:38:52,266 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 97 treesize of output 95 [2022-07-12 03:38:52,270 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 106 treesize of output 104 [2022-07-12 03:38:52,273 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 104 treesize of output 102 [2022-07-12 03:38:52,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:52,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:52,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:52,297 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:52,300 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:52,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-12 03:38:52,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046296421] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:52,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:52,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-07-12 03:38:52,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444487915] [2022-07-12 03:38:52,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:52,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 03:38:52,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:52,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 03:38:52,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=540, Unknown=5, NotChecked=48, Total=702 [2022-07-12 03:38:52,396 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 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-12 03:38:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:38:53,274 INFO L93 Difference]: Finished difference Result 161 states and 208 transitions. [2022-07-12 03:38:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 03:38:53,275 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 03:38:53,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:38:53,276 INFO L225 Difference]: With dead ends: 161 [2022-07-12 03:38:53,276 INFO L226 Difference]: Without dead ends: 159 [2022-07-12 03:38:53,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=286, Invalid=971, Unknown=7, NotChecked=68, Total=1332 [2022-07-12 03:38:53,277 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 136 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 03:38:53,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 373 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 241 Invalid, 0 Unknown, 152 Unchecked, 0.3s Time] [2022-07-12 03:38:53,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-12 03:38:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 138. [2022-07-12 03:38:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.3065693430656935) internal successors, (179), 137 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:38:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2022-07-12 03:38:53,295 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 25 [2022-07-12 03:38:53,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:38:53,296 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2022-07-12 03:38:53,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 0 states have call successors, (0), 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-12 03:38:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2022-07-12 03:38:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 03:38:53,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:38:53,297 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 03:38:53,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 03:38:53,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:53,522 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:38:53,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:38:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash 211481171, now seen corresponding path program 3 times [2022-07-12 03:38:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:38:53,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959663288] [2022-07-12 03:38:53,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:38:53,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:38:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:38:53,779 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:38:53,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:38:53,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959663288] [2022-07-12 03:38:53,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959663288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:38:53,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503274662] [2022-07-12 03:38:53,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 03:38:53,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:38:53,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:38:53,782 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-12 03:38:53,783 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-12 03:38:54,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 03:38:54,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:38:54,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-12 03:38:54,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:38:54,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:54,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:54,222 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 29 treesize of output 24 [2022-07-12 03:38:54,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:54,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:54,231 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 29 treesize of output 24 [2022-07-12 03:38:54,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-07-12 03:38:54,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-12 03:38:54,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-12 03:38:54,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-12 03:38:54,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-12 03:38:54,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:54,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:54,470 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-12 03:38:54,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2022-07-12 03:38:54,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:54,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:54,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:54,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:54,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2022-07-12 03:38:54,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2022-07-12 03:38:54,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-07-12 03:38:54,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-12 03:38:54,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-12 03:38:54,507 INFO L356 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2022-07-12 03:38:54,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 03:38:54,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:38:54,765 INFO L356 Elim1Store]: treesize reduction 67, result has 9.5 percent of original size [2022-07-12 03:38:54,765 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 9 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 84 [2022-07-12 03:38:54,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:54,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:38:54,779 INFO L356 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2022-07-12 03:38:54,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2022-07-12 03:38:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:38:54,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:38:55,236 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-12 03:38:55,294 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-12 03:38:57,408 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_663 Int)) (or (not (< v_ArrVal_663 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_678 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_691 Int) (v_ArrVal_672 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (or (= (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| v_ArrVal_663 (store v_ArrVal_678 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_663 v_ArrVal_678) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_663))))) (store (store .cse1 v_ArrVal_691 (store v_ArrVal_684 8 (select (select (store .cse1 v_ArrVal_691 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse1 v_ArrVal_691 v_ArrVal_679) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_691))))) (select .cse0 (select (select .cse0 v_ArrVal_691) 8))) (+ (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_663 (store v_ArrVal_677 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_677) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_672) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse3 v_ArrVal_691 (store v_ArrVal_689 8 (select (select (store .cse3 v_ArrVal_691 v_ArrVal_689) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse3 v_ArrVal_691 v_ArrVal_690) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))) v_ArrVal_691) 8) 8)) 0) (not (< v_ArrVal_691 |c_#StackHeapBarrier|)) (= v_ArrVal_691 v_ArrVal_663))))) (forall ((v_ArrVal_663 Int)) (or (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_678 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_691 Int) (v_ArrVal_672 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (or (not (< v_ArrVal_691 |c_#StackHeapBarrier|)) (= (let ((.cse4 (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_663 (store v_ArrVal_677 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_677) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_672) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse7 v_ArrVal_691 (store v_ArrVal_689 8 (select (select (store .cse7 v_ArrVal_691 v_ArrVal_689) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse7 v_ArrVal_691 v_ArrVal_690) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (select (select .cse4 (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| v_ArrVal_663 (store v_ArrVal_678 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_663 v_ArrVal_678) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_663))))) (store (store .cse5 v_ArrVal_691 (store v_ArrVal_684 8 (select (select (store .cse5 v_ArrVal_691 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse5 v_ArrVal_691 v_ArrVal_679) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_691))) v_ArrVal_691) 8)) (+ (select (select .cse4 v_ArrVal_691) 8) 8))) 0) (= v_ArrVal_691 v_ArrVal_663))) (not (< v_ArrVal_663 |c_#StackHeapBarrier|))))) is different from false [2022-07-12 03:38:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-07-12 03:38:57,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503274662] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:38:57,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:38:57,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-07-12 03:38:57,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672573286] [2022-07-12 03:38:57,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:38:57,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 03:38:57,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:38:57,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 03:38:57,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2022-07-12 03:38:57,731 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 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-12 03:38:59,742 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#queue~0#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#queue~0#1.base|) (forall ((v_ArrVal_663 Int)) (or (not (< v_ArrVal_663 |c_#StackHeapBarrier|)) (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_678 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_691 Int) (v_ArrVal_672 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (or (= (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| v_ArrVal_663 (store v_ArrVal_678 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_663 v_ArrVal_678) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_663))))) (store (store .cse1 v_ArrVal_691 (store v_ArrVal_684 8 (select (select (store .cse1 v_ArrVal_691 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse1 v_ArrVal_691 v_ArrVal_679) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_691))))) (select .cse0 (select (select .cse0 v_ArrVal_691) 8))) (+ (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_663 (store v_ArrVal_677 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_677) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_672) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse3 v_ArrVal_691 (store v_ArrVal_689 8 (select (select (store .cse3 v_ArrVal_691 v_ArrVal_689) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse3 v_ArrVal_691 v_ArrVal_690) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))) v_ArrVal_691) 8) 8)) 0) (not (< v_ArrVal_691 |c_#StackHeapBarrier|)) (= v_ArrVal_691 v_ArrVal_663))))) (forall ((v_ArrVal_663 Int)) (or (forall ((v_ArrVal_689 (Array Int Int)) (v_ArrVal_678 (Array Int Int)) (v_ArrVal_677 (Array Int Int)) (v_ArrVal_679 (Array Int Int)) (v_ArrVal_690 (Array Int Int)) (v_ArrVal_691 Int) (v_ArrVal_672 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (or (not (< v_ArrVal_691 |c_#StackHeapBarrier|)) (= (let ((.cse4 (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| v_ArrVal_663 (store v_ArrVal_677 8 (select (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_677) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store |c_#memory_$Pointer$.offset| v_ArrVal_663 v_ArrVal_672) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0)))) (store (store .cse7 v_ArrVal_691 (store v_ArrVal_689 8 (select (select (store .cse7 v_ArrVal_691 v_ArrVal_689) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse7 v_ArrVal_691 v_ArrVal_690) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| 0))))) (select (select .cse4 (select (select (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.base| v_ArrVal_663 (store v_ArrVal_678 8 (select (select (store |c_#memory_$Pointer$.base| v_ArrVal_663 v_ArrVal_678) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (store .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_663))))) (store (store .cse5 v_ArrVal_691 (store v_ArrVal_684 8 (select (select (store .cse5 v_ArrVal_691 v_ArrVal_684) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) |c_ULTIMATE.start_main_~#queue~0#1.base| (store (select (store .cse5 v_ArrVal_691 v_ArrVal_679) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset| v_ArrVal_691))) v_ArrVal_691) 8)) (+ (select (select .cse4 v_ArrVal_691) 8) 8))) 0) (= v_ArrVal_691 v_ArrVal_663))) (not (< v_ArrVal_663 |c_#StackHeapBarrier|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#queue~0#1.base|) (= |c_ULTIMATE.start_main_~#queue~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 0)) is different from false [2022-07-12 03:39:00,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:00,381 INFO L93 Difference]: Finished difference Result 363 states and 472 transitions. [2022-07-12 03:39:00,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 03:39:00,382 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-12 03:39:00,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:00,383 INFO L225 Difference]: With dead ends: 363 [2022-07-12 03:39:00,383 INFO L226 Difference]: Without dead ends: 241 [2022-07-12 03:39:00,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=120, Invalid=642, Unknown=2, NotChecked=106, Total=870 [2022-07-12 03:39:00,385 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 136 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:00,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 330 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 147 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2022-07-12 03:39:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-12 03:39:00,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 189. [2022-07-12 03:39:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.2765957446808511) internal successors, (240), 188 states have internal predecessors, (240), 0 states have call successors, (0), 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-12 03:39:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 240 transitions. [2022-07-12 03:39:00,402 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 240 transitions. Word has length 28 [2022-07-12 03:39:00,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:00,402 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 240 transitions. [2022-07-12 03:39:00,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 18 states have internal predecessors, (68), 0 states have call successors, (0), 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-12 03:39:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 240 transitions. [2022-07-12 03:39:00,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:39:00,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:00,404 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:00,431 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-12 03:39:00,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:00,619 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:00,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1324510600, now seen corresponding path program 1 times [2022-07-12 03:39:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:00,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027340871] [2022-07-12 03:39:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:00,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:39:00,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:00,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027340871] [2022-07-12 03:39:00,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027340871] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:00,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132757246] [2022-07-12 03:39:00,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:00,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:00,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:00,675 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-12 03:39:00,684 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-12 03:39:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:00,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 03:39:00,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:39:00,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 03:39:00,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132757246] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:00,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:00,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-12 03:39:00,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340736924] [2022-07-12 03:39:00,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:00,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 03:39:00,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:00,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 03:39:00,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:39:00,866 INFO L87 Difference]: Start difference. First operand 189 states and 240 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:39:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:00,993 INFO L93 Difference]: Finished difference Result 634 states and 820 transitions. [2022-07-12 03:39:00,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:39:00,993 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-12 03:39:00,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:00,995 INFO L225 Difference]: With dead ends: 634 [2022-07-12 03:39:00,995 INFO L226 Difference]: Without dead ends: 468 [2022-07-12 03:39:00,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:39:00,997 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 103 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:00,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 146 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:39:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2022-07-12 03:39:01,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 397. [2022-07-12 03:39:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.255050505050505) internal successors, (497), 396 states have internal predecessors, (497), 0 states have call successors, (0), 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-12 03:39:01,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 497 transitions. [2022-07-12 03:39:01,027 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 497 transitions. Word has length 29 [2022-07-12 03:39:01,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:01,028 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 497 transitions. [2022-07-12 03:39:01,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:39:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 497 transitions. [2022-07-12 03:39:01,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 03:39:01,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:01,029 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:01,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:01,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-12 03:39:01,247 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash -313393350, now seen corresponding path program 1 times [2022-07-12 03:39:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:01,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850408127] [2022-07-12 03:39:01,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:01,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:01,510 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-12 03:39:01,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:01,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850408127] [2022-07-12 03:39:01,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850408127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:01,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024936875] [2022-07-12 03:39:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:01,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:01,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:01,512 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-12 03:39:01,513 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-12 03:39:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:01,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-12 03:39:01,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:01,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:39:01,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:01,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:01,660 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 14 treesize of output 14 [2022-07-12 03:39:01,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:01,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:01,664 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 14 treesize of output 14 [2022-07-12 03:39:01,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:39:01,683 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:39:01,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:39:01,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:39:01,929 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 03:39:01,929 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 99 [2022-07-12 03:39:01,934 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 80 treesize of output 30 [2022-07-12 03:39:01,938 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 35 treesize of output 35 [2022-07-12 03:39:02,005 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 33 treesize of output 21 [2022-07-12 03:39:02,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-12 03:39:02,030 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 15 treesize of output 7 [2022-07-12 03:39:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:02,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:02,111 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_choose_next_#t~mem5#1| 1) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_863 Int) (v_ArrVal_864 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 4))) (or (not (<= (select .cse0 .cse1) (+ v_ArrVal_863 1))) (<= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base| (store .cse0 .cse1 v_ArrVal_863)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))))))) is different from false [2022-07-12 03:39:02,124 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 4)) 1) (forall ((v_ArrVal_865 (Array Int Int)) (v_ArrVal_863 Int) (v_ArrVal_864 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 4))) (or (not (<= (select .cse0 .cse1) (+ v_ArrVal_863 1))) (<= 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_choose_next_~node~0#1.base| (store .cse0 .cse1 v_ArrVal_863)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~node~0#1.base| v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))))))) is different from false [2022-07-12 03:39:02,138 WARN L833 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4)) 1) (forall ((v_ArrVal_863 Int) (v_ArrVal_865 (Array Int Int)) (v_ArrVal_864 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (let ((.cse0 (select |c_#memory_int| .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))) (or (not (<= (select .cse0 .cse1) (+ v_ArrVal_863 1))) (<= 1 (select (select (store |c_#memory_int| .cse2 (store .cse0 .cse1 v_ArrVal_863)) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4)))))))) is different from false [2022-07-12 03:39:02,309 INFO L356 Elim1Store]: treesize reduction 16, result has 84.9 percent of original size [2022-07-12 03:39:02,309 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 166 treesize of output 193 [2022-07-12 03:39:02,445 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |c_ULTIMATE.start_check_queue_~n~0#1.offset|))) (.cse6 (forall ((v_ArrVal_865 (Array Int Int))) (= |c_ULTIMATE.start_check_queue_~n~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))))) (let ((.cse1 (forall ((v_ArrVal_865 (Array Int Int))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= |c_ULTIMATE.start_check_queue_~n~0#1.base| .cse9) (= .cse9 .cse10)))))) (.cse2 (or (forall ((v_ArrVal_864 (Array Int Int))) (= (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4))) .cse6)) (.cse3 (or .cse5 (forall ((v_ArrVal_865 (Array Int Int))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) .cse8))))) (.cse4 (forall ((v_ArrVal_864 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (or (= (+ .cse7 4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 4)) (= .cse7 |c_ULTIMATE.start_check_queue_~n~0#1.offset|)))))) (let ((.cse0 (and .cse1 .cse5 .cse2 .cse3 .cse6 .cse4))) (and (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) |c_ULTIMATE.start_check_queue_~n~0#1.offset|) .cse0) .cse1 .cse2 .cse3 .cse4 (or (= |c_ULTIMATE.start_check_queue_~n~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) .cse0))))) is different from false [2022-07-12 03:39:02,459 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_864 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) v_ArrVal_864) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (forall ((v_ArrVal_865 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_865) |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) .cse0)))) is different from false [2022-07-12 03:39:02,476 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 5 treesize of output 3 [2022-07-12 03:39:02,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:39:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-12 03:39:02,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024936875] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:02,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:02,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30 [2022-07-12 03:39:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142754127] [2022-07-12 03:39:02,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:02,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 03:39:02,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:02,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 03:39:02,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=526, Unknown=5, NotChecked=250, Total=870 [2022-07-12 03:39:02,511 INFO L87 Difference]: Start difference. First operand 397 states and 497 transitions. Second operand has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 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-12 03:39:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:03,553 INFO L93 Difference]: Finished difference Result 665 states and 833 transitions. [2022-07-12 03:39:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 03:39:03,554 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 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-12 03:39:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:03,556 INFO L225 Difference]: With dead ends: 665 [2022-07-12 03:39:03,556 INFO L226 Difference]: Without dead ends: 510 [2022-07-12 03:39:03,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=200, Invalid=937, Unknown=5, NotChecked=340, Total=1482 [2022-07-12 03:39:03,558 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 122 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:03,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 409 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 383 Invalid, 0 Unknown, 287 Unchecked, 0.5s Time] [2022-07-12 03:39:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-07-12 03:39:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 415. [2022-07-12 03:39:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 1.2536231884057971) internal successors, (519), 414 states have internal predecessors, (519), 0 states have call successors, (0), 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-12 03:39:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 519 transitions. [2022-07-12 03:39:03,591 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 519 transitions. Word has length 29 [2022-07-12 03:39:03,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:03,591 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 519 transitions. [2022-07-12 03:39:03,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.7333333333333334) internal successors, (82), 30 states have internal predecessors, (82), 0 states have call successors, (0), 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-12 03:39:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 519 transitions. [2022-07-12 03:39:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:39:03,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:03,596 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:03,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:39:03,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:03,812 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash -190827821, now seen corresponding path program 1 times [2022-07-12 03:39:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:03,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958780319] [2022-07-12 03:39:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:03,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:03,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:03,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958780319] [2022-07-12 03:39:03,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958780319] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:03,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042176446] [2022-07-12 03:39:03,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:03,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:03,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:03,932 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-12 03:39:03,970 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-12 03:39:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:04,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-12 03:39:04,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:04,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:39:04,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:04,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:04,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 03:39:04,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:04,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:04,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 03:39:04,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-12 03:39:04,127 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 11 treesize of output 7 [2022-07-12 03:39:04,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-12 03:39:04,133 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 11 treesize of output 7 [2022-07-12 03:39:04,138 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:39:04,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:39:04,262 INFO L356 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2022-07-12 03:39:04,262 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 2 case distinctions, treesize of input 25 treesize of output 34 [2022-07-12 03:39:04,283 INFO L356 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-07-12 03:39:04,284 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 2 case distinctions, treesize of input 33 treesize of output 24 [2022-07-12 03:39:04,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2022-07-12 03:39:04,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2022-07-12 03:39:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:39:04,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:39:04,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042176446] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:04,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:04,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 19 [2022-07-12 03:39:04,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325058980] [2022-07-12 03:39:04,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:04,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 03:39:04,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:04,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 03:39:04,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-12 03:39:04,565 INFO L87 Difference]: Start difference. First operand 415 states and 519 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 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-12 03:39:06,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:06,109 INFO L93 Difference]: Finished difference Result 1202 states and 1554 transitions. [2022-07-12 03:39:06,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-12 03:39:06,110 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 03:39:06,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:06,113 INFO L225 Difference]: With dead ends: 1202 [2022-07-12 03:39:06,113 INFO L226 Difference]: Without dead ends: 768 [2022-07-12 03:39:06,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=583, Invalid=2279, Unknown=0, NotChecked=0, Total=2862 [2022-07-12 03:39:06,115 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 294 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:06,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 553 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 417 Invalid, 0 Unknown, 49 Unchecked, 0.6s Time] [2022-07-12 03:39:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2022-07-12 03:39:06,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 529. [2022-07-12 03:39:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 528 states have (on average 1.3011363636363635) internal successors, (687), 528 states have internal predecessors, (687), 0 states have call successors, (0), 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-12 03:39:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 687 transitions. [2022-07-12 03:39:06,149 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 687 transitions. Word has length 30 [2022-07-12 03:39:06,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:06,149 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 687 transitions. [2022-07-12 03:39:06,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 19 states have internal predecessors, (75), 0 states have call successors, (0), 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-12 03:39:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 687 transitions. [2022-07-12 03:39:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 03:39:06,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:06,150 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:06,180 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-12 03:39:06,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:06,365 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:06,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:06,366 INFO L85 PathProgramCache]: Analyzing trace with hash -583854831, now seen corresponding path program 1 times [2022-07-12 03:39:06,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:06,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084932063] [2022-07-12 03:39:06,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:06,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 03:39:06,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:06,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084932063] [2022-07-12 03:39:06,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084932063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:39:06,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:39:06,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:39:06,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236086533] [2022-07-12 03:39:06,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:39:06,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:39:06,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:06,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:39:06,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:39:06,398 INFO L87 Difference]: Start difference. First operand 529 states and 687 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:39:06,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:06,449 INFO L93 Difference]: Finished difference Result 1076 states and 1398 transitions. [2022-07-12 03:39:06,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:39:06,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 03:39:06,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:06,453 INFO L225 Difference]: With dead ends: 1076 [2022-07-12 03:39:06,453 INFO L226 Difference]: Without dead ends: 673 [2022-07-12 03:39:06,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:39:06,454 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:06,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 75 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:39:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-07-12 03:39:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 496. [2022-07-12 03:39:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.2787878787878788) internal successors, (633), 495 states have internal predecessors, (633), 0 states have call successors, (0), 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-12 03:39:06,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 633 transitions. [2022-07-12 03:39:06,487 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 633 transitions. Word has length 30 [2022-07-12 03:39:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:06,488 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 633 transitions. [2022-07-12 03:39:06,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:39:06,488 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 633 transitions. [2022-07-12 03:39:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 03:39:06,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:06,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:06,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 03:39:06,489 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:06,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:06,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1070079280, now seen corresponding path program 1 times [2022-07-12 03:39:06,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:06,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343526] [2022-07-12 03:39:06,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:06,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:06,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:06,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343526] [2022-07-12 03:39:06,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343526] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:06,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376559576] [2022-07-12 03:39:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:06,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:06,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:06,656 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-12 03:39:06,657 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-12 03:39:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:06,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-12 03:39:06,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:06,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:39:06,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:06,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:06,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 03:39:06,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:06,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:06,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-12 03:39:06,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-12 03:39:06,874 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 11 treesize of output 7 [2022-07-12 03:39:06,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2022-07-12 03:39:06,880 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 11 treesize of output 7 [2022-07-12 03:39:06,885 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 03:39:06,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 03:39:07,072 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 03:39:07,073 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 53 [2022-07-12 03:39:07,076 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 42 treesize of output 34 [2022-07-12 03:39:07,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-07-12 03:39:07,090 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 28 treesize of output 22 [2022-07-12 03:39:07,097 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 19 treesize of output 7 [2022-07-12 03:39:07,100 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 19 treesize of output 7 [2022-07-12 03:39:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:39:07,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:07,117 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1105 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1105) |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 8)) 0)) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_choose_next_~q#1.base| v_ArrVal_1104) |c_ULTIMATE.start_choose_next_~node~0#1.base|) (+ |c_ULTIMATE.start_choose_next_~node~0#1.offset| 8)) 0))) is different from false [2022-07-12 03:39:07,133 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1105 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1105) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8)))) (forall ((v_ArrVal_1104 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base| v_ArrVal_1104) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#queue~0#1.base|) |c_ULTIMATE.start_main_~#queue~0#1.offset|) 8)) 0))) is different from false [2022-07-12 03:39:07,321 INFO L356 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-07-12 03:39:07,322 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 93 [2022-07-12 03:39:07,350 INFO L356 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-07-12 03:39:07,350 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 157 treesize of output 140 [2022-07-12 03:39:07,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:07,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 143 [2022-07-12 03:39:07,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:07,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 146 [2022-07-12 03:39:07,386 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-07-12 03:39:07,387 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 162 treesize of output 152 [2022-07-12 03:39:07,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:07,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 202 [2022-07-12 03:39:07,407 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 9 treesize of output 3 [2022-07-12 03:39:07,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:07,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2022-07-12 03:39:07,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:39:07,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 8 [2022-07-12 03:39:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-07-12 03:39:07,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376559576] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:39:07,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:39:07,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-07-12 03:39:07,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209782547] [2022-07-12 03:39:07,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:39:07,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 03:39:07,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:39:07,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 03:39:07,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=311, Unknown=2, NotChecked=74, Total=462 [2022-07-12 03:39:07,452 INFO L87 Difference]: Start difference. First operand 496 states and 633 transitions. Second operand has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 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-12 03:39:08,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:39:08,761 INFO L93 Difference]: Finished difference Result 1598 states and 2049 transitions. [2022-07-12 03:39:08,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 03:39:08,762 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 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 33 [2022-07-12 03:39:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:39:08,766 INFO L225 Difference]: With dead ends: 1598 [2022-07-12 03:39:08,766 INFO L226 Difference]: Without dead ends: 1228 [2022-07-12 03:39:08,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 60 SyntacticMatches, 12 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=577, Invalid=1499, Unknown=2, NotChecked=178, Total=2256 [2022-07-12 03:39:08,768 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 299 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 03:39:08,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 475 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 241 Invalid, 0 Unknown, 169 Unchecked, 0.4s Time] [2022-07-12 03:39:08,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2022-07-12 03:39:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 809. [2022-07-12 03:39:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.254950495049505) internal successors, (1014), 808 states have internal predecessors, (1014), 0 states have call successors, (0), 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-12 03:39:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1014 transitions. [2022-07-12 03:39:08,845 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1014 transitions. Word has length 33 [2022-07-12 03:39:08,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:39:08,845 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1014 transitions. [2022-07-12 03:39:08,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 22 states have internal predecessors, (73), 0 states have call successors, (0), 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-12 03:39:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1014 transitions. [2022-07-12 03:39:08,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:39:08,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:39:08,846 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-12 03:39:08,871 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-12 03:39:09,070 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,SelfDestructingSolverStorable13 [2022-07-12 03:39:09,071 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:39:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:39:09,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1607684877, now seen corresponding path program 1 times [2022-07-12 03:39:09,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:39:09,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458024708] [2022-07-12 03:39:09,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:09,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:39:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 03:39:09,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:39:09,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458024708] [2022-07-12 03:39:09,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458024708] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:39:09,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813484907] [2022-07-12 03:39:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:39:09,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:39:09,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:39:09,328 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-12 03:39:09,349 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-12 03:39:09,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:39:09,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 123 conjunts are in the unsatisfiable core [2022-07-12 03:39:09,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:39:09,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 03:39:09,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-12 03:39:09,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,579 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 14 treesize of output 14 [2022-07-12 03:39:09,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:39:09,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-07-12 03:39:09,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-12 03:39:09,606 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-12 03:39:09,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-07-12 03:39:09,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-12 03:39:09,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2022-07-12 03:39:09,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,908 INFO L356 Elim1Store]: treesize reduction 49, result has 9.3 percent of original size [2022-07-12 03:39:09,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 66 [2022-07-12 03:39:09,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2022-07-12 03:39:09,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-07-12 03:39:09,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2022-07-12 03:39:09,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:09,946 INFO L356 Elim1Store]: treesize reduction 4, result has 84.6 percent of original size [2022-07-12 03:39:09,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 34 treesize of output 32 [2022-07-12 03:39:09,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-07-12 03:39:10,196 INFO L356 Elim1Store]: treesize reduction 72, result has 4.0 percent of original size [2022-07-12 03:39:10,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 183 treesize of output 83 [2022-07-12 03:39:10,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:39:10,205 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 03:39:10,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2022-07-12 03:39:10,219 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 03:39:10,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:39:24,684 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-07-12 03:39:24,685 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 1178 treesize of output 1026 [2022-07-12 03:39:25,284 INFO L356 Elim1Store]: treesize reduction 194, result has 48.8 percent of original size [2022-07-12 03:39:25,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 924026 treesize of output 896791 [2022-07-12 03:39:48,253 WARN L233 SmtUtils]: Spent 22.96s on a formula simplification. DAG size of input: 2068 DAG size of output: 2050 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-12 03:39:48,397 INFO L356 Elim1Store]: treesize reduction 170, result has 27.0 percent of original size [2022-07-12 03:39:48,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 813017 treesize of output 793529 [2022-07-12 03:39:50,870 INFO L356 Elim1Store]: treesize reduction 310, result has 39.6 percent of original size [2022-07-12 03:39:50,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 946725 treesize of output 882589 [2022-07-12 03:40:04,946 WARN L233 SmtUtils]: Spent 14.07s on a formula simplification. DAG size of input: 2132 DAG size of output: 2129 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-12 03:40:05,073 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:05,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 880600 treesize of output 843505 [2022-07-12 03:40:08,839 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 4020 treesize of output 3996 [2022-07-12 03:40:40,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:40,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:40,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-12 03:40:40,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:40,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:40,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2022-07-12 03:40:40,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:40:40,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:40:40,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-12 03:40:41,350 INFO L356 Elim1Store]: treesize reduction 24, result has 64.2 percent of original size [2022-07-12 03:40:41,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 237 treesize of output 235 [2022-07-12 03:41:01,276 INFO L356 Elim1Store]: treesize reduction 24, result has 64.2 percent of original size [2022-07-12 03:41:01,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 237 treesize of output 235 [2022-07-12 03:41:31,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:41:31,758 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:31,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2022-07-12 03:41:32,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:41:32,530 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:32,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2022-07-12 03:41:32,817 INFO L356 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2022-07-12 03:41:32,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 110 [2022-07-12 03:41:35,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:41:35,817 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:35,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 58 [2022-07-12 03:41:36,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:41:36,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:36,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 58 [2022-07-12 03:41:36,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:41:36,831 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:36,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-12 03:41:36,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:41:37,003 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 24 treesize of output 20 [2022-07-12 03:41:37,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:41:37,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:37,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 58 [2022-07-12 03:41:37,580 INFO L356 Elim1Store]: treesize reduction 41, result has 38.8 percent of original size [2022-07-12 03:41:37,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 237 treesize of output 218 [2022-07-12 03:41:43,459 INFO L356 Elim1Store]: treesize reduction 41, result has 38.8 percent of original size [2022-07-12 03:41:43,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 129 treesize of output 130 [2022-07-12 03:41:45,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 03:41:45,076 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 24 treesize of output 20 [2022-07-12 03:41:45,165 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:41:45,260 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:45,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-07-12 03:41:45,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:41:45,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:45,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2022-07-12 03:41:45,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:41:45,915 INFO L356 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2022-07-12 03:41:45,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 75 [2022-07-12 03:41:46,879 INFO L356 Elim1Store]: treesize reduction 41, result has 38.8 percent of original size [2022-07-12 03:41:46,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 176 treesize of output 167 [2022-07-12 03:41:51,106 INFO L356 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2022-07-12 03:41:51,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 103 [2022-07-12 03:41:52,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:41:52,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:52,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-07-12 03:41:52,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:41:52,881 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 03:41:52,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2022-07-12 03:41:53,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 03:41:53,256 INFO L356 Elim1Store]: treesize reduction 20, result has 56.5 percent of original size [2022-07-12 03:41:53,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 74 treesize of output 75