./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_szymanski.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/seq-pthread/cs_szymanski.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 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 07:40:46,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 07:40:46,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 07:40:46,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 07:40:46,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 07:40:46,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 07:40:46,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 07:40:46,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 07:40:46,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 07:40:46,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 07:40:46,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 07:40:46,398 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 07:40:46,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 07:40:46,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 07:40:46,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 07:40:46,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 07:40:46,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 07:40:46,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 07:40:46,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 07:40:46,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 07:40:46,412 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 07:40:46,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 07:40:46,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 07:40:46,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 07:40:46,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 07:40:46,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 07:40:46,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 07:40:46,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 07:40:46,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 07:40:46,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 07:40:46,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 07:40:46,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 07:40:46,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 07:40:46,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 07:40:46,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 07:40:46,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 07:40:46,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 07:40:46,438 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 07:40:46,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 07:40:46,439 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 07:40:46,440 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 07:40:46,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 07:40:46,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 07:40:46,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 07:40:46,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 07:40:46,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 07:40:46,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 07:40:46,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 07:40:46,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 07:40:46,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 07:40:46,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 07:40:46,471 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 07:40:46,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 07:40:46,472 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 07:40:46,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 07:40:46,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 07:40:46,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 07:40:46,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 07:40:46,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 07:40:46,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 07:40:46,472 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 07:40:46,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 07:40:46,473 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 07:40:46,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 07:40:46,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 07:40:46,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 07:40:46,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 07:40:46,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 07:40:46,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 07:40:46,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 07:40:46,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 07:40:46,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 07:40:46,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 07:40:46,477 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 07:40:46,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 07:40:46,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 07:40:46,477 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 -> 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 [2022-07-12 07:40:46,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 07:40:46,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 07:40:46,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 07:40:46,688 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 07:40:46,688 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 07:40:46,689 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_szymanski.i [2022-07-12 07:40:46,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bc77729/e58071456a024a298bd6acdd52d4772e/FLAG8961f9e31 [2022-07-12 07:40:47,199 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 07:40:47,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i [2022-07-12 07:40:47,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bc77729/e58071456a024a298bd6acdd52d4772e/FLAG8961f9e31 [2022-07-12 07:40:47,513 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00bc77729/e58071456a024a298bd6acdd52d4772e [2022-07-12 07:40:47,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 07:40:47,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 07:40:47,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 07:40:47,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 07:40:47,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 07:40:47,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:40:47" (1/1) ... [2022-07-12 07:40:47,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579cdfb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47, skipping insertion in model container [2022-07-12 07:40:47,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:40:47" (1/1) ... [2022-07-12 07:40:47,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 07:40:47,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 07:40:47,742 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/seq-pthread/cs_szymanski.i[23606,23619] [2022-07-12 07:40:47,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 07:40:47,813 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 07:40:47,831 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/seq-pthread/cs_szymanski.i[23606,23619] [2022-07-12 07:40:47,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 07:40:47,905 INFO L208 MainTranslator]: Completed translation [2022-07-12 07:40:47,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47 WrapperNode [2022-07-12 07:40:47,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 07:40:47,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 07:40:47,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 07:40:47,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 07:40:47,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47" (1/1) ... [2022-07-12 07:40:47,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47" (1/1) ... [2022-07-12 07:40:47,953 INFO L137 Inliner]: procedures = 145, calls = 289, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 395 [2022-07-12 07:40:47,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 07:40:47,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 07:40:47,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 07:40:47,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 07:40:47,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47" (1/1) ... [2022-07-12 07:40:47,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47" (1/1) ... [2022-07-12 07:40:47,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47" (1/1) ... [2022-07-12 07:40:47,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47" (1/1) ... [2022-07-12 07:40:47,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47" (1/1) ... [2022-07-12 07:40:47,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47" (1/1) ... [2022-07-12 07:40:47,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47" (1/1) ... [2022-07-12 07:40:47,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 07:40:47,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 07:40:47,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 07:40:47,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 07:40:47,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47" (1/1) ... [2022-07-12 07:40:48,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 07:40:48,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:48,020 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 07:40:48,027 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 07:40:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 07:40:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 07:40:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 07:40:48,054 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 07:40:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 07:40:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 07:40:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 07:40:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-07-12 07:40:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-07-12 07:40:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 07:40:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-07-12 07:40:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-07-12 07:40:48,055 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-12 07:40:48,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-07-12 07:40:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 07:40:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 07:40:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-07-12 07:40:48,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-07-12 07:40:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 07:40:48,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 07:40:48,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 07:40:48,196 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 07:40:48,197 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 07:40:50,654 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 07:40:50,659 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 07:40:50,659 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 07:40:50,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:40:50 BoogieIcfgContainer [2022-07-12 07:40:50,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 07:40:50,662 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 07:40:50,662 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 07:40:50,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 07:40:50,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:40:47" (1/3) ... [2022-07-12 07:40:50,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342cdcb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:40:50, skipping insertion in model container [2022-07-12 07:40:50,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:40:47" (2/3) ... [2022-07-12 07:40:50,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@342cdcb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:40:50, skipping insertion in model container [2022-07-12 07:40:50,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:40:50" (3/3) ... [2022-07-12 07:40:50,666 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_szymanski.i [2022-07-12 07:40:50,676 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 07:40:50,676 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 07:40:50,707 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 07:40:50,712 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@48119736, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@532ee61d [2022-07-12 07:40:50,712 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 07:40:50,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 73 states have internal predecessors, (96), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-12 07:40:50,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-12 07:40:50,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:50,726 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:40:50,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1875977801, now seen corresponding path program 1 times [2022-07-12 07:40:50,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:50,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740780930] [2022-07-12 07:40:50,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 07:40:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 07:40:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 07:40:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-12 07:40:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 07:40:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 07:40:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-12 07:40:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 07:40:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 07:40:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 07:40:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-12 07:40:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-12 07:40:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 07:40:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 07:40:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 07:40:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 07:40:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 07:40:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-12 07:40:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,514 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-12 07:40:51,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:51,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740780930] [2022-07-12 07:40:51,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740780930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:51,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:40:51,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:40:51,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602100099] [2022-07-12 07:40:51,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:51,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:40:51,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:51,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:40:51,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:40:51,569 INFO L87 Difference]: Start difference. First operand has 111 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 73 states have internal predecessors, (96), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 07:40:51,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:51,640 INFO L93 Difference]: Finished difference Result 224 states and 356 transitions. [2022-07-12 07:40:51,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:40:51,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2022-07-12 07:40:51,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:51,652 INFO L225 Difference]: With dead ends: 224 [2022-07-12 07:40:51,653 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 07:40:51,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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 07:40:51,662 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 4 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:51,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 304 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:40:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 07:40:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2022-07-12 07:40:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-12 07:40:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2022-07-12 07:40:51,701 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 120 [2022-07-12 07:40:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:51,701 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2022-07-12 07:40:51,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 07:40:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2022-07-12 07:40:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-12 07:40:51,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:51,707 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:40:51,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 07:40:51,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:51,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:51,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1912175905, now seen corresponding path program 1 times [2022-07-12 07:40:51,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:51,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624678739] [2022-07-12 07:40:51,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 07:40:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 07:40:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 07:40:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 07:40:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 07:40:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:51,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 07:40:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 07:40:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 07:40:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 07:40:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 07:40:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 07:40:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 07:40:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 07:40:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 07:40:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 07:40:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 07:40:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 07:40:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 07:40:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-12 07:40:52,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:52,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624678739] [2022-07-12 07:40:52,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624678739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:52,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 07:40:52,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 07:40:52,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174299513] [2022-07-12 07:40:52,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:52,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:40:52,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:52,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:40:52,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 07:40:52,038 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 07:40:52,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:52,066 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2022-07-12 07:40:52,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:40:52,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2022-07-12 07:40:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:52,069 INFO L225 Difference]: With dead ends: 215 [2022-07-12 07:40:52,070 INFO L226 Difference]: Without dead ends: 110 [2022-07-12 07:40:52,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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 07:40:52,075 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 297 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 07:40:52,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 297 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:40:52,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-12 07:40:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-07-12 07:40:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.267605633802817) internal successors, (90), 71 states have internal predecessors, (90), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-12 07:40:52,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2022-07-12 07:40:52,097 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 123 [2022-07-12 07:40:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:52,097 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2022-07-12 07:40:52,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 07:40:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2022-07-12 07:40:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-12 07:40:52,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:52,105 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:40:52,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 07:40:52,106 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:52,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:52,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1930143839, now seen corresponding path program 1 times [2022-07-12 07:40:52,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:52,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008285310] [2022-07-12 07:40:52,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:52,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 07:40:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 07:40:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 07:40:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 07:40:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 07:40:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 07:40:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 07:40:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 07:40:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 07:40:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 07:40:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 07:40:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 07:40:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 07:40:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-12 07:40:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-12 07:40:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 07:40:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 07:40:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 07:40:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-12 07:40:52,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:52,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008285310] [2022-07-12 07:40:52,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008285310] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:40:52,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530882495] [2022-07-12 07:40:52,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:52,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:40:52,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:52,387 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 07:40:52,422 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 07:40:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:53,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 4528 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 07:40:53,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:40:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-12 07:40:53,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:40:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-07-12 07:40:53,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530882495] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:40:53,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 07:40:53,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-07-12 07:40:53,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446238864] [2022-07-12 07:40:53,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 07:40:53,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 07:40:53,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:53,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 07:40:53,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:40:53,753 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-12 07:40:53,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:53,778 INFO L93 Difference]: Finished difference Result 219 states and 311 transitions. [2022-07-12 07:40:53,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 07:40:53,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 125 [2022-07-12 07:40:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:53,779 INFO L225 Difference]: With dead ends: 219 [2022-07-12 07:40:53,779 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 07:40:53,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:40:53,780 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 3 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:40:53,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 297 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:40:53,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 07:40:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-07-12 07:40:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-12 07:40:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2022-07-12 07:40:53,787 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 125 [2022-07-12 07:40:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:53,787 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2022-07-12 07:40:53,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2022-07-12 07:40:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2022-07-12 07:40:53,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 07:40:53,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:53,790 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:40:53,815 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 07:40:53,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:40:53,997 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:53,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:53,997 INFO L85 PathProgramCache]: Analyzing trace with hash -28203099, now seen corresponding path program 2 times [2022-07-12 07:40:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:53,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397653436] [2022-07-12 07:40:53,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:53,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-12 07:40:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-12 07:40:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-12 07:40:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-12 07:40:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 07:40:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 07:40:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 07:40:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-12 07:40:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-12 07:40:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-12 07:40:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 07:40:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-12 07:40:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-12 07:40:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-12 07:40:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-12 07:40:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 07:40:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 07:40:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-12 07:40:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2022-07-12 07:40:54,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:54,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397653436] [2022-07-12 07:40:54,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397653436] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:40:54,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838377385] [2022-07-12 07:40:54,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 07:40:54,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:40:54,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:54,434 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 07:40:54,435 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 07:40:56,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 07:40:56,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 07:40:56,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 4196 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 07:40:56,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:40:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2022-07-12 07:40:56,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:40:56,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838377385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:40:56,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 07:40:56,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-07-12 07:40:56,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635303443] [2022-07-12 07:40:56,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:40:56,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 07:40:56,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:56,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 07:40:56,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 07:40:56,411 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 07:40:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:40:56,437 INFO L93 Difference]: Finished difference Result 211 states and 302 transitions. [2022-07-12 07:40:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 07:40:56,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2022-07-12 07:40:56,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:40:56,440 INFO L225 Difference]: With dead ends: 211 [2022-07-12 07:40:56,440 INFO L226 Difference]: Without dead ends: 169 [2022-07-12 07:40:56,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 07:40:56,441 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 77 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 528 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 07:40:56,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 528 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:40:56,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-12 07:40:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-12 07:40:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2022-07-12 07:40:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 240 transitions. [2022-07-12 07:40:56,456 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 240 transitions. Word has length 129 [2022-07-12 07:40:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:40:56,456 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 240 transitions. [2022-07-12 07:40:56,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-12 07:40:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 240 transitions. [2022-07-12 07:40:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-12 07:40:56,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:40:56,459 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:40:56,488 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 07:40:56,679 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,SelfDestructingSolverStorable3 [2022-07-12 07:40:56,680 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:40:56,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:40:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash -993819535, now seen corresponding path program 1 times [2022-07-12 07:40:56,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:40:56,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109295101] [2022-07-12 07:40:56,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:56,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:40:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 07:40:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:40:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:40:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 07:40:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 07:40:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:40:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 07:40:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 07:40:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:40:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 07:40:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 07:40:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:40:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-12 07:40:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-12 07:40:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-12 07:40:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 07:40:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 07:40:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 07:40:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 07:40:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 07:40:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 07:40:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 07:40:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 07:40:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 07:40:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 07:40:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 07:40:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 07:40:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 07:40:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 07:40:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 07:40:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-07-12 07:40:57,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:40:57,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109295101] [2022-07-12 07:40:57,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109295101] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:40:57,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191621932] [2022-07-12 07:40:57,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:40:57,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:40:57,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:40:57,163 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 07:40:57,167 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 07:40:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:40:58,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 4997 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 07:40:58,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:40:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-07-12 07:40:58,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:40:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-07-12 07:40:58,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191621932] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:40:58,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 07:40:58,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-07-12 07:40:58,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247385247] [2022-07-12 07:40:58,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 07:40:58,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 07:40:58,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:40:58,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 07:40:58,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-12 07:40:58,807 INFO L87 Difference]: Start difference. First operand 169 states and 240 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (62), 6 states have call predecessors, (62), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2022-07-12 07:41:00,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:41:02,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:41:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:41:03,286 INFO L93 Difference]: Finished difference Result 354 states and 502 transitions. [2022-07-12 07:41:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 07:41:03,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (62), 6 states have call predecessors, (62), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 206 [2022-07-12 07:41:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:41:03,288 INFO L225 Difference]: With dead ends: 354 [2022-07-12 07:41:03,288 INFO L226 Difference]: Without dead ends: 197 [2022-07-12 07:41:03,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 467 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-12 07:41:03,290 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 79 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 139 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-12 07:41:03,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 351 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 268 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-07-12 07:41:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-12 07:41:03,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 192. [2022-07-12 07:41:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 136 states have internal predecessors, (169), 45 states have call successors, (45), 10 states have call predecessors, (45), 12 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2022-07-12 07:41:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 267 transitions. [2022-07-12 07:41:03,326 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 267 transitions. Word has length 206 [2022-07-12 07:41:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:41:03,327 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 267 transitions. [2022-07-12 07:41:03,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (62), 6 states have call predecessors, (62), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2022-07-12 07:41:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 267 transitions. [2022-07-12 07:41:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2022-07-12 07:41:03,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:41:03,332 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 9, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:41:03,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 07:41:03,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:03,541 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:41:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:41:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1193364367, now seen corresponding path program 2 times [2022-07-12 07:41:03,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:41:03,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120131407] [2022-07-12 07:41:03,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-12 07:41:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 07:41:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 07:41:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 07:41:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 07:41:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:04,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 07:41:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 07:41:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-12 07:41:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-12 07:41:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-12 07:41:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 07:41:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-12 07:41:04,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 07:41:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-12 07:41:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-12 07:41:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-12 07:41:04,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 07:41:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-12 07:41:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-12 07:41:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-12 07:41:04,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-12 07:41:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-12 07:41:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-12 07:41:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-12 07:41:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-12 07:41:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1078 trivial. 0 not checked. [2022-07-12 07:41:04,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:04,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120131407] [2022-07-12 07:41:04,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120131407] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:41:04,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137600328] [2022-07-12 07:41:04,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 07:41:04,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:04,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:41:04,648 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 07:41:04,650 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 07:41:06,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 07:41:06,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 07:41:06,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 4282 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 07:41:06,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:41:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2022-07-12 07:41:06,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 07:41:06,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137600328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 07:41:06,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 07:41:06,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-12 07:41:06,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830277254] [2022-07-12 07:41:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 07:41:06,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 07:41:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:41:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 07:41:06,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-12 07:41:06,629 INFO L87 Difference]: Start difference. First operand 192 states and 267 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-12 07:41:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:41:06,647 INFO L93 Difference]: Finished difference Result 344 states and 482 transitions. [2022-07-12 07:41:06,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 07:41:06,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 224 [2022-07-12 07:41:06,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:41:06,649 INFO L225 Difference]: With dead ends: 344 [2022-07-12 07:41:06,649 INFO L226 Difference]: Without dead ends: 192 [2022-07-12 07:41:06,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-12 07:41:06,652 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 07:41:06,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 07:41:06,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-07-12 07:41:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-07-12 07:41:06,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 134 states have (on average 1.2537313432835822) internal successors, (168), 136 states have internal predecessors, (168), 45 states have call successors, (45), 10 states have call predecessors, (45), 12 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2022-07-12 07:41:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 266 transitions. [2022-07-12 07:41:06,667 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 266 transitions. Word has length 224 [2022-07-12 07:41:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:41:06,668 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 266 transitions. [2022-07-12 07:41:06,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2022-07-12 07:41:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 266 transitions. [2022-07-12 07:41:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-12 07:41:06,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:41:06,671 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:41:06,700 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 07:41:06,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:06,893 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:41:06,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:41:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1496592282, now seen corresponding path program 1 times [2022-07-12 07:41:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:41:06,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871705634] [2022-07-12 07:41:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 07:41:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 07:41:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 07:41:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 07:41:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 07:41:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 07:41:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 07:41:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 07:41:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 07:41:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 07:41:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 07:41:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 07:41:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 07:41:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 07:41:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 07:41:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 07:41:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 07:41:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 07:41:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 07:41:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 07:41:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 07:41:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 07:41:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 07:41:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 07:41:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 07:41:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-12 07:41:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1197 trivial. 0 not checked. [2022-07-12 07:41:07,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:07,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871705634] [2022-07-12 07:41:07,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871705634] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:41:07,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019796438] [2022-07-12 07:41:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:07,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:07,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:41:07,841 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 07:41:07,842 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 07:41:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:09,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 5430 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-12 07:41:09,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:41:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 374 proven. 21 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2022-07-12 07:41:09,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 07:41:10,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 1167 trivial. 0 not checked. [2022-07-12 07:41:10,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019796438] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 07:41:10,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 07:41:10,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 26 [2022-07-12 07:41:10,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572110530] [2022-07-12 07:41:10,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 07:41:10,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 07:41:10,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 07:41:10,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 07:41:10,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2022-07-12 07:41:10,388 INFO L87 Difference]: Start difference. First operand 192 states and 266 transitions. Second operand has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 21 states have internal predecessors, (118), 15 states have call successors, (62), 12 states have call predecessors, (62), 12 states have return successors, (61), 15 states have call predecessors, (61), 15 states have call successors, (61) [2022-07-12 07:41:12,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:41:14,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:41:16,451 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:41:18,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 07:41:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 07:41:23,654 INFO L93 Difference]: Finished difference Result 1037 states and 1615 transitions. [2022-07-12 07:41:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-07-12 07:41:23,655 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 21 states have internal predecessors, (118), 15 states have call successors, (62), 12 states have call predecessors, (62), 12 states have return successors, (61), 15 states have call predecessors, (61), 15 states have call successors, (61) Word has length 244 [2022-07-12 07:41:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 07:41:23,660 INFO L225 Difference]: With dead ends: 1037 [2022-07-12 07:41:23,660 INFO L226 Difference]: Without dead ends: 878 [2022-07-12 07:41:23,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 675 GetRequests, 568 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3902 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1769, Invalid=9787, Unknown=0, NotChecked=0, Total=11556 [2022-07-12 07:41:23,664 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 1102 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 1400 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 4034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1400 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-07-12 07:41:23,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 1094 Invalid, 4034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1400 Valid, 2630 Invalid, 4 Unknown, 0 Unchecked, 10.7s Time] [2022-07-12 07:41:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-07-12 07:41:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 547. [2022-07-12 07:41:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 376 states have (on average 1.25) internal successors, (470), 381 states have internal predecessors, (470), 108 states have call successors, (108), 50 states have call predecessors, (108), 62 states have return successors, (178), 115 states have call predecessors, (178), 108 states have call successors, (178) [2022-07-12 07:41:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 756 transitions. [2022-07-12 07:41:23,713 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 756 transitions. Word has length 244 [2022-07-12 07:41:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 07:41:23,714 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 756 transitions. [2022-07-12 07:41:23,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.538461538461538) internal successors, (118), 21 states have internal predecessors, (118), 15 states have call successors, (62), 12 states have call predecessors, (62), 12 states have return successors, (61), 15 states have call predecessors, (61), 15 states have call successors, (61) [2022-07-12 07:41:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 756 transitions. [2022-07-12 07:41:23,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2022-07-12 07:41:23,718 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 07:41:23,718 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 9, 9, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 07:41:23,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-12 07:41:23,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:23,935 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 07:41:23,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 07:41:23,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1922354694, now seen corresponding path program 1 times [2022-07-12 07:41:23,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 07:41:23,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785761329] [2022-07-12 07:41:23,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:23,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 07:41:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:43,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-12 07:41:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:43,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:43,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:43,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 07:41:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 07:41:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 07:41:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 07:41:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 07:41:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-12 07:41:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 07:41:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 07:41:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 07:41:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-12 07:41:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 07:41:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 07:41:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 07:41:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 07:41:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-12 07:41:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 07:41:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-12 07:41:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-12 07:41:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-12 07:41:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-12 07:41:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-12 07:41:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-12 07:41:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 07:41:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-12 07:41:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-12 07:41:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-07-12 07:41:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1203 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2022-07-12 07:41:44,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 07:41:44,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785761329] [2022-07-12 07:41:44,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785761329] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 07:41:44,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731935776] [2022-07-12 07:41:44,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 07:41:44,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 07:41:44,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 07:41:44,542 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 07:41:44,542 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 07:41:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 07:41:47,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 5576 conjuncts, 133 conjunts are in the unsatisfiable core [2022-07-12 07:41:47,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 07:41:47,968 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 07:41:48,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:48,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:48,875 INFO L356 Elim1Store]: treesize reduction 156, result has 41.1 percent of original size [2022-07-12 07:41:48,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 442 treesize of output 597 [2022-07-12 07:41:48,920 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 07:41:48,944 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 07:41:48,963 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 07:41:48,990 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 07:41:49,291 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:41:49,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:49,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:49,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:49,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:49,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:49,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:49,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 99 [2022-07-12 07:41:49,870 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 07:41:49,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:49,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:49,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:49,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:49,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:49,898 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:49,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:49,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:49,910 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:49,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:49,919 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:49,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 192 [2022-07-12 07:41:49,962 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 07:41:49,987 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 07:41:50,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:50,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:50,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:50,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:50,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:50,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:50,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:50,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:50,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:41:50,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 186 [2022-07-12 07:41:50,196 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 07:41:50,222 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 07:41:50,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:50,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:50,282 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-07-12 07:41:50,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 29 [2022-07-12 07:41:50,296 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 07:41:56,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:56,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:56,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:56,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:56,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:41:56,278 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 07:41:56,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 33 case distinctions, treesize of input 1297 treesize of output 1509 [2022-07-12 07:41:56,448 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 7 treesize of output 5 [2022-07-12 07:41:56,491 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 7 treesize of output 5 [2022-07-12 07:41:56,576 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 7 treesize of output 5 [2022-07-12 07:41:57,172 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 7 treesize of output 5 [2022-07-12 07:41:58,203 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 7 treesize of output 5 [2022-07-12 07:41:58,207 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:42:00,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:00,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:00,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:00,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:00,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:00,913 INFO L356 Elim1Store]: treesize reduction 180, result has 27.7 percent of original size [2022-07-12 07:42:00,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 1352 treesize of output 1366 [2022-07-12 07:42:01,649 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 7 treesize of output 5 [2022-07-12 07:42:01,722 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 7 treesize of output 5 [2022-07-12 07:42:01,800 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 7 treesize of output 5 [2022-07-12 07:42:02,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:02,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:02,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:02,177 INFO L356 Elim1Store]: treesize reduction 180, result has 27.7 percent of original size [2022-07-12 07:42:02,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 84 treesize of output 150 [2022-07-12 07:42:02,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:02,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:02,346 INFO L356 Elim1Store]: treesize reduction 200, result has 25.7 percent of original size [2022-07-12 07:42:02,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 84 treesize of output 150 [2022-07-12 07:42:02,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:02,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:42:02,596 INFO L356 Elim1Store]: treesize reduction 108, result has 58.3 percent of original size [2022-07-12 07:42:02,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 84 treesize of output 224 [2022-07-12 07:42:31,434 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 7 treesize of output 5 [2022-07-12 07:42:31,460 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 7 treesize of output 5 [2022-07-12 07:42:31,508 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 7 treesize of output 5 [2022-07-12 07:42:31,524 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 7 treesize of output 5 [2022-07-12 07:42:31,563 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 7 treesize of output 5 [2022-07-12 07:42:31,592 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 7 treesize of output 5 [2022-07-12 07:42:31,647 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 7 treesize of output 5 [2022-07-12 07:42:31,671 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 7 treesize of output 5 [2022-07-12 07:42:31,743 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 7 treesize of output 5 [2022-07-12 07:42:31,788 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 7 treesize of output 5 [2022-07-12 07:42:31,844 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 7 treesize of output 5 [2022-07-12 07:42:31,879 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 7 treesize of output 5 [2022-07-12 07:42:50,511 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:42:57,276 INFO L356 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2022-07-12 07:42:57,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 622 treesize of output 638 [2022-07-12 07:43:01,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 07:43:01,317 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 1048 treesize of output 1052 [2022-07-12 07:43:02,466 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 07:43:02,498 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:02,498 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 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:02,526 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:02,565 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:02,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:02,599 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:02,641 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 07:43:02,641 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 1 case distinctions, treesize of input 54 treesize of output 61 [2022-07-12 07:43:02,669 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:02,695 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 07:43:02,695 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 1 case distinctions, treesize of input 54 treesize of output 61 [2022-07-12 07:43:02,704 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:02,740 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 07:43:02,741 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 1 case distinctions, treesize of input 54 treesize of output 61 [2022-07-12 07:43:02,770 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:02,826 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 07:43:02,827 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 1 case distinctions, treesize of input 54 treesize of output 61 [2022-07-12 07:43:02,864 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:02,975 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 07:43:02,975 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 61 treesize of output 66 [2022-07-12 07:43:02,991 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:03,048 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-07-12 07:43:03,048 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 1 case distinctions, treesize of input 54 treesize of output 1 [2022-07-12 07:43:03,141 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:03,142 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 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:03,234 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 07:43:03,365 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:03,365 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 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:03,500 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 07:43:03,651 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:03,652 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 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:03,780 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 07:43:03,781 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 55 treesize of output 59 [2022-07-12 07:43:03,874 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:03,874 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 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:03,970 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 07:43:04,030 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:04,030 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 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:04,110 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 07:43:04,218 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:04,219 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 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:04,311 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 07:43:04,400 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:04,400 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 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:04,519 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 07:43:04,519 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 44 treesize of output 48 [2022-07-12 07:43:04,608 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:04,608 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 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:04,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 07:43:04,696 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 44 treesize of output 48 [2022-07-12 07:43:04,892 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 07:43:04,893 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 1 case distinctions, treesize of input 50 treesize of output 62 [2022-07-12 07:43:05,122 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 07:43:05,123 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 1 case distinctions, treesize of input 50 treesize of output 62 [2022-07-12 07:43:05,256 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:05,256 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 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:05,360 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 07:43:05,485 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:05,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:05,590 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 07:43:05,591 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 44 treesize of output 48 [2022-07-12 07:43:05,808 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:05,809 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 1 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 07:43:05,943 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 07:43:06,248 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 07:43:06,249 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 61 treesize of output 72 [2022-07-12 07:43:06,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 07:43:06,321 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 25 treesize of output 29 [2022-07-12 07:43:06,467 INFO L356 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-07-12 07:43:06,467 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 1 case distinctions, treesize of input 54 treesize of output 1 [2022-07-12 07:43:06,495 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 07:43:06,649 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:06,831 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:06,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 07:43:06,933 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 1 [2022-07-12 07:43:06,984 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 7 treesize of output 5 [2022-07-12 07:43:07,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:07,297 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 42 treesize of output 39 [2022-07-12 07:43:07,337 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 07:43:07,359 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 07:43:07,401 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 07:43:07,401 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 1 case distinctions, treesize of input 20 treesize of output 32 [2022-07-12 07:43:07,427 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:07,442 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 07:43:07,472 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-07-12 07:43:07,611 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 07:43:07,643 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 07:43:07,644 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 1 case distinctions, treesize of input 20 treesize of output 32 [2022-07-12 07:43:07,731 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 07:43:07,749 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 07:43:07,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:07,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 86 treesize of output 122 [2022-07-12 07:43:07,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:07,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:07,862 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 3 [2022-07-12 07:43:07,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:07,884 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:07,884 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 3 [2022-07-12 07:43:07,990 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 07:43:08,081 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 07:43:08,081 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 1 case distinctions, treesize of input 50 treesize of output 62 [2022-07-12 07:43:08,200 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 07:43:08,261 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 07:43:08,299 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 07:43:08,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 07:43:08,499 INFO L356 Elim1Store]: treesize reduction 46, result has 22.0 percent of original size [2022-07-12 07:43:08,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 107 [2022-07-12 07:43:08,669 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 07:43:08,773 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 07:43:08,876 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 07:43:08,877 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 1 case distinctions, treesize of input 20 treesize of output 32 [2022-07-12 07:43:08,963 INFO L356 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2022-07-12 07:43:08,964 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 1 case distinctions, treesize of input 50 treesize of output 1 [2022-07-12 07:43:08,977 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 07:43:09,097 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 07:43:28,691 WARN L233 SmtUtils]: Spent 12.52s on a formula simplification. DAG size of input: 351 DAG size of output: 102 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 07:43:38,080 WARN L233 SmtUtils]: Spent 7.76s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 07:43:48,131 WARN L233 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 106 DAG size of output: 94 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 07:43:58,188 WARN L233 SmtUtils]: Spent 6.51s on a formula simplification that was a NOOP. DAG size: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 07:44:09,504 WARN L233 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 07:44:38,025 WARN L233 SmtUtils]: Spent 26.08s on a formula simplification. DAG size of input: 123 DAG size of output: 102 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 07:44:50,750 WARN L233 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 07:45:05,861 WARN L233 SmtUtils]: Spent 6.27s on a formula simplification that was a NOOP. DAG size: 101 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)